[LeetCode] 1374. Generate a String With Characters That H...

博客园 - Grandyang

[LeetCode] 1375. Number of Times Binary String Is Prefix-Aligned 二进制字符串前缀一致的次数 [LeetCode] 1373. Maximum Sum BST in Binary Tree 二叉搜索子树的最大键值和 [LeetCode] 1372. Longest ZigZag Path in a Binary Tree 二叉树中的最长交错路径 [LeetCode] 1371. Find the Longest Substring Containing Vowels in Even Counts 每个元音包含偶数次的最长子字符串 [LeetCode] 1370. Increasing Decreasing String 上升下降字符串 [LeetCode] 1368. Minimum Cost to Make at Least One Valid Path in a Grid 使网格图至少有一条有效路径的最小代价 [LeetCode] 1367. Linked List in Binary Tree 二叉树中的链表 [LeetCode] 1366. Rank Teams by Votes 通过投票对团队排名 [LeetCode] 1365. How Many Numbers Are Smaller Than the Current Number 有多少小于当前数字的数字 [LeetCode] 1363. Largest Multiple of Three 形成三的最大倍数 [LeetCode] 1362. Closest Divisors 最接近的因数 [LeetCode] 1361. Validate Binary Tree Nodes 验证二叉树 [LeetCode] 1360. Number of Days Between Two Dates 日期之间隔几天 [LeetCode] 1359. Count All Valid Pickup and Delivery Options 有效的快递序列数目 [LeetCode] 1358. Number of Substrings Containing All Three Characters 包含所有三种字符的子字符串数目 [LeetCode] 1357. Apply Discount Every n Orders 每隔n个顾客打折 [LeetCode] 1356. Sort Integers by The Number of 1 Bits 根据数字二进制下1 的数目排序 [LeetCode] 1354. Construct Target Array With Multiple Sums 多次求和构造目标数组 [LeetCode] 1353. Maximum Number of Events That Can Be Attended 最多可以参加的会议数目 [LeetCode] 1352. Product of the Last K Numbers 最后 K 个数的乘积 [LeetCode] 1351. Count Negative Numbers in a Sorted Matrix 统计有序矩阵中的负数 [LeetCode] 1349. Maximum Students Taking Exam 参加考试的最大学生数

Grandyang · 2026-08-26 · via 博客园 - Grandyang

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为奇数的时候，那其实只需要一个字符就可以保证出现次数为奇数了，直接返回长度为n，都是字符a的字符串即可；当n为偶数的时候，那么 n-1 一定是奇数，此时只需要返回一个由 n-1 个字符a组成的字符串，再加上一个字符b即可，参见代码如下：

class Solution {
public:
    string generateTheString(int n) {
        return (n % 2 == 0) ? (string(n - 1, 'a') + "b") : string(n, 'a');
    }
};

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1374

参考资料：

https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts

https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/solutions/532520/javacpython-one-lines-by-lee215-odk4/

https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/solutions/538947/java-100-speed-and-100-memory-by-riyafa-ei5f/

LeetCode All in One 题目讲解汇总(持续更新中...)

此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。原文来自 — 版权归原作者所有。

推荐订阅源

博客园 - Grandyang