求两个有序数组A和B的第k大的数——Java

来源:互联网 发布:上海浦东软件协会朱 编辑:程序博客网 时间:2024/05/16 17:52
package com.bupt;public class Solution6 {public static int Search(int[] a,int startA,int endA,int[] b,int startB,int endB,int k){if(k ==1){if(a[startA]>b[startB]){return b[startB];}else{return a[startA];}}if(startA>endA){return b[startB+k-1];}if(startB>endB){return a[startA+k-1];}int countA = 0;//分别取A,B数组中元素的个数int countB = 0;if(a.length<b.length){//查看k/2是否大于数组A或B的长度,并进行相应的处理if(endA-startA+1>k/2){countA = k/2;}else{countA = endA-startA+1;}countB = k-countA;}else{if(endB-startB+1>k/2){countB = k/2;}else{countB = endB-startB+1;}countA = k-countB;}int indexA = startA+countA-1;//A和B的比较点int indexB = startB+countB-1;if(a[indexA] == b[indexB]){return a[indexA];}else{if(a[indexA]>b[indexB]){//根据比较的结果进行相应递归return Search(a,startA,indexA,b,indexB+1,endB,k-countB);}else{return Search(a,indexA+1,endA,b,startB,indexB,k-countA);}}}    public static void main(String[] args){    int[] a = new int[]{1,9,10,18};        int[] b = new int[]{7,10};        int k = 6;        System.out.println(Search(a,0,a.length-1,b,0,b.length-1,k));    }    }

0 0