383. Ransom Note

题目描述：

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

思路：

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

利用HashMap

class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        HashMap<Character, Integer> map = new HashMap<>();
        for (char c : magazine.toCharArray())
        {
            if (map.containsKey(c))
                map.put(c, map.get(c) + 1);
            else
                map.put(c, 1);
        }
        for (char c : ransomNote.toCharArray())
        {
            if (map.containsKey(c))
                map.put(c, map.get(c) - 1);
            else 
                map.put(c, -1);
            if (map.get(c) < 0)
                return false;
        }
        return true;
    }
}