LeetCode 88. Merge Sorted Array

题目：

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.

思路：

数组nums1中有m个数，数组nums2中有n个数，nums1的空间大于m+n。

将nums2中的数拷贝到nums1中的m个数后面，然后调用sort(begin,end),sort方法懒得自己写了~

代码：

class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int j=0;
for(int i=m;i<m+n;++i){//将nums2中的数拷贝到nums1中的m个数后面
nums1[i]=nums2[j++];
}
sort(nums1.begin(),nums1.end());//然后调用sort
}
};