LeetCode 169. Majority Element and LeetCode 229. Majority Element II解题报告

LeetCode 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.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.

Difficulty:Easy

---

分析：
该题目要求寻找众数，且该数出现的次数不得少于⌊ n/2 ⌋，根据分析可知该数最多只有一个，而题目已保证存在一个符合要求的众数，因此可省略此判断。
接下来我们只需找出众数即可。先给任意数组从小到大排序，此时相等的数必定彼此相邻，因此比较相邻的数是否相等即可得出众数。

---

解答：
Solution #1和Solution #2大同小异，只在判断相等的数的个数有点区别，#1是比较cnt和max(=0)，而#2是比较cnt和(nums.size()-1)/2，从而造成了两者运行时间的差异，很明显#2快于#1。

Solution #1:(Run Time:26ms)

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        sort(nums.begin(), nums.end());// 排序
        int res = nums[0];
        int cnt = 0, max = 0;
        for (