1.Description
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.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
1)排序后,中间数就是nlogn
2)因为目标数出现的次数>[n/2],所有我们可以把除了目标数之外的数作为一个整体看待。目标数和其他数比较,次数肯定是多的。