LeetCode290 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.

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.

这个题目与以前的一道同构字符十分相似
也是使用map和set的方式分别进行映射处理

public class solution {

    public boolean wordPattern(String pattern, String str) {

        String[] strarr = str.split(" ");
        if(pattern.length() != strarr.length) return false;

        //使用字符串分解以及相关的映射进行处理
        Map<Character,String> map = new HashMap<Character,String>();
        Set<String> set = new HashSet<String>();

        for(int i = 0; i < pattern.length(); i++) {
            if(map.containsKey(pattern.charAt(i))) {
                if(!map.get(pattern.charAt(i)).equals(strarr[i])) return false; 
            }
            else {
                if(set.contains(strarr[i])) return false;
                else {
                    map.put(pattern.charAt(i), strarr[i]);
                    set.add(strarr[i]);
                }
            }
        }
        return true;
    }
}