求众数
解题思路:Boyer-Moore、KMP
class Solution { public int majorityElement(int[] nums) { int len = nums.length; int conditate = 0; int count = 0; for(int i=0;i<len;++i){ if(count == 0){ conditate = nums[i]; } count +=(conditate==nums[i])?1:-1; } return conditate; } }
原文:https://www.cnblogs.com/erdanyang/p/11496335.html