Problem
In this triangle row i (counting from 1) holds i digits. Number the positions in a row j = 1 to i; the digit at row i, position j is 1 when i + j is even and 0 when it is odd. So row 1 is 1, row 2 is 0 1, row 3 is 1 0 1, and the digits alternate along every row and every column.
Implement binary_triangle(n).
Input
n: The number of rows.
Output
Return the rows from top to bottom. Inside a row the digits are separated by exactly one space, with no leading or trailing spaces.
Constraints
0 ≤ n ≤ 100
Examples
Input:
n = 4
Expected output:
expected = ["1", "0 1", "1 0 1", "0 1 0 1"]
Input:
long long n = 4;
Expected output:
std::vector<std::string> expected = {"1", "0 1", "1 0 1", "0 1 0 1"};
Input:
long n = 4;
Expected output:
string[] expected = new string[] {"1", "0 1", "1 0 1", "0 1 0 1"};
Explanation
Row 4 starts with 4 + 1 = 5 (odd), so 0: ["1", "0 1", "1 0 1", "0 1 0 1"].
Input:
n = 2
Expected output:
expected = ["1", "0 1"]
Input:
long long n = 2;
Expected output:
std::vector<std::string> expected = {"1", "0 1"};
Input:
long n = 2;
Expected output:
string[] expected = new string[] {"1", "0 1"};
Explanation
Row 2, position 1 gives 3 (odd) and position 2 gives 4 (even): ["1", "0 1"].
How to approach it
Try on your own first, then open one hint at a time.
Hint 1
Look at whether i + j is even or odd for the first few cells.
Hint 2
Neighbouring positions always have opposite digits.
Hint 3
Join the digits with single spaces so nothing trails at the end.
Expected complexity
O(n^2) time, O(n^2) extra space
References
This challenge is adapted for CodeUtility. Follow the statement and constraints above.