leetcode 29: Merge Sorted Array
2013-01-11 07:28
267 查看
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 to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.
Note:
You may assume that A has enough space to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.
class Solution { public: void merge(int A[], int m, int B[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if(n<1) return; int k = m+n-1; int i = m-1; int j = n-1; while( i>=0 && j>=0 ) { A[k--] = A[i] > B[j] ? A[i--] : B[j--]; } while( j>=0 ) A[k--] = B[j--]; } };
相关文章推荐
- [LeetCode29]Merge Sorted Array
- [leetcode]29 Merge Sorted Array
- leetcode 29: Merge Sorted Array
- Merge Sorted Array ---leetcode---AC1
- 【leetcode】Merge Sorted Array(合并两个有序数组到其中一个数组中)
- (数组)leetcode 88:Merge Sorted Array
- LeetCode 088 Merge Sorted Array
- Leetcode 88 Merge Sorted Array
- LeetCode---(88)Merge Sorted Array
- LeetCode--No.88--Merge Sorted Array
- Merge Sorted Array [LEETCODE]
- LeetCode - Merge Sorted Array
- LeetCode – Refresh – 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++ Java Python)
- Merge Sorted Array:from LeetCode
- LeetCode:Merge Sorted Array