समस्या
The right triangle is usually the first pattern program in an intro course: row 1 has one *, row 2 has two, and so on down to row n. The outer loop picks the row and the inner loop (or string repetition) builds it.
Implement right_triangle_stars(n).
Input
n: The number of rows.
Output
Return the rows from top to bottom. Row i (counting from 1) is i * characters with no spaces.
सीमाएँ
0 ≤ n ≤ 100
उदाहरण
इनपुट:
n = 3
अपेक्षित आउटपुट:
expected = ["*", "**", "***"]
इनपुट:
long long n = 3;
अपेक्षित आउटपुट:
std::vector<std::string> expected = {"*", "**", "***"};
इनपुट:
long n = 3;
अपेक्षित आउटपुट:
string[] expected = new string[] {"*", "**", "***"};
व्याख्या
Rows grow by one star: "*", "**", "***".
इनपुट:
n = 1
अपेक्षित आउटपुट:
expected = ["*"]
इनपुट:
long long n = 1;
अपेक्षित आउटपुट:
std::vector<std::string> expected = {"*"};
इनपुट:
long n = 1;
अपेक्षित आउटपुट:
string[] expected = new string[] {"*"};
व्याख्या
A single row with one star: ["*"].
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
Row i needs exactly i stars, so the row number is all you need.
संकेत 2
Repeat the star character instead of adding one character at a time if your language allows it.
संकेत 3
When n is 0, return an empty list.
अपेक्षित जटिलता
O(n^2) time, O(n^2) extra space
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।