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

存在性问题首先想到BitSet这种既省内存又可以去重的数据结构

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String shortStr = sc.nextLine();
        String longStr = sc.nextLine();
        System.out.println(check(shortStr, longStr));
    }
    
    public static boolean check(String shortInput, String longInput){
        char[] c = longInput.toCharArray();
        BitSet ls = new BitSet(longInput.length());
        for (char cc : c){
            ls.set(cc);
        }
        for (char ss : shortInput.toCharArray()){
            if (!ls.get(ss)){
                return false;
            }
        }
        return true;
    }
}