[leetcode]88. Merge Sorted Array

题目链接:https://leetcode.com/problems/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 icurNums1=m-1,icurNums2=n-1,icur=m+n-1;        while(icurNums1>=0 && icurNums2>=0)            nums1[icur--]=nums1[icurNums1]>nums2[icurNums2]?nums1[icurNums1--]:nums2[icurNums2--];        while(icurNums2>=0)            nums1[icur--]=nums2[icurNums2--];    }};