赎金信：给你两个字符串：ransomNote 和 magazine ，判断 ransomNote 能不能由 magazine 里面的字符构成

class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        char ran[] = ransomNote.toCharArray();
        char mag[] = magazine.toCharArray();
        int i ,j = 0;
        char word[] = new char[] {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
        int num1[] = new int[26];
        int num2[] = new int[26];
        for(i = 0;i < 26;i++){
            num1[i]=num2[i]=0;
        }
        if(ran.length > mag.length){
            return false;
        }
        for(i = 0; i < ran.length;i++){
            for(j = 0;j < word.length;j++){
                if(ran[i] == word[j]){
                    num1[j]++;
                }
            }
        }
        for(i = 0; i < mag.length;i++){
            for(j = 0;j < word.length;j++){
                if(mag[i] == word[j]){
                    num2[j]++;
                }
            }
        }
        for(i = 0;i < 26;i++){
            if(num1[i] > num2[i]){
                return false;
            }
        }
        return true; 
    }
}

暴力解题，不会用函数库，只会用容易理解的思路