LeetCode题解：Merge Sorted Array

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.

题意：合并两个有序数组，数组1拥有足够的空间存储合并数组

解决思路：按序添加呗，从后向前添加

代码：

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