目录
思路:
s1和s2相似有三种情况:(设s2长度>s1)
- 头部相同——"Hello world" "Hello"
- 尾部相同——"My name is Roye" "Roye"
- 两头相同——"Today is so lucky" "is so"
因此只要用双指针统计左右两边相同的单词个数l和r
如果两个句子相似,则左右两边相同单词数之和肯定等于s1的长度
1、c++版
c++里没有split分割函数,我们可以使用stringstream流实现
class Solution {
public:
bool areSentencesSimilar(string s1, string s2) {
if(s1.size()>s2.size()) return areSentencesSimilar(s2,s1);
vector<string> a1=split(s1),a2=split(s2);
int len1=a1.size(),len2=a2.size(),l=0,r=0;
while(l<len1&&a1[l]==a2[l]) l++;
while(r<len1-l&&a1[len1-1-r]==a2[len2-1-r]) r++;
return l+r==len1;
}
vector<string> split(string s)
{
vector<string> res;
stringstream ss(s);
string str;
while(ss>>str) res.push_back(str);
return res;
}
};
2、java版
class Solution {
public boolean areSentencesSimilar(String s1, String s2) {
if(s1.length()>s2.length()) return areSentencesSimilar(s2,s1);
String[] a1=s1.split(" "),a2=s2.split(" ");
int len1=a1.length,len2=a2.length,l=0,r=0;
while(l<len1&&a1[l].equals(a2[l])) l++;
while(r<len1-l&&a1[len1-1-r].equals(a2[len2-1-r])) r++;
return l+r==len1;
}
}