leetcode: Ransom Note

最新推荐文章于 2024-11-01 15:19:21 发布

SCAU啊源

最新推荐文章于 2024-11-01 15:19:21 发布

阅读量402

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/chanrenyuan/article/details/52345655

版权

leetcode 专栏收录该内容

168 篇文章 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) {
        int[] m = new int[26];
        int[] r = new int[26];
        for(char c : ransomNote.toCharArray()){
            r[c - 'a'] ++;
        }
        for(char c : magazine.toCharArray()){
            m[c - 'a'] ++;
        }
        boolean flag = true;
        for(int i = 0; i < 26; ++i){
            if(m[i] < r[i])return false;
        }
        return true;
    }
}