Ransom Note

最新推荐文章于 2022-11-18 23:04:13 发布

转载最新推荐文章于 2022-11-18 23:04:13 发布 · 466 阅读

算法专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种用于检查是否能从给定的杂志字符串中构造出任意勒索信字符串的算法。通过遍历杂志字符串计数每个字符出现次数，并验证这些字符是否足够构成勒索信，若杂志字符串中字符不足则返回失败。

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

383. Ransom Note

My Submissions

Total Accepted: 5902
Total Submissions: 13061
Difficulty: Easy

 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.

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