【LeetCode】290. Word Pattern (Python实现)

最新推荐文章于 2024-11-28 09:45:26 发布

不愿透露姓名的菜鸟

最新推荐文章于 2024-11-28 09:45:26 发布

阅读量453

点赞数

CC 4.0 BY-SA版权

分类专栏： python学习知识重点抽取

本文链接：https://blog.csdn.net/Homewm/article/details/100730141

python学习同时被 2 个专栏收录

100 篇文章

订阅专栏

知识重点抽取

5 篇文章

订阅专栏

该博客介绍了LeetCode上的第290题——Word Pattern的解题思路，包括三种方法：使用字典进行双向映射检查、记录字符和单词的首次出现位置、建立字符和单词的映射体系。并提供了具体的Python实现。

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

参考链接：https://blog.csdn.net/coder_orz/article/details/51693647

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.

Example 1:

Input: pattern = "abba", str = "dog cat cat dog"
Output: true

Example 2:

Input:pattern = "abba", str = "dog cat cat fish"
Output: false

Example 3:

Input: pattern = "aaaa", str = "dog cat cat dog"
Output: false

Example 4:

Input: pattern = "abba", str = "dog dog dog dog"
Output: false

方法一：就是建立两个字典，进行双向映射检查。

class Solution(object):
    def wordPattern(self, pattern, str):
        """
        :type pattern: str
        :type str: str
        :rtype: bool
        """
        
        str_list = str.strip().split()
        if len(str_list) != len(pattern):
            return "false"

        dictmap = {}
        mapval = {}
        for i in range(len(pattern.strip())):
            if pattern[i] in dictmap.keys():
                if str_list[i] != dictmap[pattern[i]]:
                    return "false"
            else:
                #这个地方是为了双向映射的原因
                if str_list[i] in mapval:
                    return "false"
                dictmap[pattern[i]] = str_list[i]
                mapval[str_list[i]] = pattern[i]
        return "true"

方法二：记录每个字符和单词出现的第一个位置，使得每个字符和单词两边出现的第一次位置都相同时，就能保证双射。

class Solution(object):
    def wordPattern(self, pattern, str):
        """
        :type pattern: str
        :type str: str
        :rtype: bool
        """
        

        words = str.split(' ')
        if len(words) != len(pattern):
            return False
        if map(pattern.find, pattern) == map(words.index, words):
            return "true"
        else:
            return "false"

方法三：（'a'，‘dog’）类似这种建立映射体系，这个长度和pattern及str中去重后的长度是相等的。

class Solution(object):
    def wordPattern(self, pattern, str):
        """
        :type pattern: str
        :type str: str
        :rtype: bool
        """
        
        words = str.split(' ')
        if len(words) != len(pattern):
            return False
        return len(set(pattern)) == len(set(words)) == len(set(zip(pattern, words)))