public class Solution {
public boolean wordPattern(String pattern, String str) {
String[] arrayS = str.split(" ");
Map<Character, String> map = new HashMap<>();
if(pattern.length() != arrayS.length){
return false;
}
for(int i = 0; i < arrayS.length; i++){
char t = pattern.charAt(i);
if(map.containsKey(t)){
if(!map.get(t).equals(arrayS[i])){//检测pattern[i]是否对应arrayS[i]
return false;
}
}
else{
if(map.containsValue(arrayS[i])){检测map中arrayS[i]是否已经存在，只允许一对一，不允许一对多或多对一
return false;
}
map.put(t, arrayS[i]);
}
}
return true;
}
}
