739. Print Pattern — Right Angle Triangle (Recursive)

Given a positive integer n, return a string representing a right-angle triangle built from * characters with n rows. Row i (1-indexed) contains exactly i asterisks. Rows are joined by the literal two-character sequence \n (a backslash followed by an n) so the output is a single line in the test format. Build the string recursively without loops.

Input: A single positive integer n.

Output: Return a string of n rows of stars joined by '\n'.

Examples

Input: 3
Output: *\n**\n***
Explanation: Three rows: '*', '**', '***'.

Input: 1
Output: *
Explanation: Just one star.

Input: 2
Output: *\n**
Explanation: Two rows.

Constraints

• 1 <= n <= 100

Asked by