समस्या
Picture a grid with height rows and width columns, both numbered from 0. A line of stars starts in the top-left cell and moves one column right at every step, going one row down each time until it reaches the bottom row and then one row up each time until it reaches the top row, again and again. Exactly: let P = 2(height − 1) and p = c mod P. Column c has its only star in row p when p < height, and in row P − p otherwise. All other cells are spaces.
Implement zigzag_wave_pattern(width, height).
Input
width: The number of columns.
height: The number of rows.
Output
Return height strings from top to bottom with trailing spaces removed. A row that ends up with no star is an empty string.
सीमाएँ
1 ≤ width ≤ 80, 2 ≤ height ≤ 20
उदाहरण
इनपुट:
width = 9
height = 3
अपेक्षित आउटपुट:
expected = ["* * *", " * * * *", " * *"]
इनपुट:
long long width = 9;
long long height = 3;
अपेक्षित आउटपुट:
std::vector<std::string> expected = {"* * *", " * * * *", " * *"};
इनपुट:
long width = 9;
long height = 3;
अपेक्षित आउटपुट:
string[] expected = new string[] {"* * *", " * * * *", " * *"};
व्याख्या
P = 4, so columns 0 to 8 use rows 0, 1, 2, 1, 0, 1, 2, 1, 0: ["* * *", " * * * *", " * *"].
इनपुट:
width = 5
height = 2
अपेक्षित आउटपुट:
expected = ["* * *", " * *"]
इनपुट:
long long width = 5;
long long height = 2;
अपेक्षित आउटपुट:
std::vector<std::string> expected = {"* * *", " * *"};
इनपुट:
long width = 5;
long height = 2;
अपेक्षित आउटपुट:
string[] expected = new string[] {"* * *", " * *"};
व्याख्या
With two rows the star alternates top and bottom: ["* * *", " * *"].
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
The movement repeats every 2(height − 1) columns.
संकेत 2
Inside one period the row goes down from 0 to height − 1 and back up.
संकेत 3
It can be easier to fill a 2D grid of spaces first and then turn each row into a string.
अपेक्षित जटिलता
O(width * height) time, O(width * height) extra space
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।