给一矩阵, 找到矩阵中每一行都出现的元素. 你可以假设矩阵中只有一个满足条件的元素.
样例
样例 1:
输入 :
[
[2,5,3],
[3,2,1],
[1,3,5]
]
输出 : 3
class Solution {
public:
/**
* @param Matrix: the input
* @return: the element which appears every row
*/
int FindElements(vector<vector<int>> &Matrix) {
// write your code here
unordered_map<int, int> mymap;
for(int i = 0; i < Matrix.size(); i++)
{
for(int j = 0; j < Matrix[i].size(); j++)
{
mymap[Matrix[i][j]]++;
}
}
for(auto it = mymap.begin(); it != mymap.end(); it++)
{
if(it->second >= Matrix.size())
return it->first;
}
return -1;
}
};