leetcode每日一题为工作做准备(多数准备)

class Solution {
    public int majorityElement(int[] nums) {
         int major = 0 ;
         int now = 0;
         for(int i=0;i<nums.length;i++){
             if(now==0){
                 major=nums[i];
                 now++;
             }else{
                 if(major == nums[i]){
                     now++;
                 }else{
                     now--;
                 }
             }
         }
         return major;
    }
}