[LeetCode] 169 Majority Element

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

class Solution { public: int majorityElement(vector<int>& nums) { int ans; int cnt = 0; for (int i = 0; i < nums.size(); i++) { if (cnt == 0) ans = nums[i]; if (ans == nums[i]) cnt++; else cnt--; } return ans; } };