原题
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.
题意
模式匹配,给出一个字符pattern和字符串str,字符str有一个空格把各个单词空开;如果pattern中相同的字母对应的是相同的字符串,并且不同的字符对应的不同的字符串,则说明Pattern和字符串str是相同的模式
思路
建立一个map集合,如果map中包含对应关系,则比较对应的值和字符串中的是否相同;
如果不包含对应关系,则首先判断str中的第i个元素是否在set集合中,如果包含了,则说明不是匹配的;否则就是,把这种对应关系加入map中
代码
public class Solution {
public boolean wordPattern(String pattern, String str) {
String[] str1=str.split(" ");
if(str1.length!=pattern.length())return false;
Map<Character, String>map=new HashMap<Character, String>();
Set<String>unique=new HashSet<>();
for (int i = 0; i < pattern.length(); i++) {
char c=pattern.charAt(i);
if(map.containsKey(c)){
if(!map.get(c).equals(str1[i])) return false;
}
else{
if(unique.contains(str1[i])) return false;
map.put(c, str1[i]);
unique.add(str1[i]);
}
}
return true;
}
}
原题链接
但是看了discussion,感觉别人想的这个还是更节省一点
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;
}