LeetCode OJ 之 Median of Two Sorted Arrays

题目：
There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
我的思路很简单，将两个数组合并为一个有序数组，程序如下：

public class Solution {
    public double findMedianSortedArrays(int A[], int B[]) {
        double result;
        int m = A.length;
        int n = B.length;
        if(m == 0){
            result = findMedian(B);
            return result;
        }
        else if(n == 0){
            result = findMedian(A);
            return result;
        }
        int i = 0, j = 0;
        int num[] = new int[m+n];
        while(i < m && j < n){
            if(A[i] < B[j]){
                num[i+j] = A[i];
                i++;
            }
            else{
                num[i+j] = B[j];
                j++;
            }
        }
        if(i == m){
            while(j < n){
                num[i+j] = B[j];
                j++;
            }
        }
        if(j == n){
            while(i < m){
                num[i+j] = A[i];
                i++;
            }
        }
        System.out.print(Arrays.toString(num));
        result = findMedian(num);
        return result;
    }

    public double findMedian(int b[]){
        double result;
        int len = b.length;
        if(len%2 == 0){
            result = ((double)b[len/2]+(double)b[len/2-1])/2;
        }
        else{
            result = (double)b[(len-1)/2];
        }
        return result;
    }
}