leetcode——88——Merge Sorted Array

Given two sorted integer arrays nums1 and nums2, merge nums2 intonums1 as one sorted array.

Note:
You may assume that nums1 has enough space (size that is greater or equal tom + n) to hold additional elements from nums2. The number of elements initialized innums1 and nums2 are m and n respectively.

class Solution {public:    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {        vector<int> ret;        int i = 0, j = 0;        while (i < m && j < n)        {            if (nums1[i] <= nums2[j])            {                ret.push_back(nums1[i]);                i++;            }else{                ret.push_back(nums2[j]);                j++;            }//elif        }//while        while (i < m)        {            ret.push_back(nums1[i]);            i++;        }//while        while (j < n)        {            ret.push_back(nums2[j]);            j++;        }//while        nums1 = ret;    }};