leedcode Ransom Note

最新推荐文章于 2024-10-08 10:36:00 发布

小灰灰52309

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量199

点赞数

分类专栏： leetcode ACM 文章标签： leetcode ransomNote string

本文链接：https://blog.csdn.net/xiaohuihui52309/article/details/52261226

版权

leetcode 同时被 2 个专栏收录

185 篇文章 0 订阅

订阅专栏

ACM

127 篇文章 0 订阅

订阅专栏

Ransom Note

 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

题意：由magazines string 构造ransom note string

对magazines string 索引放在一个数组中，ransom note string 在数组中逐字符查找，查找不到返回false,否则返回true

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        int maglength=magazine.length();
        int ransomlength=ransomNote.length();
        int magindex[60];
        memset(magindex,0,sizeof(magindex));
        for(int i=0; i<maglength; i++)
        {
            magindex[magazine[i]-'a']++;
        }
        
        for(int i=0; i<ransomlength; i++)
        {
            magindex[ransomNote[i]-'a']--;
            if(magindex[ransomNote[i]-'a']<0)
            {
                return false;
            }
        }
        return true;
    }
};