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

思路：归并排序

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