[LeetCode]Merge Sorted Array

 1 class Solution {
 2 public:
 3     void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
 4         int index = m+n-1;
 5         int index1 = m-1;
 6         int index2 = n-1;
 7         while(index1>=0 && index2>=0)
 8         {
 9             if(nums1[index1]<nums2[index2])
10             {
11                 nums1[index--] = nums2[index2--];
12             }
13             else
14             {
15                 nums1[index--] = nums1[index1--];
16             }
17         }
18         while(index1>=0)
19         {
20             nums1[index--] = nums1[index1--];
21         }
22         while(index2>=0)
23         {
24             nums1[index--] = nums2[index2--];
25         }
26         return;
27     }
28 };