Merge Sorted Array II

Merge Sorted Array II

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 (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are mand n respectively.

Example

A = [1, 2, 3, empty, empty] B = [4,5]

After merge, A will be filled as [1,2,3,4,5]

Solution:

    public void mergeSortedArray(int[] A, int m, int[] B, int n) {
        int index = m + n;
        while (n > 0 && m > 0) {
            if (A[m - 1] > B[n - 1]) {
                A[--index] = A[--m];
            } else {
                A[--index] = B[--n];
            }
        }
        while (n > 0) { 
            A[--index] = B[--n];
        }
    }

思路：

在A中从后向前，这样每次插入不必移动A中数。A、B数组都可能先遍历完，如果A先遍历完，则把剩下的B添加到A中。如果B先遍历完，则剩下的A保持不同即可。