class Solution {
public:
string ans[26];
bool wordPattern(string pattern, string str) {
int i = 0;
for(int j = 0;j < str.length(); j++){
string res ="";
while(str[j] != ' ' && j < str.length()){
res+=str[j++];
}
if(i == pattern.length()) return false;
int x = pattern[i++]-'a';
if(ans[x].length() == 0)
ans[x] = res;
if(ans[x] != res) return false;
}
for(int l = 0;l < 26; l++){
if(ans[l].length() == 0) continue;
for(int j =l+1;j < 26; j++)
if(ans[l] == ans[j]) return false;
}
return i == pattern.length();
}
};
leetcode 290. Word Pattern
最新推荐文章于 2024-10-01 05:07:35 发布