【leetcode】Leercode:169. Majority Element

问题描述：Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.

Example 1:

Input: [3,2,3] Output: 3

Example 2:

Input: [2,2,1,1,1,2,2] Output: 2

难度等级：简单

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

还要继续努力啊O(∩_∩)O哈哈~