例如:
如String str="sheepmusheepmummppmm"答案:出现次数相同字母有s、h、u,对应出现的次数为2和4(答案输出格式不
限)
代码:
这里使用map来解决
前面切割字符串将其放进map比较简单 就不贴代码了
package com.atguigu.gulimall.product.mianshi;
import java.util.HashMap;
import java.util.Map;
public class Main {
public static void main(String[] args) {
Map<Character, Integer> originalMap = new HashMap<>();
originalMap.put('a', 5);
originalMap.put('d', 3);
originalMap.put('t', 3);
originalMap.put('u', 2);
originalMap.put('g', 2);
originalMap.put('h', 2);
originalMap.put('y', 2);
originalMap.put('j', 2);
originalMap.put('k', 1);
Map<Integer, Integer> valueCount = new HashMap<>();
Map<Character, Integer> resultMap = new HashMap<>();
for (int value : originalMap.values()) {
valueCount.put(value, valueCount.getOrDefault(value, 0) + 1);
}
for (Map.Entry<Character, Integer> entry : originalMap.entrySet()) {
char key = entry.getKey();
int value = entry.getValue();
if (valueCount.get(value) > 1) {
resultMap.put(key, value);
}
}
System.out.println("原始map集合:" + originalMap);
System.out.println("处理后的map集合:" + resultMap);
}
}