【leetcode】merge-sorted-array
2014-08-25 21:48
375 查看
水题,关键是从后向前遍历
//2014年8月25日21:35:09 //从后往前遍历 //2014年8月25日21:45:04 #include <iostream> using namespace std; class Solution { public: void merge(int A[], int m, int B[], int n) { int p = m-1,q = n-1; int i; for(i=m+n-1 ; i>=0 && p>=0 && q>=0 ; i--){ if(A[p] > B[q]){ A[i] = A[p]; p--; } else{ A[i] = B[q]; q--; } } while(q >= 0){ A[i] = B[q]; i--; q--; } } }; int main() { int A[6] = {1,2,3}; int B[3] = {4,5,6}; Solution S; S.merge(A,3,B,3); for(int i=0 ; i<6 ; i++){ cout << A[i] << " "; } cout << endl; return 0; }
相关文章推荐
- [Leetcode] merge sorted array 合并数组
- 【leetcode】Merge Sorted Array
- LeetCode 088 Merge Sorted Array
- leetcode---merge-sorted-array---数组
- Leetcode 88 Merge Sorted Array
- LeetCode: Merge Sorted Array
- LeetCode - Merge Sorted Array
- LeetCode: Merge Sorted Array
- 【leetcode c++】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 --- 归并数组
- 【LeetCode】Merge-sorted-array
- 【leetcode】Merge Sorted Array
- 【leetcode】Merge Sorted Array
- LeetCode|Merge Sorted Array -java