LeetCode-Merge Sorted Array
2014-08-07 22:18
393 查看
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.
Solution:
Code:
<span style="font-size:14px;">class Solution {
public:
void merge(int A[], int m, int B[], int n) {
while (m > 0 && n > 0) {
if (A[m-1] < B[n-1]) {
n--;
A[m+n] = B
;
} else {
m--;
A[m+n] = A[m];
}
}
while (n > 0) {
n--;
A
= B
;
}
}
};</span>
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.
Solution:
Code:
<span style="font-size:14px;">class Solution {
public:
void merge(int A[], int m, int B[], int n) {
while (m > 0 && n > 0) {
if (A[m-1] < B[n-1]) {
n--;
A[m+n] = B
;
} else {
m--;
A[m+n] = A[m];
}
}
while (n > 0) {
n--;
A
= B
;
}
}
};</span>
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode[Array]: Merge Sorted Array
- Leetcode Problem.88 —Merge Sorted Array
- 【leetcode】merge-sorted-array
- leetcode之Merge Sorted Array
- Leetcode: Merge Sorted Array
- [Leetcode]Merge Sorted Array
- leetcode之 Merge Sorted Array
- LeetCode : Merge Sorted Array
- leetcode:Merge Sorted Array 5行代码AC
- leetcode [Merge Sorted Array]
- [leetcode]_Merge Sorted Array
- LeetCode Merge Sorted Array
- [LeetCode-88] Merge Sorted Array（合并有序数组）
- leetcode 刷题之路 37 Merge Sorted Array
- Leetcode 88 Merge Sorted Array 合并两个有序数组
- LeetCode 88 --- Merge Sorted Array
- [LeetCode]Merge Sorted Array
- leetcode:Merge Sorted Array (合并排好序的数组)
- leetcode 88 Merge Sorted Array
- leetcode || 88、Merge Sorted Array