LeetCode:Word Pattern

最新推荐文章于 2020-09-14 08:26:52 发布

walker lee

最新推荐文章于 2020-09-14 08:26:52 发布

阅读量468

点赞数

分类专栏： LeetCode OJ LeetCode解题记录文章标签： LeetCode Word Pattern

本文链接：https://blog.csdn.net/itismelzp/article/details/50503325

版权

LeetCode OJ 同时被 2 个专栏收录

216 篇文章 0 订阅

订阅专栏

LeetCode解题记录

216 篇文章 13 订阅

订阅专栏

Word Pattern

Total Accepted: 21299 Total Submissions: 77656 Difficulty: Easy

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.

Subscribe to see which companies asked this question

Hide Tags

Hash Table

Hide Similar Problems

(E) Isomorphic Strings (H) Word Pattern II

code:

class Solution {
public:
    bool wordPattern(string pattern, string str) {
        map<char, int> cmap;
        map<string, int> smap;
        int n = pattern.size();
        istringstream in(str);

        int i=0;
        for(string word;in>>word;i++)
        {
            if(cmap[pattern[i]] != smap[word]) return false;
            cmap[pattern[i]] = smap[word] = i+1;
        }
        return i==n;
    }
};