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(int[] nums) { int result = 0, count = 0; for (int i = 0; i < nums.length; i++) { if (count == 0) { result = nums[i]; } if (nums[i] == result) { count++; } else { count--; } } return result; } }
原文：https://www.cnblogs.com/amazingzoe/p/9065566.html