[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.

class Solution {
public:
void merge(vector<int>& nums1, int m,
vector<int>& nums2, int n) {
int k = 0;

for (int i = m - 1; i >= 0; i--)
nums1[i + n] = nums1[i];

int i = n, j = 0;
while (i < m + n && j < n) {
if (nums1[i] < nums2[j])
nums1[k++] = nums1[i++];
else
nums1[k++] = nums2[j++];

}

while (i < m + n)
nums1[k++] = nums1[i++];

while (j < n)
nums1[k++] = nums2[j++];
}
};