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 andnums2 are m and n respectively.

Difficulty:Easy

void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
vector<int> ans;
for(int i = 0;i<n;i++)
ans.push_back(nums2[i]);
for(int i = 0;i<m;i++)
ans.push_back(nums1[i]);
nums1 = ans;
sort(nums1.begin(),nums1.end());

}