Merge Sorted Array

最新推荐文章于 2024-01-02 23:21:37 发布

原创最新推荐文章于 2024-01-02 23:21:37 发布 · 568 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

113 篇文章

订阅专栏

本文介绍了一种将两个已排序的整数数组B合并到数组A中的方法，确保合并后的数组A仍保持有序状态。该算法通过从两个数组的末尾开始比较并放置较大的元素来实现。同时考虑了数组A有足够的空间容纳B中的所有元素这一前提。

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.

void merge(int A[], int m, int B[], int n) {

	int Aidx   = m-1,Bidx = n-1;
	int Newidx = m+n-1;
	while (Aidx >= 0 && Bidx >= 0)
	{
		if (A[Aidx]>B[Bidx]){
			A[Newidx] = A[Aidx];
			Aidx--;	
		}
		else{
			A[Newidx] =B[Bidx];
			Bidx--;
		}
		Newidx--;
	}
	if (Aidx >= 0){
		for (int i = Aidx;i>=0;--i,--Newidx)
			A[Newidx] = A[i];
	}
	else
	{
		for (int i = Bidx;i>=0;--i,--Newidx)
			A[Newidx] = B[i];
	}
}