LeetCode-290. 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
2
3
4
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.
代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
public boolean wordPattern(String pattern, String str) {
String[] strs = str.split(" ");
if(pattern.length() != strs.length) return false;
Map<Character, String> map = new HashMap<Character, String>();
for(int i=0;i<pattern.length();i++) {
if(!map.containsKey(pattern.charAt(i))) {
if(map.containsValue(strs[i])) return false;
map.put(pattern.charAt(i), strs[i]);
}else {
if(strs[i].equals(map.get(pattern.charAt(i)))) continue;
else return false;
}
}
return true;
}

-------------本文结束感谢您的阅读-------------
Thank you for your encouragement