问题
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:
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
由于要求双向一一对应,所以用HashMap
记录pattern->str
的对应,用HashSet
记录str的唯一性
public boolean wordPattern(String pattern, String str) {
String[] strs = str.split(" ");
char[] arr = pattern.toCharArray();
if (strs.length != arr.length) return false;
HashMap<Character, String> map = new HashMap<Character, String>();
HashSet<String> set = new HashSet<String>();
for (int i = 0; i < arr.length; i++) {
if (map.containsKey(arr[i])) {
if (!map.get(arr[i]).equals(strs[i])) return false;
} else {
if (set.contains(strs[i])) return false;
else {
set.add(strs[i]);
map.put(arr[i], strs[i]);
}
}
}
return true;
}
答案2
参考LeetCode大神 StefanPochmann
的答案
HashMap的put方法和HashSet的add方法都是有返回值的。
* put方法:
* add方法:
思路为记录一对pattern和str最后出现的位置,若相同则符合对应关系,若有不同则返回false。
public boolean wordPattern(String pattern, String str) {
String[] words = str.split(" ");
if (words.length != pattern.length())
return false;
Map index = new HashMap();
for (Integer i=0; i<words.length; ++i)
if (index.put(pattern.charAt(i), i) != index.put(words[i], i))
return false;
return true;
}