Median of Two Sorted Arrays(Java)

求2个数组的中位数

方法很多

但是时间复杂度各异

1利用数组copy方法先融合两个数组,然后排序，找出中位数

import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;

public class _004MedianofTwoSortedArrays {

    public static void main(String[] args)
    {
        int a[]={2,3,5,9};
        int b[]={1,4,7,10,11};
        System.out.println(findMedianSortedArrays(a,b));
    }

     public static double findMedianSortedArrays(int A[], int B[])
     {
         int[] d3 = new int[A.length + B.length];
         System.arraycopy(A, 0, d3, 0, A.length);
         System.arraycopy(B, 0, d3, A.length, B.length);
         Arrays.sort(d3);
         System.out.println(Arrays.toString(d3));
         return d3.length%2!=0?d3[d3.length/2]/1.0:(d3[d3.length/2-1]+d3[d3.length/2])/2.0;

      }

}

2是循环判断插入新数组中 等于说不用内置copy方法自己写一个替代

 import java.util.Arrays;

 public class _004_2Median {

     public static void main(String[] args) {
         // TODO Auto-generated method stub
         int a[]={2,34};
         int b[]={1,4,9};
         System.out.println(findMedianSortedArrays(a,b));
     }

     private static double findMedianSortedArrays(int[] a, int[] b) {
         int k=a.length+b.length;
         System.out.println(k);
         int[] c=new int[k];
         int i=0,j=0,m=0;
         while(m!=k)
         {
             if(i==a.length)
             {
                 c[m]=b[j];
                 j++;

             }
             else if(j==b.length)
             {
                 c[m]=a[i];
                 i++;
             }
             else if(a[i]<b[j])
             {
                 c[m]=a[i];
                 i++;

             }
             else
             {
                 c[m]=b[j];
                 j++;

             }
             m++;
         }

         return k%2==0?(c[k/2-1]+c[k/2])/2.0:c[k/2]/1.0;

     }

 }

3第三种递归方法有待研究