给定一个赎金信 (ransom) 字符串和一个杂志(magazine)字符串，判断第一个字符串 ransom 能不能由第二个字符串 magazines 里面的字符构成。如果可以构成，返回 true ；

class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
      
        int[] letter1 = new int[123];
        int[] letter2 = new int[123];

        for (int i = 0; i < ransomNote.length(); i++){
            letter1[ransomNote.charAt(i)]++;
        }

        for (int i = 0; i < magazine.length(); i++){
            letter2[magazine.charAt(i)]++;
        }

        for (int i = 0; i < ransomNote.length(); i++){
            if (letter1[ransomNote.charAt(i)] > letter2[ransomNote.charAt(i)]){
                return false;
            }
        }
        return true;

    }
}

标签：ransom,ransomNote,charAt,++,length,int,magazine,字符串
来源： https://blog.csdn.net/zylscxy/article/details/114021253