Compare A and B from 0 to end; if A < B, put A[i] to results.

class Solution {
public:
    /*
     * @param A: sorted integer array A
     * @param B: sorted integer array B
     * @return: A new sorted integer array
     */
    vector<int> mergeSortedArray(vector<int> &A, vector<int> &B) {
        // write your code here
        vector<int> results;
        int indexA = 0;
        int indexB = 0;

        while (indexA < A.size() && indexB < B.size()) {
            if (A[indexA] < B[indexB]) {
                results.push_back(A[indexA]);
                indexA++;
            } else {
                results.push_back(B[indexB]);
                indexB++;
            }
        }
        while (indexA < A.size()) {
            results.push_back(A[indexA++]);
        }
        while (indexB < B.size()) {
            results.push_back(B[indexB++]);
        }
        return results;
    }
};