Leetcode——383. Ransom Note
2018-03-23 13:40
381 查看
题目原址
https://leetcode.com/problems/ransom-note/description/题目描述
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
解题思路
判断magazine中是否有ransomNote中的元素,magazine中一个元素只能使用一次。因此可以使用数组来存储字符串中的数据,同一个字符存储在同一个地址中,字符值作为数组下标,字符个数作为数组值AC代码
class Solution { public boolean canConstruct(String ransomNote, String magazine) { int[] a = new int[26]; for(int i = 0;i < magazine.length(); i++) { a[magazine.charAt(i)-'a']++; } for(int i = 0; i< ransomNote.length(); i++) { if((--a[ransomNote.charAt(i) - 'a'] ) < 0) return false; } return true; } }
感谢
https://leetcode.com/problems/ransom-note/discuss/85783/Java-O(n)-Solution-Easy-to-understand相关文章推荐
- leetcode 383. Ransom Note 解题报告
- <LeetCode OJ> 383. Ransom Note
- leetcode 383. Ransom Note HashMap 统计字符 + HashMap
- 【Leetcode】383. Ransom Note
- Leetcode383. Ransom Note
- LeetCode - 383. Ransom Note
- Leetcode 383. Ransom Note 构造字符串 解题报告
- LeetCode 383. Ransom Note 自己的解法
- leetcode 383. Ransom Note
- LeetCode 383. Ransom Note
- LeetCode-383. Ransom Note
- leetcode 383. Ransom Note
- LeetCode_383. Ransom Note
- leetcode 383. Ransom Note
- LeetCode-383. Ransom Note
- [LeetCode]383. Ransom Note(赎金票据)
- LeetCode 383. Ransom Note
- 【leetcode】383. Ransom Note 恐吓信
- leetcode-383. Ransom Note
- LeetCode 383. Ransom Note