[leetcode] 88. 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.

注意：结果值是数组nums1

从后往前比较，把较大值放到nums1的尾部即可

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