LeetCode(24), Ransom Note

Description

Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines ; otherwise, it will return false.

Each letter in the magazine string can only be used once in your ransom note.

Note:
You may assume that both strings contain only lowercase letters.

canConstruct("a", "b") -> false
canConstruct("aa", "ab") -> false
canConstruct("aa", "aab") -> true

Solution

class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        int[] countRansom = new int[26];
        int[] countMagazine = new int[26];
        
        for (int i = 0; i < ransomNote.length(); i++) {
            countRansom[ransomNote.charAt(i) - 'a']++;
        }
        
        for (int j = 0; j < magazine.length(); j++) {
            countMagazine[magazine.charAt(j) - 'a']++;
        }
        
        for (int r = 0; r < 26; r++) {
            if (countRansom[r] > countMagazine[r]) return false;
        }
        return true;
    }
}

def canConstruct(self, ransomNote, magazine):
    return not collections.Counter(ransomNote) - collections.Counter(magazine)