LeetCode String 290 Word Pattern

290. Word Pattern

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

Notes:
You may assume pattern contains only lowercase letters, and str contains lowercase letters that may be separated by a single space.

solution 1：HashMap

    public boolean wordPattern(String pattern, String str) {
        // split the phrase into words
        String[] a = str.trim().split(" +");
        if (pattern.length() != a.length) return false;
        HashMap<String, Integer> map = new HashMap<>();
        // the purpose for adding " " is to first change the type to string,
        // and second distinguish pattern and word. 
        // Ex. pattern = "abc", str = "b a c"
        // if only "" is added, word and pattern will interfere each other.
        for (Integer i = 0; i < pattern.length(); i++) {
            if (map.put(a[i],i) != map.put(pattern.charAt(i)+" ",i))
                return false;
        }
        return true;
    }

还有另一种写法

    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;
    }

第二种写法声明了实际类为HashMap的Map类instance，同时并未规定key和value的数据类型，这样可以储存不同类型的数据。同时避免了大量char转换String以及String “+” 运算，会大大加快速度