首页 > 其他分享 >leetcode-1374-easy

leetcode-1374-easy

时间:2023-02-15 21:35:30浏览次数:46  
标签:string strings valid result easy Input such leetcode 1374

Generate a String With Characters That Have Odd Counts

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

思路一:判断奇偶数

public String generateTheString(int n) {
StringBuilder result = new StringBuilder();

        boolean isOdd = (n & 1) == 1;

        for (int i = 0; i < (isOdd ? n : n - 1); i++) {
            result.append('a');
        }

        if (!isOdd) {
            result.append('b');
        }

        return result.toString();
    }

标签:string,strings,valid,result,easy,Input,such,leetcode,1374
From: https://www.cnblogs.com/iyiluo/p/17124761.html

相关文章

  • leetcode-1051-easy
    HeightCheckerAschoolistryingtotakeanannualphotoofallthestudents.Thestudentsareaskedtostandinasinglefilelineinnon-decreasingorderby......
  • leetcode-1323-easy
    Maximum69NumberYouaregivenapositiveintegernumconsistingonlyofdigits6and9.Returnthemaximumnumberyoucangetbychangingatmostonedigit......
  • leetcode-1346-easy
    CheckifNandItsDoubleExistGivenanarrayarrofintegers,checkifthereexisttwoindicesiandjsuchthat:i!=j0<=i,j<arr.lengtharr[i]==2......
  • leetcode-908-easy
    SmallestRangeIYouaregivenanintegerarraynumsandanintegerk.Inoneoperation,youcanchooseanyindexiwhere0<=i<nums.lengthandchangenums......
  • leetcode-821-easy
    ShortestDistancetoaCharacterGivenastringsandacharactercthatoccursins,returnanarrayofintegersanswerwhereanswer.length==s.lengthand......
  • leetcode-10460-easy
    LastStoneWeightYouaregivenanarrayofintegersstoneswherestones[i]istheweightoftheithstone.Weareplayingagamewiththestones.Oneachtur......
  • leetcode-783-easy
    MinimumDistancdBetweenNodesGiventherootofaBinarySearchTree(BST),returntheminimumdifferencebetweenthevaluesofanytwodifferentnodesinthe......
  • leetcode-824-easy
    GoatLatinYouaregivenastringsentencethatconsistofwordsseparatedbyspaces.Eachwordconsistsoflowercaseanduppercaselettersonly.Wewouldlik......
  • 【LeetCode栈与队列#05】滑动窗口最大值
    滑动窗口最大值力扣题目链接(opensnewwindow)给定一个数组nums,有一个大小为k的滑动窗口从数组的最左侧移动到数组的最右侧。你只可以看到在滑动窗口内的k个数字。......
  • [Leetcode]435. 无重叠区间
    435.无重叠区间给定一个区间的集合 intervals ,其中intervals[i]=[starti,endi] 。返回需要移除区间的最小数量,使剩余区间互不重叠 。示例1:输入:intervals......