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 static boolean canConstruct(String ransomNote, String magazine)
{
int[] carr=new int[128];
for(int i=0;i<magazine.length();i++)
carr[magazine.charAt(i)]++;

for(int i=0;i<ransomNote.length();i++)
{
char c=ransomNote.charAt(i);
if(carr[c]<=0)
return false;
carr[c]--;
}
return true;
}
}