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

public class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        //认真读题！！！没有要求连续！！！
        if(ransomNote.length()==0&&magazine.length()==0)
            return true;
        if(ransomNote.length()==0&&magazine.length()!=0)
            return true;
        if(ransomNote.length()!=0&&magazine.length()==0)
            return false;
        int[] r=new int[26];
        int[] m=new int[26];
        for(int i=0;i<ransomNote.length();i++)
        {
            r[ransomNote.charAt(i)-'a']++;
        }
        for(int j=0;j<magazine.length();j++)
        {
            m[magazine.charAt(j)-'a']++;
        }
        for(int i=0;i<26;i++)
        {
            if(m[i]<r[i])
            {
                return false;
            }
        }
       return true;     
    }    
}