Sentence Similarity问题及解法

问题描述：

Given two sentences words1, words2 (each represented as an array of strings), and a list of similar word pairs pairs, determine if two sentences are similar.

For example, "great acting skills" and "fine drama talent" are similar, if the similar word pairs are pairs = [["great", "fine"], ["acting","drama"], ["skills","talent"]].

Note that the similarity relation is not transitive. For example, if "great" and "fine" are similar, and "fine" and "good" are similar, "great" and "good" are not necessarily similar.

However, similarity is symmetric. For example, "great" and "fine" being similar is the same as "fine" and "great" being similar.

Also, a word is always similar with itself. For example, the sentences words1 = ["great"], words2 = ["great"], pairs = [] are similar, even though there are no specified similar word pairs.

Finally, sentences can only be similar if they have the same number of words. So a sentence like words1 = ["great"] can never be similar to words2 = ["doubleplus","good"].

问题分析：

将相似词保存到map中去，每一个词所有的相似词都保留在一个vector中，遍历words1和words2时，只需要对比两个词是否为同义词即可。

过程详见代码：

class Solution {
public:
    bool areSentencesSimilar(vector<string>& words1, vector<string>& words2, vector<pair<string, string>> pairs) {
        int n1 = words1.size();
		int n2 = words2.size();
		if (n1 != n2) return 0;
		unordered_map<string, vector<string>> map;
		for (auto p : pairs)
		{
			map[p.first].push_back(p.second);
			map[p.second].push_back(p.first);
		}
		for (int i = 0; i < n1; i++)
		{
			if (words1[i] == words2[i]) continue;
			vector<string> t = map[words1[i]];
			int flg = 0;
			for (int j = 0; j < t.size(); j++)
			{
				if (t[j] == words2[i])
				{
					flg = 1;
					break;
				}
			}
			if (!flg) return false;
		}
		return true;
    }
};