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

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

        int range = max - min + 1;

        int* countArr = new int[range];
        memset(countArr, 0, sizeof(int) * range);
        for (int i = 0; i < numbers.size(); i++)
        {
            countArr[numbers[i] - min]++;
        }

        //遍历找到符合要求的数
        for (int i = 0; i < range; i++)
        {
            if(countArr[i] > size2)
            {
                return i + min;
            }
        }
        return -1;
    }
};