290. Word Pattern*

最新推荐文章于 2017-02-25 21:23:41 发布

Yingying_code

最新推荐文章于 2017-02-25 21:23:41 发布

阅读量219

点赞数

分类专栏： leetcode Java String

本文链接：https://blog.csdn.net/alwaystry/article/details/53998008

版权

leetcode 同时被 3 个专栏收录

261 篇文章 0 订阅

订阅专栏

Java

188 篇文章 0 订阅

订阅专栏

String

21 篇文章 0 订阅

订阅专栏

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.

    public boolean wordPattern(String pattern, String str) {
        String[] words = str.split(" ");
        if(words.length!=pattern.length()) return false;
        Map index = new HashMap();
        for(Integer i=0; i<words.length;i++){
            if(index.put(pattern.charAt(i), i)!=index.put(words[i], i)) return false;
        }
        return true;
    }

总结：put 返回之前的值，如果map中存在某个key，且该key之前的值pattern match，那么说明目前判断的也match