PAT 1039 到底买不买 (20 分) Java实现

最新推荐文章于 2021-12-28 17:43:42 发布

salmon1802

最新推荐文章于 2021-12-28 17:43:42 发布

阅读量166

点赞数

分类专栏： PAT 文章标签： java

本文链接：https://blog.csdn.net/Salmon1122/article/details/120005109

版权

HashMap 字符串比较字符计数差异计算 Java编程

关键词由CSDN通过智能技术生成

PAT 专栏收录该内容

46 篇文章 1 订阅

订阅专栏

在这里插入图片描述

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Iterator;

/**
 * @date 2021-8-30 - 19:14
 * Created by Salmon
 */
public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        String[] s1 = bufferedReader.readLine().split("");
        String[] s2 = bufferedReader.readLine().split("");
        bufferedReader.close();
        int s1Length = s1.length;
        int s2Length = s2.length;
        HashMap<String,Integer> hashMap1 = new HashMap<>();
        HashMap<String,Integer> hashMap2 = new HashMap<>();
        int num = 0;

        for (int i = 0; i < s1Length; i++){
            hashMap1.put(s1[i],hashMap1.containsKey(s1[i]) ? hashMap1.get(s1[i]) + 1 : 1);
        }
        for (int i = 0; i < s2Length; i++){
            hashMap2.put(s2[i],hashMap2.containsKey(s2[i]) ? hashMap2.get(s2[i]) + 1 : 1);
        }

        for (String key : hashMap2.keySet()){
            int temp = hashMap1.get(key) == null ? 0 : hashMap1.get(key);
            if(temp >= hashMap2.get(key)){
                continue;
            }else {
                num = num + (hashMap2.get(key) - temp);
            }
        }

        if(num == 0){
            System.out.println("Yes" + " " + (s1Length - s2Length));
        }else {
            System.out.println("No" + " " + num);
        }

    }
}