题解 | #字符串字符匹配#

import java.util.*;
//一看是想复杂了以为要精准匹配子串用dp整了半天，结果只要都出现就可以，审题重要
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int max=Integer.MIN_VALUE;
        // 注意 hasNext 和 hasNextLine 的区别
        char[] str1 = in.nextLine().toCharArray();
        char[] str2 = in.nextLine().toCharArray();
        TreeMap<Character,Integer>vals=new TreeMap<Character,Integer>() {
        };
        for (int i = 0; i < str2.length; i++) {
            vals.put(str2[i],1);
        }
        for (int i = 0; i < str1.length; i++) {
            if(vals.get(str1[i])==null){
                System.out.println(false);
                return;
            }
        }
        System.out.println(true);

    }

}