【数组】169. 多数元素

 1 class Solution {
 2 public:
 3     int majorityElement(vector<int>& nums) 
 4     {
 5         int curNum = nums[0];
 6         int len = nums.size();
 7 
 8         int count = 1;
 9         for (int i = 1; i < len; ++i)
10         {
11             if (count == 0)
12             {
13                 curNum = nums[i]; 
14                 count = 1;
15             }
16             else
17             {
18                 if (nums[i] != curNum) 
19                 {
20                     count--;
21                 }
22                 else 
23                 {
24                     count++;
25                 }
26             }
27         }
28 
29         return curNum;
30     }
31 };