To Buy or Not to Buy (20)

#include <iostream>
#include <cstring>
using namespace std;

int main(){
    int hash[128]={0};
    char a[1010],b[1010];
    cin>>a>>b;
    int len1=strlen(a);
    int len2=strlen(b);
    for(int i=0;i<len1;i++)
        hash[a[i]]++;
    int num=0;
    for(int i=0;i<len2;i++){
        if(hash[b[i]]>0){
            hash[b[i]]--;
            num++;
        }
    }
    if(num==len2) cout<<"Yes"<<" "<<len1-num<<'\n';
    else cout<<"No"<<" "<<len2-num<<'\n';

    return 0;
}

import java.util.*;

public class Main{
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        String buyStr=sc.next();
        String need=sc.next();
        HashMap<String,Integer> hashMap=new HashMap<String,Integer>();
        for(int i=0;i<buyStr.length();i++){
            if(hashMap.get(buyStr.charAt(i)+"")==null){
                hashMap.put(buyStr.charAt(i)+"",1);
            }else{
                hashMap.put(buyStr.charAt(i)+"",hashMap.get(buyStr.charAt(i)+"")+1);
            }
        }
        int miss=0;
        for(int i=0;i<need.length();i++){
            if(hashMap.get(need.charAt(i)+"")==null || hashMap.get(need.charAt(i)+"")==0){
                miss++;
            }else{
                hashMap.put(need.charAt(i)+"",hashMap.get(need.charAt(i)+"")-1);
            }
        }
        if(miss==0){
            System.out.println("Yes "+(buyStr.length()-need.length()));
        }else{
            System.out.println("No "+miss);
        }
    }
}

其实就是买珠子问题  有自己需要的就买并看看自己需要多买多少个已经有了的  如果没有自己需要的
就不买 并算出一共差多少个珠子

利用Map 先把所有的珠子都放里面 统计每种不同珠子的个数
然后遍历 需要的珠子
--count
做出判断即可。。。

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
    /**
     * @param args
     */
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String allBoss = scanner.next();
        char[] allBosss = allBoss.toCharArray();
        String hasColor = scanner.next();
        char[] hasColors = hasColor.toCharArray();
        Map<Character, Integer> map = new HashMap<Character, Integer>();
        for (int i = 0; i < allBosss.length; i++) {
            if (map.containsKey(allBosss[i])) {
                int count = map.get(allBosss[i]);
                map.put(allBosss[i], ++count);
            }else {
                map.put(allBosss[i], 1);
            }
        }
        String str = "";
        for (int i = 0; i < hasColors.length; i++) {
            if (!map.containsKey(hasColors[i])) {
                str += hasColors[i];
            }else {
                int count = map.get(hasColors[i]);
                map.put(hasColors[i], --count);
                if (count<0) {
                    str += hasColors[i];
                }
            }
        }
        if (str.length()>0) {
            System.out.println("No "+str.length());
        }else{
            System.out.println("Yes "+(allBosss.length-hasColors.length));
        }
    }

}

	

#Python3
color=list(input())
aim=list(input())
asci=[0]*128
lack=0
for item in color:
    asci[ord(item)]+=1
for item in aim:
    asci[ord(item)]-=1
    if asci[ord(item)]<0:
        lack+=1
        
if lack<=0:
    print('Yes'+' '+str(len(color)-len(aim)))
else:
    print('No'+' '+str(lack))

//第一次一遍就通过的问题
#include <iostream>
#include <string>
#include <map>
using namespace std;
map<char, int> cnt;
int main()
{
	string shop, eva;cin >> shop >> eva;
	for (int i = 0; i < shop.size(); ++i) cnt[shop[i]]++;
	for (int i = 0; i < eva.size(); ++i) cnt[eva[i]]--;
	bool isOK = true; int miss = 0, extra = 0;
	int i;
	for (i = 0; i < eva.size(); ++i) {
		if (cnt[eva[i]] < 0) {
			isOK = false; miss -= cnt[eva[i]];
		}
		else extra += cnt[eva[i]];
		cnt[eva[i]] = 0;
	}
	if (isOK)for (i = 0; i < shop.size(); ++i)extra += cnt[shop[i]];
	if (isOK)cout << "Yes " << extra;
	else cout << "No " << miss;
	return 0;
}

#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main() {     string buy, sell;     cin >> sell >> buy;     int neednum;     neednum = 0;     for (auto tmp : buy) {         for (int i = 0; i < sell.size();++i) {             if (tmp == sell[i]) {                 sell[i] = '/';                 ++neednum;                 break;             }         }     }     if (neednum == buy.size()) {         cout << "Yes"<<" "<<sell.size() - neednum << endl;         //return 0;     }     else {         cout << "No"<<" "<<buy.size() - neednum << endl;         //return 0;     }     //system("pause");
}

