88. Merge Sorted Array

题目来源【Leetcode】

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) {        vector<int>temp;        for(int i = 0; i < m; i++){            temp.push_back(nums1[i]);        }        for(int i = 0; i < n; i++){            temp.push_back(nums2[i]);        }        sort(temp.begin(),temp.end());        nums1.resize(m+n);        for(int i = 0; i < m+n; i++){           nums1[i] = temp[i];        }    }};

如果需要只在已有数组进行操作，我看到网上有这个代码，仅供参考：

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