LeetCode--键盘行

撸了一道跟哈希有点关系的算法。想法就是----妈妈我要好好学习C++以及C++11真棒还有STL牛逼！给出code记载一下，防止以后忘了。。。。

用的DEV-C++或者VS2013都可以

#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include<string>
using namespace std;

class Solution{
public:
	//定义一个函数findWords，返回的值是string类型的向量，函数参数是string类型的向量
	vector<string> findWords(vector<string>& words);
	Solution(){};
	~Solution(){};
private:

};
vector<string> Solution::findWords(vector<string>& words){
	
	vector<string> res;
	unordered_set<char> row1{ 'q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'Q', 'W', 'E', 'R', 'T', 'Y', 'U', 'I', 'O', 'P' };
	unordered_set<char> row2{ 'a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', 'A', 'S', 'D', 'F', 'G', 'H', 'J', 'K', 'L' };
	unordered_set<char> row3{ 'z', 'x', 'c', 'v', 'b', 'n', 'm', 'Z', 'X', 'C', 'V', 'B', 'N', 'M' };
	for (string word : words){
		int a = 0;
		int b = 0;
		int c = 0;
		for (char ch : word){
			if (row1.count(ch)) a=1;
			if (row2.count(ch)) b=1;
			if (row3.count(ch)) c=1;
			if (a + b + c > 1) break;
		}
		if (a + b + c == 1) res.push_back(word);
	}
	return res;
}
int main(){
	Solution solution;
	vector<string> words{ "Hello", "Alaska", "Dad", "Peace" };

	vector<string> res(solution.findWords(words));

	vector<string>::iterator it;
	for (it = res.begin(); it != res.end(); ++it){
		cout << (*it) << " ";
	}
	
	system("pause");
	return 0;
}