LeetCode 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) {        vector<int> v;        int i = 0, j = 0;        for(i = 0, j = 0; i < m && j < n;){            if(nums1[i] < nums2[j]){                v.push_back(nums1[i]);                i ++;            }else{                v.push_back(nums2[j]);                j ++;            }        }        while(i < m){            v.push_back(nums1[i]);            i ++;        }        while(j < n){            v.push_back(nums2[j]);            j ++;        }        nums1.clear();        nums1 = v;    }};