LeetCode 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:

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.

题意：给出模板及字符串，看字符串是否是模板样式。

思路：用map将模板中的单字符与字符串映射起来。如果map中存在，判断对应的value是否与字符串相等，如果不相等，说明与模板样式不匹配。注意，pattern中不同的字符要映射不同的字符串，如"abba"与"dog dog dog dog"是不匹配的。

代码如下：

class Solution
{
    public boolean wordPattern(String pattern, String str)
    {
        String[] tmp = str.split(" ");
        if (pattern.length() != tmp.length) return false;

        Set<String> set1 = new HashSet<String>(Arrays.asList(tmp));

        Map<Character, String> hm = new HashMap<Character, String>();
        for (int i = 0; i < pattern.length(); i++)
        {
            if (!hm.containsKey(pattern.charAt(i)))
            {
                hm.put(pattern.charAt(i), tmp[i]);
            }
            else
            {
                if (hm.get(pattern.charAt(i)).compareTo(tmp[i]) != 0) return false;
            }
        }

        if (hm.size() != set1.size()) return false;

        return true;
    }
}