package leetcode; public class demo_169 { public int majorityElement(int[] nums) { int count=1; int target=nums[0]; //摩尔投票法,与target相同则加一,不同则减一 for(int i=1;i<nums.length;i++) { //如果计数为0,则改变target if(count==0) { target=nums[i]; } if(nums[i]==target) { count=count+1; } else { count=count-1; } } System.out.println(target); return target; } public static void main(String[] args) { // TODO Auto-generated method stub demo_169 d169=new demo_169(); int[] nums= {2,2,1,1,1,2,2}; d169.majorityElement(nums); } }