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.
做法一:
public static boolean wordPattern(String pattern, String str) {
boolean result = true;
String s[] = str.split(" ");
if(s.length != pattern.length()){
return false;
}
for(int i = 0; i < pattern.length(); i++){
for(int j = 0; j < i; j++){
if((pattern.charAt(j)==pattern.charAt(i) && !s[j].equals(s[i])) || (pattern.charAt(j)!=pattern.charAt(i) && s[j].equals(s[i]))){
return false;
}
}
}
return result;
}
太慢了
做法二: