[LeetCode 088] Merge Sorted Array

Merge Sorted Array

Implementation

public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int index = m + n - 1;
int index1 = m - 1;
int index2 = n - 1;
while (index1 >= 0 && index2 >= 0) {
nums1[index--] = (nums1[index1] < nums2[index2]? nums2[index2--]: nums1[index1--]);
}
while (index2 >= 0) {
nums1[index--] = nums2[index2--];
}
}
}