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:
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".
Example 2:
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".
Example 3:
Input: n = 7 Output: "holasss"
Constraints:
1 <= n <= 500
Solution: Greedy
if n is odd, return n ‘a’s.
otherwise, return n -1 ‘a’s and 1 ‘b’
Time complexity: O(n)
Space complexity: O(n) or O(1)
C++
1 2 3 4 5 6 7 |
// Author: Huahua class Solution { public: string generateTheString(int n) { return n & 1 ? string(n, 'a') : string(n - 1, 'a') + "b"; } }; |
Python3
1 2 3 4 5 |
# Author: Huahua class Solution: def generateTheString(self, n: int) -> str: ans = ['a'] * n if n % 2 == 1 else ['a'] * (n - 1) + ['b'] return ''.join(ans) |
请尊重作者的劳动成果,转载请注明出处!花花保留对文章/视频的所有权利。
如果您喜欢这篇文章/视频,欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Be First to Comment