LeetCode – Refresh – Merge Sorted Array

Note:

Since it merged from end, so 

1. tmp1, tmp2 = INT_MIN

2. tmp1 > tmp2

class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        int total = m+n-1, indexA = m-1, indexB = n-1;
        while (indexA >= 0 || indexB >= 0) {
            int tmp1 = INT_MIN, tmp2 = INT_MIN;
            if (indexA >= 0) {
                tmp1 = A[indexA];
            }
            if (indexB >= 0) {
                tmp2 = B[indexB];
            }
            if (tmp1 > tmp2) {
                A[total--] = A[indexA--];
            } else {
                A[total--] = B[indexB--];
            }
        }
    }
};