LeetCode 88. Merge Sorted Array

LeetCode 88. Merge Sorted Array

Description:

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.

---

分析：

很简单，注意理解题意，nums2多余的数也要放到nums1中。
其实有一点不太理解，不能把nums2添加到nums1中去，然后排序吗？

代码如下：

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