到底买不买（20）

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNextLine()){
            String s = in.nextLine();
            String b = in.nextLine();
            StringBuffer sb = new StringBuffer(s);
            String c = "";
            for (int i = 0; i < b.length(); i++) {
                for (int j = 0; j < sb.length() ; j++) {
                    if (b.charAt(i) == sb.charAt(j)) {
                        sb.deleteCharAt(j);
                        c += b.charAt(i);
                        break;
                    }
                }
            }
            if(c.length() == b.length()){
                System.out.println("yes"+" "+ sb.length());
            }else {
                System.out.println("No"+" "+(b.length()-c.length()));
            }
        }
    }
}

import java.io.*;

public class Main {
    public static void main(String[] args) throws Exception{
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        String seller = bf.readLine();
        String red = bf.readLine();
        judge(seller,red);
    }

    public static void judge(String seller,String red){
        int count;
        int bad = 0;
        boolean flag = true;
        for(int i=0;i<red.length();i++){
            count = seller.indexOf(red.charAt(i)+"");
            if(count == -1){
                flag = false;
                bad++;
            }
            else{
                seller = seller.substring(0,count)+seller.substring(count+1);;
            }
        }
        if(flag){
            System.out.println("Yes "+seller.length());
        }
        else{
            System.out.println("No "+bad);
        }
    }
}

import java.util.*;
public class text{
    public static void main( String[] args){
        Scanner sca = new Scanner(System.in);
        while(sca.hasNext()){
            String Waiter = sca.next();
            String Hong = sca.next();
            int num = 1;
            int len = Waiter.length();
            if(Waiter == null){
                System.out.println("No"+" "+ Hong.length());
            }
            for(int j = 0;j<Hong.length();j++){
                int i = Waiter.indexOf(Hong.substring(j,j+1));
                if(i != -1){
                   Waiter = Waiter.replaceFirst(Waiter.substring(i,i+1),"");
                    num += 1;
                }
            }
            if(Waiter.length()+Hong.length() == len){
                System.out.println("Yes"+" "+num);
            }else{
                System.out.println("No"+" "+
                        String.valueOf(Hong.length()-(len-Waiter.length())));
            }
        }
    }
}

import java.util.HashMap;
import java.util.Scanner;

public class PAT29 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        HashMap<Character, Integer> map = new HashMap<>();
        String sample = scanner.next();
        String target = scanner.next();
        int length = sample.length();
        for (int i = 0; i < length; i++) {
            map.merge(sample.charAt(i), 1, Integer::sum);
        }
        int targetLen = target.length();
        int leak = 0;//缺少
        char ch;
        for (int i = 0; i < targetLen; i++) {
            ch = target.charAt(i);
            Integer value = map.get(ch);
            if (value == null || value == 0) {
                leak++;
            }else {
                map.put(ch, value-1);
            }
        }
        if (leak == 0) {
            System.out.println("Yes " + (length - targetLen));
        } else {
            System.out.println("No " + leak);
        }
        scanner.close();
    }
}

import java.util.*;
public class Main {
    public static void main(String[] args) {
        //java集合框架
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()) {
            String have = sc.nextLine();//商家手中的珠串
            String need = sc.nextLine();//用户想要的珠串
            
            //商人
            Map<Character, Integer> h = new HashMap<>();
            for(char c : have.toCharArray()) {
                if(h.containsKey(c)) {
                    h.put(c, h.get(c)+1);
                }else {
                    h.put(c, 1);
                }
            }
            
            //用户
            Map<Character, Integer> n = new HashMap<>();
            for(char c : need.toCharArray()) {
                if(n.containsKey(c)) {
                    n.put(c, n.get(c)+1);
                }else {
                    n.put(c, 1);
                }
            }
            
            //计算差值，以用户为参考
            boolean weatherBy = true;
            int lack = 0;
            for(Map.Entry<Character, Integer> en : n.entrySet()) {
                char k = en.getKey();
                int v = en.getValue();
                if(h.containsKey(k) && h.get(k) < v) {//商人的珠子包含用户的珠子但是数量不够
                    weatherBy = false;
                    lack += v-h.get(k);
                }else if(!h.containsKey(k)) {//商人的珠子不包含用户的珠子
                    weatherBy = false;
                    lack += v;
                }
            }
            
            if(weatherBy) {
                System.out.println("Yes " + (have.length()-need.length()));
            }else {
                System.out.println("No " + lack);
            }
        }
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String str = sc.next();
        String want = sc.next();

