[leetcode 290]Word Pattern

最新推荐文章于 2024-11-26 07:02:26 发布

yongfengsite

最新推荐文章于 2024-11-26 07:02:26 发布

阅读量719

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode 文章标签： leetcode C++ 290 Word Pattern

本文链接：https://blog.youkuaiyun.com/ER_Plough/article/details/48948657

Leetcode 专栏收录该内容

42 篇文章

订阅专栏

本文探讨了如何通过给定的模式和字符串判断字符串是否遵循相同的模式。详细解释了实例、注意事项，并提供了相应的代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a pattern and a string str, find if str follows the same pattern.

Examples:

pattern = "abba", str = "dog cat cat dog" should return true.
pattern = "abba", str = "dog cat cat fish" should return false.
pattern = "aaaa", str = "dog cat cat dog" should return false.
pattern = "abba", str = "dog dog dog dog" should return false.

Notes:

patterncontains only lowercase alphabetical letters, and str contains words separated by a single space. Each word in str contains only lowercase alphabetical letters.
Both pattern and str do not have leading or trailing spaces.
Each letter in pattern must map to a word with length that is at least 1.

Credits:

Special thanks to @minglotus6 for adding this problem and creating all test cases.

字符与字符串的匹配

AC代码：

class Solution {
public:
    bool wordPattern(string pattern, string str) {
        vector<string> temp=stringTovec(str);
        int len=pattern.size();
        int sum=temp.size();
        map<char,string> m;
        map<string,char> m2;
        int j=0;
        for(int i=0;i<len;++i)
        {
            if(m.find(pattern[i])!=m.end())
            {
                if(j<sum&&m[pattern[i]]==temp[j])
                {
                    ++j;
                    continue;
                }
                else
                    return false;
            }
            else if(j<sum)
            {
                m[pattern[i]]=temp[j];
                ++j;
            }
            else
                return false;
        }
        j=0;
        for(int i=0;i<sum;++i)
        {
            if(m2.find(temp[i])!=m2.end())
            {
               if(m2[temp[i]]==pattern[j])
               {
                   ++j;
                   continue;
               }
               else
                return false;
            }
            else if(j<len)
            {
                m2[temp[i]]=pattern[j];
                ++j;
            }
            else
                return false;
        }
        return true;
    }
private:
    vector<string> stringTovec(string s)
    {
        vector<string> res;
        int len=s.size();
        string temp="";
        for(int i=0;i<len;++i)
        {
            if(s[i]==' ')
            {
                res.push_back(temp);
                temp="";
            }
            else
                temp+=s[i];
        }
        res.push_back(temp);
        return res;
    }
};

其他leetcode题目AC代码： https://github.com/PoughER