Description
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.
Example 1:
1 | Input: n = 4 |
Example 2:
1 | Input: n = 2 |
Example 3:
1 | Input: n = 7 |
Constraints:
1 | 1 <= n <= 500 |
Solutions
- When n is an odd number, you can use one character, which itself is an odd number of times;
- Two characters can be used when n is even, odd+odd=even
1 | class Solution: |