LeetCode OJ: Median of Two Sorted Arrays

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

求中位数，思想跟归并的一样了，只是不用记录所有的数，只需要记录中间位置的记录，对奇数长度与偶数长度的情况处理下就好。

代码如下：

class Solution {
public:
    double findMedianSortedArrays(int A[], int m, int B[], int n) {
        int mid = (m + n) / 2;
        int rest = (m + n) % 2;
        int i = 0, j = 0, k = 0;
        int pre, cur = 0;
        while (i < m && j < n && k <= mid) {
            if (A[i] < B[j]) {
                pre = cur;
                cur = A[i];
                k++;
                i++;
            } else {
                pre = cur;
                cur = B[j];
                k++;
                j++;
            }
        }
        while (k <= mid && i < m) {
            pre = cur;
            cur = A[i];
            i++;
            k++;
        }
        while (k <= mid && j < n) {
            pre = cur;
            cur = B[j];
            j++;
            k++;
        }
        if (rest == 0) {
            return 0.5 * (pre + cur);
        } else {
            return cur;
        }
    }
};