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.

Subscribe to see which companies asked this question

ac代码：

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