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) {
        vector<int> a(A,A+m);
        int i = 0, j = 0;
        int count = 0;
        while(i < m && j < n){
            if(a[i] < B[j])
                A[count++] = a[i++];
            else
                A[count++] = B[j++];
        }
        while(i < m){
            A[count++] = a[i++];
        }
        while(j < n)
            A[count++] = B[j++];
    }
};