package com.hncu.hashmapdemo;
import java.util.HashMap;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;
public class HashMapDemo {
//输入一个字符串aababcabcdabcde,统计每个字符出现的个数,结果样式:a(5)b(4)c(3)d(2)e(1)
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.println("请输入一个字符串:");
String line = in.nextLine();
HashMap<Character, Integer> hm = new HashMap<>();
// TreeMap<Character, Integer> hm = new TreeMap<>(); TreeMap会将元素对按key自然排序
for (int i = 0; i < line.length(); i++) {
char key = line.charAt(i); //获得字符串的每个字符
Integer value = hm.get(key); //根据字符获取值
if (hm.get(key) == null) {
hm.put(key, 1);
} else {
value++;
hm.put(key, value);
}
}
StringBuilder sb = new StringBuilder();
//遍历hashmap集合
Set<Character> set = hm.keySet();
for (Character key : set) {
Integer value = hm.get(key);
sb.append(key).append("(").append(value).append(")");// 多次拼接
}
String s = sb.toString(); //转成字符串输出
System.out.println(s);
}
}
统计字符串中每个字符出现的次数(HashMap、TreeMap实现)
最新推荐文章于 2023-05-12 07:57:52 发布