(java)leetcode-88:Merge Sorted Array

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.

解题思路：

一开始老是想说如果从头开始往后重新排的话会把后面的值覆盖了。后来才发现原来可以反向思考从后往前排....具体没啥好说了。

public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int k = m+n-1;
m -=1;
n -=1;
while(n>=0 && m>=0)
{
if(nums1[m] > nums2
)
nums1[k--] = nums1[m--];
else
nums1[k--] = nums2[n--];
}
while(n>=0)
nums1[k--] = nums2[n--];
}
}