[LintCode] 合并排序数组

A subroutine of merge sort.

class Solution {
public:
    /**
     * @param A and B: sorted integer array A and B.
     * @return: A new sorted integer array
     */
    vector<int> mergeSortedArray(vector<int> &A, vector<int> &B) {
        // write your code here
        vector<int> merge;
        int pa = 0, pb = 0;
        while (pa < (int)A.size() && pb < (int)B.size()) {
            if (A[pa] <= B[pb]) merge.push_back(A[pa++]);
            else merge.push_back(B[pb++]);
        }
        while (pa < (int)A.size())
            merge.push_back(A[pa++]);
        while (pb < (int)B.size())
            merge.push_back(B[pb++]);
        return merge;
    }
};