“asdascveasrgdfsdf”获取该字符串中，每一个字母出现的次数。 要求：打印结果是：a(2)b(1)...

“asdascveasrgdfsdf”获取该字符串中，每一个字母出现的次数。

要求：打印结果是：a(2)b(1)…

package com.Work3;

import java.util.Iterator;
import java.util.TreeMap;

/**
 * @Author: 廾匸
 * @Date: 2020/11/22 18:43
 * @Description: 获取字符
 * @version: 1.01
 */

public class Str {
    public static void main (String[] args){

        String str = "asdascveasrgdfsdf";
        
        char[] chars = str.toCharArray();
        TreeMap<Character,Integer> treeMap = new TreeMap<>();
        for (int i = 0; i < chars.length; i++) {
            if(!(chars[i]>='a' && chars[i]<='z' || chars[i]>='A' && chars[i]<='Z')){
                continue;
            }
            Integer integer = treeMap.get(chars[i]);
            int count = 1;
            if(integer != null){
                count  = integer+1;
            }
            treeMap.put(chars[i],count);
        }
        System.out.println(Str.toString(treeMap));
    }

    private static String toString(TreeMap<Character, Integer> treeMap) {

        StringBuilder sb = new StringBuilder();

        Iterator<Character> it = treeMap.keySet().iterator();

        while(it.hasNext()){
            Character key = it.next();
            Integer value = treeMap.get(key);
            
            sb.append(key+"("+value+")");
        }
        return sb.toString();
    }
}