Problem

Given two sorted integer arrays A and B, merge B into A as one sorted array.

Note:
You may assume that A has enough space to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.

Example:
input array 1 : 1,3,5,7
input array 2 : 2,4,6,8

JavaScript Code


function merge(A, m, B, n) {
    var i = m - 1;
    var j = n - 1;
    var k = m + n - 1;
 
    while (k >= 0) {
        if (j < 0 || (i >= 0 && A[i] > B[j]))
            A[k--] = A[i--];
        else
            A[k--] = B[j--];
    }
    return A;
}

console.log(merge([1,2,5,8], 4, [2,4,6,7], 4));

0 comments:

Blogroll

Follow this blog by Email

Popular Posts