LeetCode: Merge Sorted Array

一点小失误，基本一次过吧，这段程序不好，参考C#

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
        vector<int> C(m);
        for (int i = 0; i < m; i++) C[i] = A[i];
        int p = 0;
        int q = 0;
        int beg = 0;
        while (p < m && q < n) {
            A[beg++] = min(C[p], B[q]);
            if (C[p] < B[q]) p++;
            else q++;
        }
        if (p == m) {
            for (int i = q; i < n; i++) A[beg++] = B[i];
        }
        if (q == n) {
            for (int i = p; i < m; i++) A[beg++] = C[i];
        }
    }
};

 C#

public class Solution {
    public void Merge(int[] nums1, int m, int[] nums2, int n) {
        for (int i = m+n-1; i >= 0; i--) {
            if (m == 0) nums1[i] = nums2[--n];
            else if (n == 0) break;
            else if (nums1[m-1] < nums2[n-1]) nums1[i] = nums2[--n];
            else nums1[i] = nums1[--m];
        }
    }
}