[LeetCode]290. Word Pattern

https://leetcode.com/problems/word-pattern/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:
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.

题目重述：根据给定的模式，判断字符串中的字符是否与给定的模式匹配

解题思路： 将pattern和str的字符串的对应关系存入map中进行判断。

public boolean wordPattern(String pattern, String str) {
        Map<Character,String> map = new HashMap<Character,String>();
        char[] charArray = pattern.toCharArray();
        int flag=0;
        //将字符串以空格划分
        String[] splits = str.split("\\s");
        int splitsLength=splits.length;
        //获取模式的长度
        int charLength=charArray.length;
        //判断长度是否相等
        if(splitsLength!=charLength)return false;
        String temp;
        for(int i=0;i<charLength;i++){
            //将str中的单词和patternStr中对应的字符以键值对的形式保存
            //如果map中的key值（str对应的单词）存在，则判断value是否与对应的patternStr中的字符是否相等
            if(map.containsKey(charArray[i])){
                //如果不相等，则匹配失败，跳出，返回false
                if(!map.get(charArray[i]).equals(splits[i])){
                    flag=1;
                    break;
                }
            //如果在map的value中存在patternStr中的字符，则必定匹配失败
            }else if(map.containsValue(splits[i])){
                flag=1;
                break;
            }else{
                //将str中的单词和模式中的字符以键值对的形式存储
                map.put(charArray[i], splits[i]);
            }
        }
        if(flag==1){
            return false;
        }else{
            return true;
        }
    }