/* https://www.nowcoder.com/pat/5/problem/4038  To Buy or Not to Buy (20)   2018-12-20
 General mean: Give you two string 'have' and 'need', reponse if "have" have all the char
 in "need" ,and how many surpule or own.
 Result: Dont need to say, a simple question. 
 */
 #include"stdafx.h"
 #include<iostream>
 #include<string.h>
 #include<string>
 using namespace std;
 string have, need;
 int temp[1000];
 int main(){
     int own = 0;
     cin >> have >> need;
     for (int i = 0; i < have.length(); i++) temp[(int)have[i]]++;
     for (int i = 0; i < need.length(); i++){
         if (temp[(int)need[i]] <= 0) own++;
         else temp[(int)need[i]]--;
     }
     if(own<=0)cout << "Yes " << have.length() - need.length() << endl;
     else cout << "No " << own << endl;
     return 0;
 }

boo,con,con1 = True,0,0
nlst,mlst = [],[]
n = input()
m = input()
for i in n:
    nlst.append(i)
for j in m:
    mlst.append(j)
ms = list(set(mlst))
for i in ms:
    if i not in n:
        boo = False
        con+=m.count(i)
    else:
        if n.count(i)<m.count(i):
            boo = False
            con+=m.count(i) - n.count(i)
if boo:
    print("Yes "+str(len(nlst)-len(mlst)))
else:
    print("No "+str(con))

//注意如果够则输出剩余珠子
//不够也输出不够的珠子的个数

import java.io.*;
public class Main {

public static void main(String[] args)throws IOException
{
    int flag=0;
    int j;
    int temp;
    BufferedReader reader =new BufferedReader(new InputStreamReader(System.in));
    StringBuffer first_String=new StringBuffer(reader.readLine());
    StringBuffer second_String=new StringBuffer(reader.readLine());
    for(int i=0;i<second_String.length();i++)
    {
        temp=0;
        for( j=0;j<first_String.length();j++)
        {
            if(second_String.charAt(i)==first_String.charAt(j))
            {
                first_String.delete(j,j+1);
                temp=1;
                break;
            }
        }
        if(temp==0)
        {
            flag++;

        }

    }
    if(flag ==0)
    {
        System.out.print("Yes "+first_String.length());
    }
    else

    {
        System.out.print("No "+flag);
    }




}

}

#include "stdafx.h"
#include <cstdio>

int hashTable[128] = {0};
bool more = true;
int main(){     char c;     while((c = getchar()) != '\n'){         hashTable[c]++;     }     while((c = getchar()) != '\n'){         hashTable[c]--;         if(hashTable[c] < 0)more = false;     }     int cnt = 0;     for(int i = 0; i < 128; ++i){         if(more){             cnt += hashTable[i];         }else{             if(hashTable[i] < 0)cnt += -hashTable[i];         }     }     if(more)printf("Yes %d\n", cnt);     else printf("No %d\n", cnt);     return 0;
}

//map即可
#include <bits/stdc++.h>
using namespace std;
map<int,int> mp1,mp2;
int main(){
    string str1,str2;int miss=0;
    cin>>str1>>str2;
    for(const auto &ch:str1) ++mp1[ch];
    for(const auto &ch:str2) ++mp2[ch];
    for(const auto &ch:mp2){
        if(mp1[ch.first]<ch.second) miss+=ch.second-mp1[ch.first];
    }
    if(!miss) cout<<"Yes "<<str1.size()-str2.size()<<endl;
    else cout<<"No "<<miss<<endl;
    return 0;
}

import java.util.Scanner;
public class Main{
	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		int[] c=new int[256];
		char[] a=in.next().toCharArray();
		char[] b=in.next().toCharArray();
		for(int i=0;i<b.length;i++){
			c[b[i]]++;
		}
		for(int i=0;i<a.length;i++){
			c[a[i]]--;
		}
		int count=0;
		boolean flag=true;
		for(int i=0;i<b.length;i++){
			if(c[b[i]]>0){
				count+=c[b[i]];
				flag=false;
				c[b[i]]=0;
			}
		}
		if(flag){
			System.out.println("Yes "+(a.length-b.length));
		}else{
			System.out.println("No "+count);
		}
	}
}

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=1005;
int cnt[256];
char str1[maxn],str2[maxn];
int main(){
    //freopen("in.txt","r",stdin);
    scanf("%s%s",str1,str2);
    int len1=strlen(str1),ans=0;
    for(int i=0;i<len1;i++){
        cnt[str1[i]]++;
    }
    bool ok=true;
    int len2=strlen(str2);
    for(int i=0;i<len2;i++){
        if(cnt[str2[i]]==0){
            ok=false;
            ans++;
        }
        else{
            cnt[str2[i]]--;
        }
    }
    if(ok){
        printf("Yes %d\n",len1-len2);
    }
    else{
        printf("No %d\n",ans);
    }
    return 0;
}