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.

题意：合并两个有序数组。将有序数组nums1和nums2合并到nums1.

思路：从后向前依次插入较大的值。

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