LeetCode - Merge Sorted Array
2014-09-17 16:27
204 查看
题意
把两个排好序的数组合并到第一个里。
思路
从后面开始合并,这样不用移动原来数组中的元素。
代码
class Solution {
public:
void merge(int A[], int m, int B[], int n)
{
int i = m - 1, j = n - 1, pos = m + n - 1;
while (1)
{
if (j < 0)
{
while (i >= 0) A[pos--] = A[i--];
break;
}
if (i < 0)
{
while (j >= 0) A[pos--] = B[j--];
break;
}
if (A[i] < B[j]) A[pos--] = B[j--];
else A[pos--] = A[i--];
if (pos < 0) break;
}
}
};
相关文章推荐
- Merge Sorted Array:from LeetCode
- leetcode 088 Merge Sorted Array
- [Leetcode]-Merge Sorted Array
- LeetCode - Merge Sorted Array
- leetcode-88-Merge Sorted Array
- 【leetcode】【88】Merge Sorted Array
- [LeetCode] Merge Sorted Array
- (数组)leetcode 88:Merge Sorted Array
- LeetCode - Merge Sorted Array
- 【LeetCode从零单刷】Merge Sorted Array
- leetcode — merge-sorted-array
- LeetCode88——Merge Sorted Array
- [LeetCode]Merge Sorted Array
- [LeetCode]Merge Sorted Array
- LeetCode——Merge Sorted Array
- 【LeetCode-88】Merge Sorted Array(C++)
- Leetcode: Merge Sorted Array
- Leetcode Merge Sorted Array 关于算法效率的思考
- 【leetcode】Merge Sorted Array
- Leetcode-Merge Sorted Array