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 boolean canConstruct(String ransomNote, String magazine) {
char[] count = new char[26];
for (char c : magazine.toCharArray()) count[c - 97]++;
for (char c : ransomNote.toCharArray()) if (count[c - 97]-- < 1) return false;
return true;
}
扫一扫
267
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
