【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 nums1and nums2 are m and n respectively.

Solution:

 class Solution {
 public:
     void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {　　//runtime: 4ms
         int i=m-;
         int j=n-;
         int k = m+n-;
         while(i >= && j>=)
         {
             if(nums1[i] > nums2[j])
                 nums1[k--] = nums1[i--];
             else
                 nums1[k--] = nums2[j--];
         }
         while(j>=)
             nums1[k--] = nums2[j--];
     }
 };