给你两个字符串:ransomNote 和 magazine ,判断 ransomNote 能不能由 magazine 里面的字符构成。
如果可以,返回 true ;否则返回 false 。
magazine 中的每个字符只能在 ransomNote 中使用一次。
示例 1:
输入:ransomNote = "a", magazine = "b"
输出:false
示例 2:
输入:ransomNote = "aa", magazine = "ab"
输出:false
示例 3:
输入:ransomNote = "aa", magazine = "aab"
输出:true
提示:
1 <= ransomNote.length, magazine.length <= 105
ransomNote 和 magazine 由小写英文字母组成
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/ransom-note
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题解:
class Solution {
public boolean canConstruct(String ransomNote, String magazine) {
Queue<Character> queue = new LinkedList<>();
List<Character> list = new LinkedList<>();
for (int i = 0; i < ransomNote.length(); i++) {
queue.offer(ransomNote.charAt(i));
}
for (int i = 0; i < magazine.length(); i++) {
list.add(magazine.charAt(i));
}
while (!queue.isEmpty()) {
int flag = 0;
Character top = queue.peek();
for (Character c:list) {
if (c == top) {
list.remove(c);
queue.poll();
flag = 1;
break;
}
}
if (flag == 0) return false;
}
return true;
}
}