https://leetcode.com/problems/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.
排个序，中间的那个就是正确结果。这道题有Solution，解法非常多。
/** * @param {number[]} nums * @return {number} */ var majorityElement = function(nums) { nums = nums.sort(); return nums[parseInt(nums.length / 2)]; };
[LeetCode][JavaScript]Majority Element
原文：http://www.cnblogs.com/Liok3187/p/4507987.html