LeetCode-Merge Sorted Array
2015-02-10 03:23
375 查看
两个有序array，A的空间足够大。这种从head开始填充需要移动every element的，都从tail开始，因为已知了大小，已知了结束位置。
public class Solution {
public void merge(int A[], int m, int B[], int n) {
int inA = m - 1;
int inB = n - 1;
int pos = m + n -1;
while ( pos >= 0 ){
if ( inA >= 0 && inB >= 0 ){
if (A[ inA ] > B[ inB ]){
A[ pos ] = A[ inA ];
inA --;
}
else {
A [pos] = B[ inB ];
inB --;
}
}
else if ( inB < 0 ){
A [ pos ] = A[ inA ];
inA --;
}
else {
A [ pos ] = B[ inB ];
inB --;
}
pos --;
}
}
}
public class Solution {
public void merge(int A[], int m, int B[], int n) {
int inA = m - 1;
int inB = n - 1;
int pos = m + n -1;
while ( pos >= 0 ){
if ( inA >= 0 && inB >= 0 ){
if (A[ inA ] > B[ inB ]){
A[ pos ] = A[ inA ];
inA --;
}
else {
A [pos] = B[ inB ];
inB --;
}
}
else if ( inB < 0 ){
A [ pos ] = A[ inA ];
inA --;
}
else {
A [ pos ] = B[ inB ];
inB --;
}
pos --;
}
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 【LeetCode with Python】 Merge Sorted Array
- LeetCode || Merge Sorted Array
- leetcode Merge Sorted Array
- [leetcode] Merge Sorted Array
- Merge Sorted Array ---leetcode---AC1
- [leetcode][array][two pointers] Merge Sorted Array
- [LeetCode]Merge Sorted Array
- LeetCode - Merge Sorted Array
- leetcode-Merge Sorted Array
- [LeetCode]题解（python）：088-Merge Sorted Array
- 【Leetcode】【Easy】Merge Sorted Array
- LeetCode小白菜笔记[21]：Merge Sorted Array
- [leetcode] Merge Sorted Array
- 【LeetCode】-Merge Sorted Array
- leetcode 之 Merge Sorted Array
- LeetCode编程练习 - Merge Sorted Array学习心得
- LeetCode--No.88--Merge Sorted Array
- 【Leetcode】 Merge Sorted Array
- leetcode第88题-Merge Sorted Array
- [Leetcode] Merge Sorted Array