39 lines
1.3 KiB
C++
39 lines
1.3 KiB
C++
#include <string>
|
|
#include <vector>
|
|
#include <unordered_map>
|
|
|
|
/**
|
|
* 884. Uncommon Words from Two Sentences
|
|
* A sentence is a string of single-space separated words where each word consists only of lowercase letters.
|
|
* A word is uncommon if it appears exactly once in one of the sentences, and does not appear in the other sentence.
|
|
* Given two sentences s1 and s2, return a list of all the uncommon words. You may return the answer in any order.
|
|
*/
|
|
|
|
class Solution {
|
|
private:
|
|
static std::unordered_map<std::string, int> breakWords(const std::string& s) {
|
|
std::unordered_map<std::string, int> m;
|
|
for (int pos = 0; pos >= 0; (pos = s.find_first_of(' ', pos)), (pos = (pos == -1 ? -1 : pos + 1))) {
|
|
++m[s.substr(pos, s.find_first_of(' ', pos) - pos)];
|
|
}
|
|
return m;
|
|
};
|
|
public:
|
|
static std::vector<std::string> uncommonFromSentences(const std::string& s1, const std::string& s2) {
|
|
auto m1 = breakWords(s1), m2 = breakWords(s2);
|
|
std::vector<std::string> ret;
|
|
for (const auto& i : m1)
|
|
if (i.second == 1 && !m2.count(i.first))
|
|
ret.push_back(i.first);
|
|
for (const auto& i : m2)
|
|
if (i.second == 1 && !m1.count(i.first))
|
|
ret.push_back(i.first);
|
|
return ret;
|
|
}
|
|
};
|
|
|
|
int main() {
|
|
auto ret = Solution::uncommonFromSentences("this apple is sweet", "this apple is sour");
|
|
return 0;
|
|
}
|