Leetcode 290 Word Pattern

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

转载最新推荐文章于 2024-11-26 07:02:26 发布 · 48 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/lilixu/p/5603562.html

本文介绍了一种基于模式和字符串的匹配算法，通过全匹配的方式验证字符串是否遵循给定的模式。该算法首先检查模式和字符串长度的一致性，然后通过构建映射关系来确保模式中的每个字符与字符串中的非空单词一一对应。

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.

首先检验长度是否一致

然后判断每个map关系是否唯一对应

class Solution(object):
    def wordPattern(self, pattern, str):
        str = str.split(' ')
        if len(pattern) != len(str):
            return False
        h = {}
        for i in range(len(str)):
            if not h.has_key(pattern[i]):
                if str[i] not in h.values():
                    h[pattern[i]] = str[i]
                else:
                    return False
            else:
                if h[pattern[i]] != str[i]:
                    return False
        return True