290. 单词规律
代码;
class Solution {
public boolean wordPattern(String pattern, String str) {
String[] s = str.split(" ");
if (pattern.length() != s.length) return false;
StringBuffer str1 = new StringBuffer();
StringBuffer str2 = new StringBuffer();
int count = 1;
HashMap<Character, Integer> node1 = new HashMap<>();
for (int i = 0; i < pattern.length(); i++)
{
if (!node1.containsKey(pattern.charAt(i))) {
str1.append(count);
node1.put(pattern.charAt(i), count++);
}
else str1.append(node1.get(pattern.charAt(i)));
}
count = 1;
HashMap<String, Integer> node2 = new HashMap<>();
for (int i = 0; i < s.length; i++)
{
if (!node2.containsKey(s[i])) {
str2.append(count);
node2.put(s[i], count++);
}
else str2.append(node2.get(s[i]));
}
System.out.println(str1 + " " + str2);
return str1.toString().equals(str2.toString());
}
}