算法很美：两串的字符集相同

题目描述

• 写一段代码，判断s1中的字符是否在s2中全部出现

代码

public static void main(String[] args) {
        String s1="asbafjkvasddaklwfw";
        String s2="awdv";
        boolean b1 = hasSameCharacters(s1, s2);
        boolean b2 = hasSameCharacters2(s1, s2);
        System.out.println(b1);
        System.out.println(b2);
    }

    private static boolean hasSameCharacters2(String s1, String s2) {
        HashMap<Character,Integer> helper=new HashMap<>();
        for (int i = 0; i < s1.length(); i++) {
            helper.put(s1.charAt(i),1);
        }
        for (int i = 0; i < s2.length(); i++) {
            if(helper.get(s2.charAt(i))==0){
                return false;
            }
        }
        return true;
    }

    //限定ascii码
    private static boolean hasSameCharacters(String s1, String s2) {
        int[] helper=new int[256];
        for (int i = 0; i < s1.length(); i++) {
            helper[s1.charAt(i)]++;
        }
        for (int i = 0; i < s2.length(); i++) {
            if(helper[s2.charAt(i)]==0){
                return false;
            }
        }
        return true;