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

public:
    int MoreThanHalfNum_Solution(vector<int> numbers) {
        sort(numbers.begin(),numbers.end());
        int len=numbers.size()/2;
        int count=1;
        int i;
        int test=numbers[0];
        for(i=1;i<=numbers.size()-1;i+=1){
            if(count>len){
                break;
            }
            if(numbers[i]==test){
                count+=1;
            }
            else{
                count=1;
                test=numbers[i];
            }
        }
        return test;
    }
};