383. Ransom Note

勒索信字符串匹配算法

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #string

LeetCode 专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一种检查是否能从杂志字符串中构建出勒索信字符串的算法。该算法通过遍历勒索信字符串，并在杂志字符串中查找每个字符是否存在且未被使用过。若所有字符都能找到，则返回true；反之则返回false。此方法确保了杂志中的每个字母只能在勒索信中使用一次。

 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) {
        bool ret = true;
        int pos = -1;
        for(auto it : ransomNote) {
            pos = magazine.find(it);
            if(pos == string::npos) {
                ret = false;
                break;
            }
            else {
                magazine.erase(magazine.begin() + pos);
            }
        }
        return ret;
    }
};