方法一:
思路:
String和char一一对应,建一个map保存String到char的映射,同时用set里面保存char, 避免出现多对1的情况。
public class Solution {。
public boolean wordPattern(String pattern, String str) {
int pLen = pattern.length();
String[] strs = str.split(" ");
int sLen = strs.length;
if (pLen != sLen)
return false;
Map<String, Character> map = new HashMap<String, Character>();
Set<Character> set =new HashSet<Character>();
for (int i = 0; i < sLen; i++) {
if (map.containsKey(strs[i])) {
if (map.get(strs[i]) != pattern.charAt(i))
return false;
}
else if (set.contains(pattern.charAt(i)))
return false;
else {
map.put(strs[i], pattern.charAt(i));
set.add(pattern.charAt(i));
}
}
return true;
}
}
Runtime:2ms
方法二:
思路:
String和char一一对应,建两个map,一个保存String到char的映射,另一个保存char到String的映射。
public class Solution {
public boolean wordPattern(String pattern, String str) {
int pLen = pattern.length();
String[] strs = str.split(" ");
int sLen = strs.length;
if (pLen != sLen)
return false;
Map<String, Character> map1 = new HashMap<String, Character>();
for (int i = 0; i < sLen; i++) {
if (map1.containsKey(strs[i])) {
if (map1.get(strs[i]) != pattern.charAt(i))
return false;
}
else
map1.put(strs[i], pattern.charAt(i));
}
Map<Character, String> map2 = new HashMap<Character, String>();
for (int i = 0; i < pLen; i++) {
if (map2.containsKey(pattern.charAt(i))) {
if (!map2.get(pattern.charAt(i)).equals(strs[i]))
return false;
}
else
map2.put(pattern.charAt(i), strs[i]);
}
return true;
}
}
Runtime:3ms