摩尔投票法推导众数问题

class Solution {
    public int majorityElement(int[] nums) {
    int vote=0,res=0;
    for(int nu:nums){
        if(vote==0)res=nu;
        vote +=nu==res?1:-1;
    }
    return res;
    }
}

class Solution {
    public int majorityElement(int[] nums) {
     int len=nums.length;
     int vote=0,cur=0;
     for(int i=0;i<len;i++){
         if(vote==0)cur=nums[i];
         vote+=cur==nums[i]?1:-1;
     }
     vote=0;
     for(int i:nums)if(i==cur)vote++;
     return vote>len/2?cur:-1;
    }
}