[LeetCode] Merge Sorted Array

class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (n == 0) return;
        
        for (int v = m - 1; v >= 0; v--)
            A[v + n] = A[v];
        
        int i = n;
        int j = 0;
        int k = 0;
        
        while (i < m + n && j < n) {
            if (A[i] < B[j]) {
                A[k++] = A[i++];
            } else {
                A[k++] = B[j++];
            }
        }
        
        while (j < n) {
            A[k++] = B[j++];
        }
    }
};

Small Case: 4ms

Large Case: 24ms

Time: O(n)

Space: O(1)