PAT甲级1092 To Buy or Not to Buy (20分) C++ / Java

最新推荐文章于 2022-08-11 22:27:19 发布

ganlanA

最新推荐文章于 2022-08-11 22:27:19 发布

阅读量176

点赞数 1

文章标签： C++ PAT Java

本文链接：https://blog.csdn.net/qq_45865697/article/details/110326637

版权

该博客探讨了一个字符串子集匹配问题，即判断第二个字符串是否为第一个字符串的子集，并计算差异数量。提供了C++和Java两种语言的解决方案，利用哈希映射来快速检查和计算。博客中还提到了Java代码在PAT系统中可能存在的超时问题，可能与输入流有关。

摘要由CSDN通过智能技术生成

Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of beads. However the owner of the shop would only sell the strings in whole pieces. Hence Eva must check whether a string in the shop contains all the beads she needs. She now comes to you for help: if the answer is Yes, please tell her the number of extra beads she has to buy; or if the answer is No, please tell her the number of beads missing from the string.

For the sake of simplicity, let’s use the characters in the ranges [0-9], [a-z], and [A-Z] to represent the colors. For example, the 3rd string in Figure 1 is the one that Eva would like to make. Then the 1st string is okay since it contains all the necessary beads with 8 extra ones; yet the 2nd one is not since there is no black bead and one less red bead.

Figure 1

Input Specification:
Each input file contains one test case. Each case gives in two lines the strings of no more than 1000 beads which belong to the shop owner and Eva, respectively.

Output Specification:
For each test case, print your answer in one line. If the answer is Yes, then also output the number of extra beads Eva has to buy; or if the answer is No, then also output the number of beads missing from the string. There must be exactly 1 space between the answer and the number.

Sample Input 1:

ppRYYGrrYBR2258
YrR8RrY

Sample Output 1:

Yes 8

Sample Input 2:

ppRYYGrrYB225
YrR8RrY

Sample Output 2:

No 2

题目大意

比较第2串字符串是不是第1串字符串的子集。

如果是输出 Yes 和 2者之间的长度差
如果不是输出 No 和第2串里多出的元素数目

C++

//Alg: Hash
#include<bits/stdc++.h>
using namespace std;
int main(){
	string a, b;
	cin >> a >> b;
	map<char, int> mp;
	for(char c : a) mp[c]++;
	for(char c : b) mp[c]--;
	int cnt = 0;
	for(auto x : mp)
		if(x.second < 0)//表示第2串里多了珠子 
			cnt += abs(x.second); 
	if(cnt > 0) cout<<"No"<<" "<<cnt;
	else  cout<<"Yes"<<" "<<abs( a.size() - b.size() );
	}

Java

//Hash
import java.util.*;
public class Main {
    public static void main(String[] args) {
    	//BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        Scanner cin = new Scanner(System.in);
        String a = cin.next(); 
        String b = cin.next();
        int[] mp = new int[128]; 
        for(char c : a.toCharArray()) mp[c]++;
        for(char c : b.toCharArray()) mp[c]--;
        int cnt = 0;
        for(int x : mp) 
        	if(x < 0)
        		cnt += -x;
        if(cnt > 0) System.out.println("No "+cnt);
        else System.out.println("Yes " + (a.length() - b.length()) ); 
    }
}

Java② 利用BufferedReader 玄学提速版

import java.util.*;
import java.io.*;
public class Main {
    public static void main(String[] args) throws IOException{
    	BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));//用BufferedReader替换Scanner流进行输入 
        //Scanner cin = new Scanner(System.in);
        String a = bf.readLine(); 
        String b = bf.readLine();
        int[] mp = new int[128]; 
        for(char c : a.toCharArray()) mp[c]++;
        for(char c : b.toCharArray()) mp[c]--;
        int cnt = 0;
        for(int x : mp) 
        	if(x < 0)
        		cnt += -x;
        if(cnt > 0) System.out.println("No "+cnt);
        else System.out.println("Yes " + (a.length() - b.length()) ); 
    }
}