【leetcode】383. Ransom Note

最新推荐文章于 2025-01-26 00:30:00 发布

原创最新推荐文章于 2025-01-26 00:30:00 发布 · 160 阅读

0 ·

CC 4.0 BY-SA版权

解题报告同时被 2 个专栏收录

203 篇文章

订阅专栏

leetcode题解大全

115 篇文章

订阅专栏

本文介绍了一种解决勒索信问题的字符串匹配算法。该算法通过遍历杂志字符串，统计每个字符出现次数，再检查这些字符是否足够用于构建勒索信。此方法确保了在O(n)的时间复杂度内解决问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

题解如下：

class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        int[] charsets = new int[26];
        for(int i = 0;i < magazine.length();i++) {
            charsets[magazine.charAt(i) - 'a']++;
        }
        for(int i = 0;i < ransomNote.length();i++) {
            if(--charsets[ransomNote.charAt(i) - 'a'] < 0) {
                return false;
            }
        }
        return true;
    }
}