Given an integer
n, return a string with
n characters such that each character in such string occurs an odd number of times.
The returned string must contain only lowercase English letters. If there are multiples valid strings, return any of them.
Input: n = 4 Output: "pppz" Explanation: "pppz" is a valid string since the character 'p' occurs three times and the character 'z' occurs once. Note that there are many other valid strings such as "ohhh" and "love".
Input: n = 2 Output: "xy" Explanation: "xy" is a valid string since the characters 'x' and 'y' occur once. Note that there are many other valid strings such as "ag" and "ur".
Input: n = 7 Output: "holasss"
1 <= n <= 500
For even length, we can return (n – 1) times one letter and one different letter. For odd length, we can return n times a same letter.
class Solution: def generateTheString(self, n: int) -> str: if n < 2: return 'a' if n % 2 == 0: return 'a' * (n - 1) + 'b' * 1 else: return 'a' * n return ""
- Time Complexity: O(N).
- Space Complexity: O(N).