Merge Sorted Array Java

最新推荐文章于 2024-01-18 17:58:46 发布

Spencer_Lin

最新推荐文章于 2024-01-18 17:58:46 发布

阅读量412

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode String+Array 文章标签： leetcode array

本文链接：https://blog.youkuaiyun.com/linxiang0591/article/details/38706365

LeetCode String+Array 专栏收录该内容

36 篇文章

订阅专栏

本文介绍如何在Java中将两个已排序的整数数组合并为一个有序数组，通过从后向前遍历并比较元素大小，实现空间复杂度为O(m+n)的合并过程。

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

Given two sorted integer arrays A and B, merge B into A as one sorted array.

Note:
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B.

The number of elements initialized in A and B are m and n respectively.

Key to solve: Merge from back to front
order to archive in place space,
check for case of there are still elements left in B
Time Complexity: O(m+n)

public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        int i=m-1;
        int j=n-1;
        while(i>=0 && j>=0){
            if(A[i]>B[j]){
                A[i+j+1]=A[i];
                i--;
            }else{
                A[i+j+1]=B[j];
                j--;
            }
        }
        //check for special case of B
        while(j>=0){
            A[j]=B[j];
            j--;
        }
    }
}