Leetcode 383 Ransom Note

lc383 Ransom Note

两个for

第一个记录sourse字符串每种字母出现次数

第二个看现有字母是否能够填满target

class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        if(ransomNote.length() == 0)
            return true;

        int countM[] = new int[26];
        //Arrays.fill(countM, 1);
        
        for(int i=0; i<magazine.length(); i++)
            countM[magazine.charAt(i)-'a']++;
        for(int i=0; i<ransomNote.length(); i++){
            countM[ransomNote.charAt(i)-'a']--;
            if(countM[ransomNote.charAt(i)-'a'] == -1)
                return false;
        }
        
        return true;
        
    }
}