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和nums2中较大的值写入nums1。

虽然nums1中有m个元素，但是nums1的长度是m+n。

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

leetcode 88. Merge Sorted Array

相关推荐