Word Pattern

最新推荐文章于 2025-06-20 19:01:27 发布

原创最新推荐文章于 2025-06-20 19:01:27 发布 · 386 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LTOJ 专栏收录该内容

91 篇文章

订阅专栏

本文介绍了一种用于判断字符串str是否遵循给定模式pattern的算法。该算法通过建立两个哈希映射来确保pattern中的每个字符与str中的单词一一对应，并且这种对应关系是双向的。文章还提供了具体的实现代码，包括字符串解析、模式匹配等关键步骤。

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

Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.

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:
You may assume pattern contains only lowercase letters, and str contains lowercase letters separated by a single space.

class Solution {
public:
    vector<string> funs(string s)
    {

        vector<string> svec;
        string tmp =  "";
        for(int i = 0; i < s.size(); ++i)
        {
            if(s[i] != ' ')
            {
                tmp += s[i];

            }else
            {
                svec.push_back(tmp);
                tmp = "";
            }
        }
        svec.push_back(tmp);
        return svec;
    }
    vector<string> funp(string p)
    {

        vector<string> svec;
        string tmp =  "";
        for(int i = 0; i < p.size(); ++i)
        {
            tmp += p[i];
            svec.push_back(tmp);
            tmp = "";

        }

        return svec;
    }
    bool wordPattern(string pattern, string str)
    {
        unordered_map<string, string> pm;
        unordered_map<string, string> sm;

        vector<string> pv = funp(pattern);
        vector<string> sv = funs(str);
        if(pv.size() != sv.size())
        {

            return false;
        }
        for(int i = 0; i < pv.size(); ++i)
        {
            pm.insert(make_pair(pv[i], ""));
            sm.insert(make_pair(sv[i], ""));
        }
        for(int i = 0; i < pv.size(); ++i)
        {
            if(pm[pv[i]] == "")
            {

                pm[pv[i]] = sv[i];
            }else
            {
                if(pm[pv[i]] != sv[i])
                {

                    return false;
                }
            }
        }
        for(int i = 0; i < sv.size(); ++i)
        {
            if(sm[sv[i]] == "")
            {
                
                sm[sv[i]] = pv[i];
            }else
            {
                if(sm[sv[i]] != pv[i])
                {
 
                    return false;
                }
            }
        }


        for(int i = 0; i < pv.size(); ++i)
        {

            if(sm.find(pm[pv[i]]) == sm.end() || sm[pm[pv[i]]] != pv[i])
            {

                return false;
            }
        }
        return true;
    }
};