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 nums1 and nums2 are m and n respectively.合并两个已排序的数组，类似直插排序，从数组最右边开始比较排序，从容量的最右边开始插入元素。*/class Solution {public:    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {        int k=m+n-1,i=m-1,j=n-1;        while(j>=0)        {            nums1[k--] = (i>=0 && nums1[i]>nums2[j]) ? nums1[i--] : nums2[j--];        }    }};