题目：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.
思路：从nums1数组的m+n-1位置开始，从后往前插入元素。
1packagearray;23publicclassMergeSortedArray {45publicvoidmerge(int[] nums1,intm,int[] nums2,intn) {6for(inti = m + n - 1; i >= 0; --i) {7if(m > 0 && n > 0)8nums1[i] = nums1[m - 1] > nums2[n - 1] ? nums1[m-- - 1] : nums2[n-- - 1];9elseif(m > 0)10nums1[i] = nums1[m-- -1];11else12nums1[i] = nums2[n-- -1];13}14}1516publicstaticvoidmain(String[] args) {17//TODO Auto-generated method stub18int[] nums1 = { 1,3,5,7,9,11,13,15,17,19};19int[] nums2 = { 2,4,6,8,10};20MergeSortedArray m =newMergeSortedArray();21m.merge(nums1, 5, nums2, 5);22}2324}