题目

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

分析

题意：给一个整数n，返回一个字符串，字符串的长度等于n，里面的每种小写字母都是奇数。

我分析了一大堆，最后没做出来。

智商低。

算法

如果n为奇数，则返回n个a
如果n为偶数，则返回一个a+n-1个b

解答

class Solution {
    public String generateTheString(int n) {
        if(n%2 == 1){
            return "n".repeat(n);
        }
        else{
            return "n".repeat(n-1)+"a";
        }
    }
}