Merge Sorted Array

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

原创最新推荐文章于 2024-01-18 17:58:46 发布 · 623 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #merge #源代码 #array

leetcode刷题记录专栏收录该内容

16 篇文章

订阅专栏

本文讨论了如何使用Java将两个已排序的整数数组合并为一个排序后的数组，详细介绍了算法实现过程。

摘要生成于 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 andn respectively.

源代码：

public class Solution {
	public void merge(int A[], int m, int B[], int n) {
		int[] c = new int[m];
		for(int i = 0; i < m; i ++){
			c[i] = A[i];
		}
		int size = 0;
		int i = 0, j = 0;
		for(; i < m && j < n;){
			if(c[i] < B[j]){
				A[size] = c[i ++];
			}else{
				A[size] = B[j ++];
			}
			size ++;
		}
		if(i < m){
			for(;i < m; i ++){
				A[size ++] = c[i];
			}
		}
		if(j < n){
			for(;j < n; j ++){
				A[size ++] = B[j];
			}
		}
		
    }
}