题解 | #数组中出现次数超过一半的数字#

#include <vector>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param numbers int整型vector 
     * @return int整型
     */
    int MoreThanHalfNum_Solution(vector<int>& numbers) {
        // write code here
        int ans = 0;
        int max = numbers[0],min = numbers[0];
        for(int i = 1;i < numbers.size();++i)
        {
            if(max < numbers[i])
            {
                max = numbers[i];
            }

            if(min > numbers[i])
            {
                min = numbers[i];
            }
        }

        int range = max - min + 1;
        vector<int> v(range);

        for(auto number : numbers)
        {
            v[number - min]++;
        }

        for(int i = 0;i < range;++i)
        {
            if(v[i] > (numbers.size() / 2))
            {
                ans = i + min;
                break;
            }
        }
        return ans;
    }
};