C++简答代码/hashmap/4行:
数组中出现次数超过一半的数字
http://www.nowcoder.com/questionTerminal/e8a1b01a2df14cb2b228b30ee6a92163
C++简答代码/hashmap/4行:
class Solution { public: int MoreThanHalfNum_Solution(vector<int> numbers) { unordered_map<int, int> map; for (int i : numbers) if (++ map[i] > numbers.size() / 2) return i; return 0; } };