383. Ransom Note

最新推荐文章于 2024-03-18 09:48:15 发布

jianingkid

最新推荐文章于 2024-03-18 09:48:15 发布

阅读量233

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/jianingkid/article/details/52197937

版权

leetcode 专栏收录该内容

96 篇文章 0 订阅

订阅专栏

 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) {
        Map<Character,Integer> find=new HashMap<>();
        for(char a:magazine.toCharArray())
        {
            int sum=find.getOrDefault(a,0)+1;
            find.put(a,sum);
        }
        
        for(char b:ransomNote.toCharArray())
        {
            int sum=find.getOrDefault(b,0)-1;
            find.put(b,sum);
            if(sum<0)return false;
        }
        return true;
    }
}