LeetCode-290.Word Pattern

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

首先使用Hashtable判断单向映射，然后再用HashSet判断Hashtable中的value值是否出现重复

public bool WordPattern(string pattern, string str)
    {
        string[] strs = str.Split(' ');
        int n = pattern.Length;
        if (n != strs.Length)
            return false;
        Hashtable table = new Hashtable();
        for (int i = 0; i < n; i++)
        {
            if (table.Contains(pattern[i]))
            {
                if ((string)table[pattern[i]] != strs[i])
                    return false;
            }
            else
                table.Add(pattern[i], strs[i]);
        }
        HashSet<string> set = new HashSet<string>();
        foreach (DictionaryEntry item in table)
            if (!set.Add((string)item.Value))
                return false;
        return true;
    }

改进：

使用table中自带的判断

public bool WordPattern(string pattern, string str)
    {
        string[] strs = str.Split(' ');
        int n = pattern.Length;
        if (n != strs.Length)
            return false;
        Hashtable table = new Hashtable();
        for (int i = 0; i < n; i++)
        {
            if (table.Contains(pattern[i]))
            {
                if ((string)table[pattern[i]] != strs[i])
                    return false;
            }
            else
            {
                if (table.ContainsValue(strs[i]))
                    return false;
                table.Add(pattern[i], strs[i]);
            }
        }
        return true;
    }

C++实现 参考  https://leetcode.com/discuss/62476/short-c-read-words-on-the-fly

#include <map>
#include <sstream>  
using namespace std;
bool wordPattern(string pattern, string str)
{
	map<char, int> p2i;
	map<string, int> w2i;
	istringstream in(str);
	int i = 0, n = pattern.size();
	for (string word; in >> word; ++i)
	{
		if (i == n || p2i[pattern[i]] != w2i[word])
			return false;
		p2i[pattern[i]] = w2i[word] = i + 1;
	}
	return i == n;
}