समस्या
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.
सीमाएँ
0 ≤ n ≤ 100
उदाहरण
इनपुट:
n = 4
अपेक्षित आउटपुट:
expected = ["1", "0 1", "1 0 1", "0 1 0 1"]
इनपुट:
long long n = 4;
अपेक्षित आउटपुट:
std::vector<std::string> expected = {"1", "0 1", "1 0 1", "0 1 0 1"};
इनपुट:
long n = 4;
अपेक्षित आउटपुट:
string[] expected = new string[] {"1", "0 1", "1 0 1", "0 1 0 1"};
व्याख्या
Row 4 starts with 4 + 1 = 5 (odd), so 0: ["1", "0 1", "1 0 1", "0 1 0 1"].
इनपुट:
n = 2
अपेक्षित आउटपुट:
expected = ["1", "0 1"]
इनपुट:
long long n = 2;
अपेक्षित आउटपुट:
std::vector<std::string> expected = {"1", "0 1"};
इनपुट:
long n = 2;
अपेक्षित आउटपुट:
string[] expected = new string[] {"1", "0 1"};
व्याख्या
Row 2, position 1 gives 3 (odd) and position 2 gives 4 (even): ["1", "0 1"].
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
Look at whether i + j is even or odd for the first few cells.
संकेत 2
Neighbouring positions always have opposite digits.
संकेत 3
Join the digits with single spaces so nothing trails at the end.
अपेक्षित जटिलता
O(n^2) time, O(n^2) extra space
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।