727. Concatenate N Copies of a String

Given a string s and a non-negative integer n, return the string obtained by concatenating n copies of s. If n is 0 or s is empty, return an empty string. You must implement the concatenation recursively.

Input: A string s and a non-negative integer n, formatted as "s", n.

Output: Return the concatenated string wrapped in double quotes.

Examples

Input: "ab", 3
Output: "ababab"
Explanation: 'ab' repeated three times.

Input: "hi", 0
Output: ""
Explanation: Zero copies -> empty string.

Input: "x", 5
Output: "xxxxx"
Explanation: Five copies of 'x'.

Constraints

• 0 <= s.length <= 100
• 0 <= n <= 100
• Final length <= 10^4

Asked by