[LeetCode] Merge Sorted Array
2014-07-04 12:30
381 查看
void merge(int A[], int m, int B[], int n) {
for(int a = m-1; a >= 0; a--)
{
A[a+n] = A[a];
}
int a = n, b = 0, index = 0;
while(index < m+n)
{
if(a < m+n && b < n)
{
if(A[a] < B[b])
{
A[index] = A[a];
a++;
}
else
{
A[index] = B[b];
b++;
}
}
else
{
if(a < m+n)
{
A[index] = A[a];
a++;
}
else
{
A[index] = B[b];
b++;
}
}
index++;
}
}将A数组的所有元素右移n位，再同B做归并排序
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [Leetcode]#88 Merge Sorted Array
- leetcode笔记：Merge Sorted Array
- [LeetCode] Merge Sorted Array
- LeetCode Merge Sorted Array
- LeetCode解题思路之Merge Sorted Array
- Leetcode[Easy] - Merge Sorted Array
- Merge Sorted Array--LeetCode
- 79 leetcode - Merge Sorted Array
- LeetCode（88）Merge Sorted Array
- LeetCode | Merge Sorted Array
- LeetCode : Merge Sorted Array
- LeetCode——Merge Sorted Array
- [LeetCode] Merge Sorted Array
- [C++]LeetCode: 10 Merge Sorted Array
- LeetCode Merge Sorted Array(直接插入排序)
- [leetcode 88] Merge Sorted Array
- Leetcode Merge Sorted Array
- Leetcode - Merge Sorted Array
- 【Leetcode】Merge Sorted Array in JAVA
- LeetCode – Refresh – Merge Sorted Array