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.
1 void merge(int* nums1, int m, int* nums2, int n) { 2 int i=m-1,j=n-1,tmp=0; 3 while(i>=0&&j>=0) 4 { 5 6 if(nums1[i]<nums2[j]) 7 { 8 nums1[i+j+1]=nums2[j]; 9 j--; 10 } 11 else 12 { 13 nums1[i+j+1]=nums1[i]; 14 i--; 15 } 16 } 17 if(i<0) 18 { 19 for(int k=0;k<=j;k++) 20 nums1[k]=nums2[k]; 21 } 22 23 24 }
原文：http://www.cnblogs.com/hexhxy/p/5567238.html