查找数组中出现次数超过一半的数字

package test;




public class Test3 {
		
	
	static int solve(int[] arr,int len){
		int index = -1;
		int mid = (len)/2;
		int low = 0;
		int high = len-1;
		while(index != mid){
			index = partition(arr, low, high);
			if(index == mid) break;
			if(index>mid){
				high = index-1;
			}else{
				low = index+1;
			}
		}
		return arr[mid];
	}
	
	static int partition(int[] arr,int low,int high){
		int flag = arr[low];
		while(low<high){
			while(low<high && arr[high]>=flag) high--;
			arr[low] = arr[high];
			while(low<high && arr[low] <= flag) low++;
			arr[high] = arr[low];			
		}		
		arr[low] = flag;
		return low;
	}
	
	public static void main(String[] args) {					
		int[] arr = new int[]{1,2,3,2,2,2,5,4,2};		
		System.out.println(solve(arr, arr.length));
	}
}

最后

以上就是坦率眼睛为你收集整理的查找数组中出现次数超过一半的数字的全部内容，希望文章能够帮你解决查找数组中出现次数超过一半的数字所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。