[LeetCode] Merge Sorted Array
2014-06-19 15:18
295 查看
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 and n respectively.
编程思想:从后往前逆序把大元素依次填到A中合适的位置。
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 and n respectively.
编程思想:从后往前逆序把大元素依次填到A中合适的位置。
class Solution { public: void merge(int A[], int m, int B[], int n) { int newIndex = m+n-1; while(m>0 && n>0){ if(A[m-1]>B[n-1]){ A[newIndex]=A[m-1]; m--; newIndex--; }else{ A[newIndex]=B[n-1]; n--; newIndex--; } }//end while while(m>0){ A[newIndex]=A[m-1]; m--; newIndex--; }//end while while(n>0){ A[newIndex]=B[n-1]; n--; newIndex--; }//end while } };
相关文章推荐
- 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 -java
- [Leetcode] merge sorted array 合并数组
- 【leetcode】Merge Sorted Array
- leetcode:Merge Sorted Array
- LeetCode 088 Merge Sorted Array
- leetcode---merge-sorted-array---数组
- 【Leetcode】Merge Sorted Array
- Leetcode 88 Merge Sorted Array
- LeetCode - Merge Sorted Array
- leetcode 29: Merge Sorted Array
- 【leetcode c++】88 Merge Sorted Array
- 【Leetcode】之Merge Sorted Array
- leetcode: Merge Sorted Array
- LeetCode Merge Sorted Array