leetcode 088 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.

Subscribe to see which companies asked this question

class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int i=0, j=0;
for(; i<m && j<n;) {
if(nums1[i] >= nums2[j]) {
for(int k=m-1; k>=i; k--) {
nums1[k+1] = nums1[k];
}
m += 1;
nums1[i] = nums2[j];
i++;
j++;
} else {
i++;
}
}

if(j < n) {
for(; j<n; j++) {
nums1[i++] = nums2[j];
}
}
}
};