句子 是一串由空格分隔的单词。每个 单词 仅由小写字母组成。
如果某个单词在其中一个句子中恰好出现一次,在另一个句子中却 没有出现 ,那么这个单词就是 不常见的 。
给你两个 句子 s1 和 s2 ,返回所有 不常用单词 的列表。返回列表中单词可以按 任意顺序 组织。
示例 1:
输入:s1 = "this apple is sweet", s2 = "this apple is sour"
输出:["sweet","sour"]
示例 2:
输入:s1 = "apple apple", s2 = "banana"
输出:["banana"]
提示:
1 <= s1.length, s2.length <= 200
s1 和 s2 由小写英文字母和空格组成
s1 和 s2 都不含前导或尾随空格
s1 和 s2 中的所有单词间均由单个空格分隔
#include <unordered_map>
#include <unordered_set>
using namespace std;
class Solution {
public:
vector<string> uncommonFromSentences(string s1, string s2) {
int start = 0;
int i = 0;
string tmp;
vector<string> str1;
vector<string> str2;
unordered_set<string>::iterator it;
unordered_map<string, int> mp1;
unordered_map<string, int> mp2;
unordered_map<string, int>::iterator m1;
unordered_map<string, int>::iterator m2;
unordered_set<string> set1;
unordered_set<string> set2;
vector<string> vec;
for(i = 0; i < s1.size(); i++){
if(s1[i] == ' '){
tmp = s1.substr(start, i - start);
start = i + 1;
cout<<"tmp1:"<<tmp<<endl;
if(mp1.count(tmp) == 0){
mp1[tmp] = 1;
}else{
mp1[tmp] ++;
}
}
}
tmp = s1.substr(start, i - start);
if(mp1.count(tmp) == 0){
mp1[tmp] = 1;
}else{
mp1[tmp] ++;
}
cout<<"tmp2:"<<tmp<<endl;
start = 0;
for(i = 0; i < s2.size(); i++){
if(s2[i] == ' '){
tmp = s2.substr(start, i - start);
start = i + 1;
if(mp2.count(tmp) == 0){
mp2[tmp] = 1;
}else{
mp2[tmp] ++;
}
cout<<"tmp3:"<<tmp<<endl;
}
}
tmp = s2.substr(start, i - start);
cout<<"tmp4:"<<tmp<<endl;
if(mp2.count(tmp) == 0){
mp2[tmp] = 1;
}else{
mp2[tmp] ++;
}
m1 = mp1.begin();
while(m1 != mp1.end()){
if(m1->second == 1 && (mp2.count(m1->first) == 0)){
vec.push_back(m1->first);
}
m1++;
}
m2 = mp2.begin();
while(m2 != mp2.end()){
if(m2->second == 1 && (mp1.count(m2->first) == 0)){
vec.push_back(m2->first);
}
m2++;
}
return vec;
}
};