leetcode 290: Word Pattern

最新推荐文章于 2025-05-07 14:31:24 发布

xudli

最新推荐文章于 2025-05-07 14:31:24 发布

阅读量6.7k

点赞数 1

分类专栏： leetcode

本文链接：https://blog.csdn.net/xudli/article/details/48932055

版权

leetcode 专栏收录该内容

216 篇文章

订阅专栏

本文介绍了一种用于判断字符串是否遵循给定模式的算法。通过使用HashMap来建立字符与单词之间的映射关系，并利用HashSet确保每个字符映射到不同的单词，以此实现模式与字符串的有效匹配。

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

Word Pattern

Total Accepted: 1733 Total Submissions: 6204 Difficulty: Easy

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:

Both pattern and str contains only lowercase alphabetical letters.
Both pattern and str do not have leading or trailing spaces.
Each word in str is separated by a single space.
Each letter in pattern must map to a word with length that is at least 1.

Credits:
Special thanks to @minglotus6 for adding this problem and creating all test cases.

[思路]

char 和 string 一一对应. 建一个map. 同时set里面保存string, 避免重复, 出现多对1的情况.

[CODE]

public class Solution {
    public boolean wordPattern(String pattern, String str) {
        //input check
        
        String[] strs = str.split(" ");
        if(pattern.length() != strs.length  ) return false;
        
        Map<Character, String> map = new HashMap<>();
        Set<String> unique = new HashSet<>();
        
        for(int i=0; i<pattern.length(); i++) {
            char c = pattern.charAt(i);
            if(map.containsKey(c) ) {
                if(!map.get(c).equals(strs[i])) return false;
            } else {
                if(unique.contains(strs[i])) return false;
                map.put(c, strs[i]);
                unique.add(strs[i]);
            }
        }
        return true;
    }
}