插值数组不同的字符串
朴素的模拟题
class Solution {
public:
string oddString(vector<string>& words) {
int n = words.size(), m = words[0].size();
int ans = 0;
for(int i = 1; i < m; i++){
int sta = words[0][i] - words[0][i-1];
for(int j = 1; j < n; j++){
if(int(words[j][i] - words[j][i-1]) != sta){
if(j+1<n&&(int(words[j+1][i] - words[j+1][i-1]) != sta)&&j==1){
ans = 0;
break;
}else{
ans = j;
break;
}
}
}
}
return words[ans];
}
};