LeetCode88 Merge Sorted Array-优快云博客

博客给出一道LeetCode题目，要求将两个有序整数数组nums1和nums2合并为一个有序数组，假设nums1有足够空间容纳nums2元素，并给出示例。同时指出本题可利用归并排序的思想来解决。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

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

Note:

The number of elements initialized in nums1 and nums2 are m and n respectively.

You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.

Example:

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

Output: [1,2,2,3,5,6]

本题利用归并排序的思想解决

public class MergeSortedArray {
    public static void merge(int[] nums1, int m, int[] nums2, int n) {
        int location = m + n - 1;
        int left = m - 1, right = n - 1;
        while (left >= 0 || right >= 0) {
            if (left >= 0 && right >= 0) {
                nums1[location--] = nums1[left] >= nums2[right] ? nums1[left--] : nums2[right--];
            } else {
                nums1[location--] = left >= 0 ? nums1[left--] : nums2[right--];
            }
        }
    }

    public static void main(String[] args) {
        int[] nums1 = {1,2,3,0,0,0};
        int m = 3;
        int[] nums2 = {2,5,6};
        int n = 3;
        merge(nums1, m, nums2, n);
        System.out.println(Arrays.toString(nums1));
    }
}