Leetcode NO.290 Word Pattern

最新推荐文章于 2025-08-11 15:06:51 发布

lym1108csu

最新推荐文章于 2025-08-11 15:06:51 发布

阅读量430

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode 文章标签： C++ leetcode 算法 hashmap

本文链接：https://blog.csdn.net/u012290414/article/details/48966135

Leetcode 专栏收录该内容

140 篇文章

订阅专栏

本题题目要求如下：

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.

本题应该算是easy中的easy了，思路相当直接，就是用hashmap，当然需要注意一点就是不光要避免'a'->"dog"和'a'->"cat"这种冲突，还要解决'a'->"dog"和'b'->dog这种冲突。。我的解决方法是加一个hashset，也许有更好地，但是这么做也行。。

代码如下：

class Solution {
public:
    bool wordPattern(string pattern, string str) {
        istringstream is(str);
        unordered_map<char, string> hashmap;
        unordered_set<string> hashset;
        string word;
        int sz = pattern.length();
        int i = 0;
        while (is >> word) {
            hashset.insert(word);
            if (i == sz) {
                return false;
            }
            char tmp_val = pattern[i++];
            auto found = hashmap.find(tmp_val);
            if (found == hashmap.end()) {
                hashmap[tmp_val] = word;
            }
            else {
                if (hashmap[tmp_val] != word) {
                    return false;
                }
            }
        }
        return (hashset.size() == hashmap.size() and i == sz);
    }
};