链接:https://leetcode-cn.com/problems/majority-element/
class Solution {
public int majorityElement(int[] nums) {
int max=nums[0];
int count=1;
for(int i=1;i<nums.length;i++){
if(nums[i]==max){
count++;
}else{
count--;
if(count==0){
max=nums[i];
count=1;
}
}
}
return max;
}
}