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

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
}
HashSet<string> set = new HashSet<string>();
foreach (DictionaryEntry item in table)
return false;
return true;
}

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;
}
}
return true;
}

#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;
}

• 本文已收录于以下专栏：

举报原因： 您举报文章：LeetCode-290.Word Pattern 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)