【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 nums1and nums2 are m and n respectively.

class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
if(n==0) return;
if(m==0&&n!=0)
{
for(int i = 0; i< n;i++)
{
nums1.push_back(nums2[i]);
}
}
int k=0,w=0;
vector<int> result;
while(k<m&&w<n)
{
if(nums1[k]<=nums2[w])
{
result.push_back(nums1[k]);
k++;
}else{
result.push_back(nums2[w]);
w++;
}
}
while(k<m)
{
result.push_back(nums1[k]);
k++;
}
while(w<n)
{
result.push_back(nums2[w]);
w++;
}
nums1 = result;
}
};