383. Ransom Note

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

gdmmzmj

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

阅读量2k

点赞数

分类专栏： leetcode算法心得

本文链接：https://blog.csdn.net/gdmmzmj/article/details/52579311

版权

leetcode算法心得专栏收录该内容

226 篇文章 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

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {

   int m[26];
    memset(m,0,sizeof(m));
    int cnt = 0;
    for (char c : ransomNote)
    {
        m[c-'a']++;
        cnt++;
    }
    for (char c : magazine)
    {
        if (m[c - 'a'] > 0)
        {
            m[c - 'a']--;
            cnt--;
        }
        if (cnt == 0)
            return true;
    }
    return cnt==0;

    }

};