[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.

//#88 Merge Sorted Array//4ms 100%#include <iostream>#include <vector>using namespace std;class Solution {public:    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n)     //merge two sorted array    //merge begin from the back    {        if(n == 0) return;        //cout << "n != 0\n";        int i(0), j(0), k(0);        i = m-1;        j = n-1;        k = m+n-1;        while(i >= 0 && j >= 0)        {            if(nums1[i] < nums2[j])            {                nums1[k] = nums2[j];                k --;                j --;            }            else            {                nums1[k] = nums1[i];                k --;                i --;            }        }        while(j >= 0)        {            nums1[k] = nums2[j];            k --;            j --;        }        return;                         }};