問題
A checkerboard alternates two colors in both directions. Here a dark cell is # and a light cell is .. Number rows and columns from 0; the cell in row r and column c is # when r + c is even and . when it is odd, so the top-left cell is always #.
Implement checkerboard_pattern(rows, cols).
Input
rows: The number of rows.
cols: The number of columns.
Output
Return rows strings from top to bottom, each exactly cols characters long with no spaces. When rows is 0, return an empty list.
制約
0 ≤ rows ≤ 60, 1 ≤ cols ≤ 60
例
入力:
rows = 3
cols = 4
期待される出力:
expected = ["#.#.", ".#.#", "#.#."]
入力:
long long rows = 3;
long long cols = 4;
期待される出力:
std::vector<std::string> expected = {"#.#.", ".#.#", "#.#."};
入力:
long rows = 3;
long cols = 4;
期待される出力:
string[] expected = new string[] {"#.#.", ".#.#", "#.#."};
解説
Row 0 starts with #, row 1 with ., row 2 with # again: ["#.#.", ".#.#", "#.#."].
入力:
rows = 2
cols = 1
期待される出力:
expected = ["#", "."]
入力:
long long rows = 2;
long long cols = 1;
期待される出力:
std::vector<std::string> expected = {"#", "."};
入力:
long rows = 2;
long cols = 1;
期待される出力:
string[] expected = new string[] {"#", "."};
解説
One column: cell (0, 0) has an even sum and cell (1, 0) an odd one: ["#", "."].
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
Neighbouring cells differ by one in either r or c, so r + c changes parity.
ヒント 2
Decide each cell from (r + c) mod 2.
ヒント 3
Every row has exactly cols characters.
目安の計算量
O(rows * cols) time, O(rows * cols) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。