LeetCode Merge Sorted Array

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 m and n respectively.

class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        int i = m - 1, j = n - 1, k = m + n - 1;
        while(k >= 0 && i >= 0 && j >= 0) {
            if(A[i] > B[j]) {
                A[k] = A[i];
                i--;
            } else {
                A[k] = B[j];
                j--;
            }
            k--;
        }
        for(;j >= 0; j--) {
            A[k] = B[j];
            k--;
        }
    }
};

看了一个shortest版本挺不错。

class Solution {
public:
    void merge(int a[], int m, int b[], int n) {
        for(int i = m + n - 1; n > 0; --i)
            a[i] = (m <= 0 || a[m-1] < b[n-1]) ? b[--n] : a[--m];
    }
};