Leetcode 383 Ransom Note

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

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

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

167 篇文章

订阅专栏

本文介绍了一种检查是否能从杂志字符串中构建出勒索信字符串的算法。该算法通过对比两个字符串中各字符出现的频率来判断构建的可能性，并确保杂志中的每个字母只能使用一次。

 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

public class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        int[] counter1 = new int[26];
        int[] counter2 = new int[26];
        
        char[] note = ransomNote.toCharArray();
        char[] mag = magazine.toCharArray();
        
        for(int i=0;i<ransomNote.length();i++){
            counter1[note[i]-97]++;
        }
        
        for(int j=0;j<magazine.length();j++){
            counter2[mag[j]-97]++;
        }
        
        for(int m=0;m<26;m++){
            if(counter1[m]>counter2[m]){
                return false;
            }
           
        }
        
        return true;
        
    }
}