【leetcode】383. Ransom Note

最新推荐文章于 2023-02-16 23:31:49 发布

原创最新推荐文章于 2023-02-16 23:31:49 发布 · 334 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode

leetcode 专栏收录该内容

14 篇文章

订阅专栏

本文详细介绍了LeetCode上的经典问题383：赎金信问题的解决方案。通过使用一个大小为26的字符数组来记录出现的字母频率，实现了判断杂志字符串是否能完全覆盖赎金信中所有字母的需求。该方法简洁高效，易于理解和实现。

383. Ransom Note

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

思路

String类型的题常用思路：构造一个char[26]数组(题目里说了只有小写字母)，然后把ransomNote里每个character都存进来。

代码

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;
    }
}