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)).

题意

长度为m和n排好序的数组A和B，找出A和B的中值

思路

将A和B放到数组C中排好序，找出C中的中间值。如果C的长度为奇数，返回C[C.length / 2] / 2;如果C长度为偶数,返回中间两个数的平均值，返回(C[size / 2] + C[(size - 1)/ 2]) / 2

public class Solution {
    public double findMedianSortedArrays(int A[], int B[]) {
        double C[] = new double[A.length + B.length];
        int ptr_a = 0;
        int ptr_b = 0;
        int ptr_c = 0;
        for(; ptr_a < A.length && ptr_b < B.length && ptr_c < C.length; ptr_c++){
            if(A[ptr_a] > B[ptr_b]){
                C[ptr_c] = B[ptr_b];
                ptr_b++;
            }
            else{
                C[ptr_c] = A[ptr_a];
                ptr_a++;
            }
        }//for
        while(ptr_a < A.length)
        {
            C[ptr_c++] = A[ptr_a++];
        }
        while(ptr_b < B.length)
        {
            C[ptr_c++] = B[ptr_b++];
        }

        

        int size = C.length;
        if(size % 2 == 1)
            return C[size / 2];
        return (C[size / 2] + C[(size - 1)/ 2]) / 2;    
    }
}