Problema
Picture an n by n grid with rows and columns numbered from 0. The cell in row r and column c holds * when it lies on either diagonal, that is when c = r or c = n − 1 − r; every other cell is a space. Then each row has its trailing spaces removed. For odd n the diagonals cross in a single centre cell; for even n they pass between cells.
Implement x_pattern(n).
Input
n: The side length of the square.
Output
Return the n rows from top to bottom, without trailing spaces.
Restricciones
0 ≤ n ≤ 100
Ejemplos
Entrada:
n = 5
Salida esperada:
expected = ["* *", " * *", " *", " * *", "* *"]
Entrada:
long long n = 5;
Salida esperada:
std::vector<std::string> expected = {"* *", " * *", " *", " * *", "* *"};
Entrada:
long n = 5;
Salida esperada:
string[] expected = new string[] {"* *", " * *", " *", " * *", "* *"};
Explicación
Row 0 has stars at columns 0 and 4, row 2 only at column 2: ["* *", " * *", " *", " * *", "* *"].
Entrada:
n = 4
Salida esperada:
expected = ["* *", " **", " **", "* *"]
Entrada:
long long n = 4;
Salida esperada:
std::vector<std::string> expected = {"* *", " **", " **", "* *"};
Entrada:
long n = 4;
Salida esperada:
string[] expected = new string[] {"* *", " **", " **", "* *"};
Explicación
Row 1 has stars at columns 1 and 2, which sit side by side: ["* *", " **", " **", "* *"].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
The main diagonal is where the row equals the column.
Pista 2
The other diagonal is where the row and column add up to n − 1.
Pista 3
Remove trailing spaces after building each row.
Complejidad esperada
O(n^2) time, O(n^2) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.