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.
Solution:
public void merge(int[] nums1, int m, int[] nums2, int n) {
if (n == 0)
return;
int i = m - 1;
int j = n - 1;
int len = m + n - 1;
while (i > -1 && j > -1) {
if (nums1[i] > nums2[j])
nums1[len--] = nums1[i--];
else
nums1[len--] = nums2[j--];
}
while (j > -1) {
nums1[len--] = nums2[j--];
}
}