LeetCode刷题之88 Merge Sorted Array

1.Description

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has a size equal to m + n such that it has enough space to hold additional elements from nums2.

2.Test Cases

Example 1:

Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]

Example 2:

Input: nums1 = [1], m = 1, nums2 = [], n = 0
Output: [1]

3.Solution

这个题目是简单题目，思考也很方便。合并两个有序数组，要是移动其中的某一个，势必会影响其他的元素。那么可以从最后往前放。两个数组依次取出最大的数比较，把大的数往数组后面放。从后往前放。如果数组nums中的值比较小，可能在nums1中数取完后，还有剩余，那就继续取。

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