Description
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
- The number of elements initialized in nums1 and nums2 are m and n respectively.
- You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.
Example
Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]
Solving
Putting numbers into nums1 array start with the right side, which means making numbers in right place from big to small.
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int pos1 = m - 1, pos2 = n - 1, pos = m + n - 1;
while (pos1 > -1 && pos2 > -1)
nums1[pos --] = (nums1[pos1] > nums2[pos2])? nums1[pos1 --]: nums2[pos2 --];
while (pos2 > -1)
nums1[pos --] = nums2[pos2 --];
}
}