Merge Sorted Array <leetcode>

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 andn respectively.

 

思路：list自带的有归并函数，所以把两个数组分别放入两个list中，然后归并，再把排好序的归并结果放入数组A中；代码如下：

class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        list<int> la;
        list<int> lb;
        for(int i=0;i<m;i++)
        {
            la.push_back(A[i]);
        }
        for(int i=0;i<n;i++)
        {
            la.push_back(B[i]);
        }
        la.sort();
        lb.sort();
        la.merge(lb);
        for(int i=0;i<m+n;i++)
        {
            A[i]=la.front();
            la.pop_front();
        }
        
    }
};