Leetcode Problem.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.

My C++ solution！

void merge(vector<int>& nums1, int m, vector<int>& nums2, int n)
{
	   if(m==0&&n==0)
		   return;
	   else if(m==0)
		   nums1=nums2;
	   else
	   {
		   int i=0;
		   int j=0;
		   while(j<n)
		   {
			   if(nums2[j]<=nums1[i])
			   {
				   nums1.insert(nums1.begin()+i,nums2[j]);
				   i++;
				   j++;
			   }
			   else if(i==m+j-1)
			   {
				   nums1.insert(nums1.begin()+m+j,nums2.begin()+j,nums2.end());
				   j=n;
			   }
			   else
				   i++;

		   }
	   }
	   nums1.resize(m+n);
}