383. Ransom Note
2018-01-03 17:09
288 查看
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.
官方解答(桶式排序的思想):
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) { int[] arr = new int[26]; for (int i = 0; i < magazine.length(); i++) { arr[magazine.charAt(i) - 'a']++; } for (int i = 0; i < ransomNote.length(); i++) { if(--arr[ransomNote.charAt(i)-'a'] < 0) { return false; } } return true; } }
相关文章推荐
- 383. Ransom Note
- 383. Ransom Note
- leetcode 383. Ransom Note 解题报告
- LeetCode 383. Ransom Note
- LeetCode 383. Ransom Note
- Leetcode- 383. Ransom Note(string)
- 383. Ransom Note
- LeetCode—383. Ransom Note
- 383. Ransom Note
- LeetCode之路:383. Ransom Note
- 383. Ransom Note
- leetcode 383. Ransom Note
- Leetcode 383. Ransom Note
- 383. Ransom Note
- LeetCode 383. Ransom Note
- LeetCode-383. Ransom Note
- LeetCode OJ-383. Ransom Note
- leetcode 383. Ransom Note
- LeetCode383. Ransom Note
- leetcode 383. Ransom Note