1370. 上升下降字符串

package Group3;

import java.util.Arrays;

public class Test3 {
    public static void main(String[] args) {
       String s = "leetcode";
       Test3 test3=new Test3();
        String s1 = test3.sortString(s);
        System.out.println(s1);
    }
    public String sortString(String s) {
        //相当于26个桶
        int[] bucket = new int[26];
        //把s中的字符分别放到对应的桶里
        for (int i = 0; i < s.length(); i++) {
            bucket[s.charAt(i) - 'a']++;
        }
        //存储计算的结果
        char[] res = new char[s.length()];
        int index = 0;
        while (index < s.length()) {
            //先从左往右找，遍历26个桶,如果当前桶不为空，
            //就从当前桶里拿出一个元素出来
            for (int i = 0; i < 26; i++) {
                if (bucket[i] != 0) {
                    res[index++] = (char) (i + 'a');
                    bucket[i]--;//拿出之后桶中元素的个数要减1
                }
            }
            //从右往左拿，同上
            for (int i = 25; i >= 0; i--) {
                if (bucket[i] != 0) {
                    res[index++] = (char) (i + 'a');
                    bucket[i]--;
                }
            }
        }
        //把结果转化为字符串
        return new String(res);
    }
}

标签：index,String,int,bucket,++,char,1370,字符串,上升
来源： https://blog.csdn.net/lzm123456lq/article/details/110123132