290. Word Pattern

问题链接：https://leetcode.com/problems/word-pattern/?tab=Description

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:

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.

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