Facile 0 résolus 0 % de réussite

X Pattern

Draw both diagonals of an n by n square with stars to form an X.

Ce que vous allez apprendre

  • Recognise the two diagonals of a square by their coordinates
  • Build each row cell by cell
  • Trim trailing spaces from a row

Problème

Afficher la traduction

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.

Contraintes

0 ≤ n ≤ 100

Exemples

Exemple 1
Entrée :
n = 5

Sortie attendue :
expected = ["*   *", " * *", "  *", " * *", "*   *"]
Entrée :
long long n = 5;

Sortie attendue :
std::vector<std::string> expected = {"*   *", " * *", "  *", " * *", "*   *"};
Entrée :
long n = 5;

Sortie attendue :
string[] expected = new string[] {"*   *", " * *", "  *", " * *", "*   *"};

Explication

Row 0 has stars at columns 0 and 4, row 2 only at column 2: ["* *", " * *", " *", " * *", "* *"].

Exemple 2
Entrée :
n = 4

Sortie attendue :
expected = ["*  *", " **", " **", "*  *"]
Entrée :
long long n = 4;

Sortie attendue :
std::vector<std::string> expected = {"*  *", " **", " **", "*  *"};
Entrée :
long n = 4;

Sortie attendue :
string[] expected = new string[] {"*  *", " **", " **", "*  *"};

Explication

Row 1 has stars at columns 1 and 2, which sit side by side: ["* *", " **", " **", "* *"].

Comment l'aborder

Essayez d'abord seul, puis ouvrez les indices un par un.

Indice 1

The main diagonal is where the row equals the column.

Indice 2

The other diagonal is where the row and column add up to n − 1.

Indice 3

Remove trailing spaces after building each row.

Complexité attendue

O(n^2) time, O(n^2) extra space

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

La meilleure solution validée de chaque codeur. Les plus rapides, les plus légères et les mieux notées passent devant.

Aucune solution validée pour l'instant. Résolvez-le et prenez la première place.

Apprenez des autres

Solutions de la communauté

Aucune solution publiée pour l'instant. Résolvez ce défi pour partager la première.