383. Ransom Note

最新推荐文章于 2025-05-09 23:49:38 发布

原创最新推荐文章于 2025-05-09 23:49:38 发布 · 297 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

220 篇文章

订阅专栏

本文介绍了一种方法，用于判断是否能从给定的杂志字符串中构建出指定的勒索信字符串。通过使用数组记录字母出现次数，确保每个字母只被使用一次。

摘要生成于 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

My solution:

public class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        boolean flag=true;
        int len_r=ransomNote.length();
        int len_m=magazine.length();
        int[] data=new int[26];
        for(int i=0;i<len_r;++i){
            int index=ransomNote.charAt(i)-97;
            data[index]++;
        }
        for(int i=0;i<len_m;++i){
            int index=magazine.charAt(i)-97;
            if(data[index]!=0){
                data[index]--;
            }
            }
        for(int i=0;i<26;++i){
            if(data[i]>0){
                flag=false;
                break;
                }
            }
        return flag;    
        
    }
}