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

这题不知道有什么意义,取个奇数个a,假设是偶数,再加一个b字符即可。

class GenerateAStringWithCharactersThatHaveOddCounts : public Solution {
public:
    void Exec() {

    }
    string generateTheString(int n) {
        string s(n % 2 == 0 ? n - 1 : n, 'a');
        if (n % 2 == 0) {
            s.push_back('b');
        }
        return s;
    }
};
共 0 条回复
暂时没有人回复哦,赶紧抢沙发
发表新回复

作者

sryan
today is a good day