383. Ransom Note - Easy

前往題目

想法

• 簡單的 hash table 或是用 array 更快更省空間

Code

class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        int[] count = new int[26];

        Arrays.fill(count, 0);

        // Store counting of each character in magazine
        for (char c : magazine.toCharArray()) {
            count[c - 'a'] += 1;
        }

        // Check ransomNote
        for (char c : ransomNote.toCharArray()) {
            count[c - 'a'] -= 1;
            if (count[c - 'a'] < 0) {
                return false;
            } 
        }
        return true;
    }
}