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

#### C#版 24种设计模式

2012年06月28日 1.36MB 下载

#### Java.Design.Patterns.1537192353

2016年09月05日 3.45MB 下载

#### Pattern Classification

2018年03月30日 5.28MB 下载

#### 正则表达式之 pattern+?、pattern*?、(?!pattern)、(?:pattern)

2017-07-13 17:44:11

#### (?:pattern) (?=pattern) (?!pattern)

2016-08-30 22:12:52

#### 源代码.NET学架构之表示层 常用设计模式

2012年09月06日 843KB 下载

#### 正则表达式中pattern的用法

2006-12-14 18:54:00

#### Pattern用法(正则表达式)

2016-08-11 21:21:57

#### java pattern类使用说明（正则表达式）

2013-11-05 09:38:26

#### “*** target pattern contains no '%'. stop.”

2013-03-24 10:59:35