leetcode-javascript/median-of-two-sorted-arrays.js at master · didi0613/leetcode-javascript · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
/**
 * @param {number[]} nums1
 * @param {number[]} nums2
 * @return {number}
 */
var findMedianSortedArrays = function (nums1, nums2) {
    var len1 = nums1.length, len2 = nums2.length;
    if ((len1 + len2) % 2 === 0) {
        return (findKthArray(nums1, 0, nums2, 0, Math.floor((len1 + len2) / 2) - 1) + findKthArray(nums1, 0, nums2, 0, Math.floor((len1 + len2) / 2))) / 2;
    } else {
        return findKthArray(nums1, 0, nums2, 0, Math.floor((len1 + len2) / 2));
    }
};

function findKthArray(A, a, B, b, k) {
    while (k >= 0 && a < A.length && b < B.length) {
        if (A[a] < B[b]) {
            k--;
            if (k < 0) {
                return A[a];
            }
            a++;
        } else {
            k--;
            if (k < 0) {
                return B[b];
            }
            b++;
        }
    }

    while (k >= 0 && a < A.length) {
        k--;
        if (k < 0) {
            return A[a];
        }
        a++;
    }

    while (k >= 0 && b < B.length) {
        k--;
        if (k < 0) {
            return B[b];
        }
        b++;
    }

    return 0;
}