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.
思路:使用一个map存映射就好了
public class Solution {
public boolean wordPattern(String pattern, String str) {
Map<Character,String> map=new HashMap<Character,String>();
String[] strs=str.split(" ");
if(strs.length!=pattern.length()){
return false;
}
for(int i=0;i<strs.length;i++){
if(map.containsKey(pattern.charAt(i))){
if(!map.get(pattern.charAt(i)).equals(strs[i])){
return false;
}
}else{
if(map.containsValue(strs[i])){
return false;
}else{
map.put(pattern.charAt(i),strs[i]);
}
}
}
return true;
}
}