290. Word Pattern

最新推荐文章于 2024-03-05 15:25:25 发布

teminusign

最新推荐文章于 2024-03-05 15:25:25 发布

阅读量240

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/teminusign/article/details/51941154

LeetCode 专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一种解决LeetCode上290题WordPattern的有效方法。通过将字符串转换为列表并利用Python内置函数进行比对，实现了模式匹配的功能。此算法简洁高效，运行时间短。

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

290. Word Pattern

Leetcode link for this question

Discription:

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.

Analyze:

Code 1:

class Solution(object):
    def wordPattern(self, pattern, str):
        """
        :type pattern: str
        :type str: str
        :rtype: bool
        """
        str_li= str.split()
        return map(pattern.find, pattern) == map(str_li.index,str_li)