1. Description

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.

2. Example

Given
nums1=[1,2,3,6,8]
nums2=[2,3,4,5]
reutrn
nums1=[1,2,2,3,3,4,5,6,8]
nums2=[2,3,4,5]

3. Code

public class LeetCode0088 {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        if (nums1 == null || nums2 == null) {
            return;
        }
        m--;
        n--;
        int i = m + n + 1;
        while (m >= 0 && n >= 0) {
            nums1[i--] = nums1[m] > nums2[n] ? nums1[m--] : nums2[n--];
        }
        while (n >= 0) {
            nums1[i--] = nums2[n--];
        }
    }
}