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-emptyword in str.

Examples:

1. pattern = "abba", str = "dog cat cat dog" should return true.
2. pattern = "abba", str = "dog cat cat fish" should return false.
3. pattern = "aaaa", str = "dog cat cat dog" should return false.
4. 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.

程序如下所示：

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