首页 > 代码库 > Merge Sorted Array
Merge Sorted Array
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.
class Solution {
public:
void merge(int A[], int m, int B[], int n) {
int index=m+n-1;
int endA=m-1;
int endB=n-1;
while(index>=0)
{
if(endA==-1 || (endB!=-1 && A[endA]<B[endB]))
{
A[index]=B[endB];
endB--;
}
else
{
if(index!=endA)
A[index]=A[endA];
endA--;
}
index--;
}
}
};
public:
void merge(int A[], int m, int B[], int n) {
int index=m+n-1;
int endA=m-1;
int endB=n-1;
while(index>=0)
{
if(endA==-1 || (endB!=-1 && A[endA]<B[endB]))
{
A[index]=B[endB];
endB--;
}
else
{
if(index!=endA)
A[index]=A[endA];
endA--;
}
index--;
}
}
};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。