HJ23 删除字符串中出现次数最少的字符

谁借莪１个温暖的怀抱￠ 2024-03-27 14:08 14阅读 0赞

> [牛客华为机试题库【题号 HJ开头】（重点看）][HJ]  
> [牛客在线编程算法篇【题号NC开头】][NC]  
> [剑指offer【题号 JZ开头】][offer_ JZ]  
> [力扣][Link 1]

### 1）[原题链接][Link 2] ###

### 2）已有题解 ###

### 3）代码 ###

package string;
    
    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStreamReader;
    import java.util.HashMap;
    import java.util.List;
    import java.util.Map;
    import java.util.stream.Collectors;
    
    import static java.lang.System.in;
    
    public class DeleteTheLeastFrequentCharacterInTheString {
        
        public static void main(String[] args) throws IOException {
        
            // 收集数据源
            BufferedReader bf = new BufferedReader(new InputStreamReader(in));
            String str = bf.readLine();
            bf.close();
            char[] chars = str.toCharArray();
    
            // 统计每个字符的个数
            Map<Character, Integer> tempMap = new HashMap<>();
            for (char aChar : chars) {
        
                Integer orDefault = tempMap.getOrDefault(aChar, 0);
                tempMap.put(aChar, ++orDefault);
            }
    
            // 取最小值
            int min = tempMap.values().stream().mapToInt(Integer::intValue).min().getAsInt();
    
            // 收集最小值的所有字符
            List<Character> collect = tempMap.entrySet().stream().filter(a -> a.getValue() == min).map(Map.Entry::getKey).collect(Collectors.toList());
    
            // 方式1：拼接新字符串
            StringBuilder sb = new StringBuilder();
            for (char aChar : chars) {
        
                if (collect.contains(aChar)) {
        
                    continue;
                }
                sb.append(aChar);
            }
            System.out.println(sb);
    
            // 方式2：
            for (int i = 0; i < collect.size(); i++) {
        
                str = str.replaceAll(String.valueOf(collect.get(i)), "");
            }
    
            // 输出结果
            System.out.println(str);
        }
    }

[HJ]: https://www.nowcoder.com/exam/oj/ta?tpId=37
[NC]: https://www.nowcoder.com/exam/oj
[offer_ JZ]: https://www.nowcoder.com/exam/oj/ta?page=1&tpId=13&type=13
[Link 1]: https://leetcode.cn/problemset/all/
[Link 2]: https://www.nowcoder.com/practice/05182d328eb848dda7fdd5e029a56da9?tpId=37&tqId=21246&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=/exam/oj/ta?tpId=37&difficulty=undefined&judgeStatus=undefined&tags=&title=