# 88. merge two ordered arrays

88. merge two ordered arrays

Title Description

Given two ordered arrays of integers nums1 and nums2 , the nums2 incorporated into nums1 in , such num1 be an ordered array.

Description:

• Initialization nums1 and nums2 number of elements respectively m and n- .
• You can assume nums1 sufficient space (space greater than or equal to m + n- ) to hold nums2 elements.

Example:

输入:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6],       n = 3

输出: [1,2,2,3,5,6]

Code posted

class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        int index1 = m - 1, index2 = n - 1;
        int indexMerge = m + n - 1;
        while (index1 >= 0 || index2 >= 0){
            if (index1 < 0){
                nums1[indexMerge--] = nums2[index2 --];
            }else if (index2 < 0){
                nums1[indexMerge--] = nums1[index1 --];
            }else if (nums1[index1] > nums2[index2]){
                nums1[indexMerge--] = nums1[index1--];
            }else{
                nums1[indexMerge--] = nums2[index2 --];
            }
        }
    }
}

func merge(nums1 []int, m int, nums2 []int, n int)  {
    index1 , index2 := m - 1, n -1
    indexMerge := m + n - 1
    for index1 >= 0 || index2 >= 0 {
        if index1 < 0 {
            nums1[indexMerge] = nums2[index2]
            indexMerge--
            index2--
        }else if index2 < 0 {
            nums1[indexMerge] = nums1[index1]
            indexMerge--
            index1--
        }else if nums1[index1] > nums2[index2] {
            nums1[indexMerge] = nums1[index1]
            indexMerge--
            index1--
        }else{
                nums1[indexMerge] = nums2[index2]
                indexMerge--
                index2--
        }
    }
}