        sc.close();

        int miss = 0;
        for (int i = 0; i < want.length(); i++) {
            if (!str.contains(String.valueOf(want.charAt(i)))) {
                miss++;
            }
            str = str.replaceFirst(String.valueOf(want.charAt(i)), "*");
        }
        if (miss != 0) {
            System.out.print("No " + miss);
        } else {
            System.out.print("Yes " + (str.length() - want.length()));
        }
    }
}

	import java.util.Scanner;



	public class Main {
    public static String judge(String sell, String want) {
        String remain = "";
        for (int i = 0; i < want.length(); i++) {
            if (sell.indexOf(want.charAt(i)) != -1) {
                sell = sell.replaceFirst(want.charAt(i) + "", "");
            } else {
                remain += want.charAt(i);
            }
        }
        return remain;
    }



	    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String sell = scanner.next();
        String want = scanner.next();
        String remain = judge(sell, want);
        if (remain.equals("")) {
            System.out.println("Yes " + (sell.length() - want.length()));
        } else {
            System.out.println("No " + remain.length());
        }
    }
}

可以AC！！！
import java.util.ArrayList;
import java.util.Scanner;

public class Main {     @SuppressWarnings("resource")     public static void main(String[] args) {         Scanner in = new Scanner(System.in);         String seller = in.next();         String consumer = in.next();         char[] charArraySeller = seller.toCharArray();         char[] charArrayConsumer = consumer.toCharArray();         ArrayList<Object> arrayList = new ArrayList<>();         for (int i = 0; i < charArraySeller.length; i++) {             arrayList.add(String.valueOf(charArraySeller[i]));         }         int loseSum = 0;// 缺失珠子的个数         for (int i = 0; i < charArrayConsumer.length; i++) {             boolean remove = arrayList.remove(String.valueOf(charArrayConsumer[i]));             if (!remove) {                 loseSum++;             }         }         if (loseSum == 0) {             System.out.println("Yes " + String.valueOf(charArraySeller.length - charArrayConsumer.length));         } else {             System.out.println("No " + loseSum);         }     }
}

	

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;


public class Main{
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		boolean weatherBy = true;
		int lack = 0;
		int redundant = 0;
		Scanner sc = new Scanner(System.in);
		String have = sc.nextLine();
		String need = sc.nextLine();
		Map <Character,Integer> h = new HashMap<>();
		Map <Character,Integer> n = new HashMap<>();
		for (char c:have.toCharArray()) {
			if(h.containsKey(c)){
				h.put(c, h.get(c)+1);
			}else{
				h.put(c, 1);
			}
		}
		for (char c : need.toCharArray()) {
			if(n.containsKey(c)){
				n.put(c, n.get(c)+1);
			}else{
				n.put(c, 1);
			}
		}
		Iterator<Entry<Character, Integer>> it = n.entrySet().iterator();
		while(it.hasNext()){
			Entry<Character, Integer> en = it.next();
			char k = en.getKey();
			int v = en.getValue();
			if(h.containsKey(k) && h.get(k)<v){
				weatherBy = false;
				lack += v -h.get(k);
			}else if(! h.containsKey(k)){
				weatherBy = false;
				lack += v;
			}
		}
		if(weatherBy == true){
			System.out.println("Yes "+(have.length()-need.length()));
		}else{
			System.out.println("No "+lack);
		}
	}

}

/**
 *  god，我居然写出来这么漂亮的代码
 *  你们的代码都太过冗余了
 *  我的思路有两个，一个像我这样的，hash散列表
 *  第二个是逐个字符对比，我看楼上的很多消除法，我觉得那可以优化，减少第二层循环次数。
 */

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        byte[] aBytes = sc.nextLine().getBytes();
        byte[] bBytes = sc.nextLine().getBytes();
        short[] map = new short[128];
        short count = 0;

        for (int i = 0, j = Math.max(aBytes.length, bBytes.length); i < j; i++) {
            if (i < aBytes.length) {
                if (map[aBytes[i]] < 0) count++;
                map[aBytes[i]]++;
            }
            if (i < bBytes.length) {
                if (map[bBytes[i]] <= 0) count--;
                map[bBytes[i]]--;
            }
        }

        System.out.printf("%s %d\n", count < 0 ? "No" : "Yes", count < 0 ? -count : aBytes.length - bBytes.length);
    }
}