Merge Sorted Array-LeetCode
2014-11-02 17:41
323 查看
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.
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.
class Solution { public: void merge(int A[], int m, int B[], int n) { if (m == 0) for (int i = 0; i < n; i++) A[i] = B[i]; else { int count = n + m - 1; int i = m - 1, j = n - 1; int x; for (x = count; x >= 0 && j >= 0 && i >=0; x-- ) { if (B[j] >= A[i]) A[x] = B[j--]; else A[x] = A[i--]; } if (i < 0) while(j >= 0) A[x--] = B[j--]; } } };
相关文章推荐
- 【LeetCode with Python】 Merge Sorted Array
- LeetCode || Merge Sorted Array
- leetcode Merge Sorted Array
- [leetcode] Merge Sorted Array
- [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[89] 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
- leetcode merge-sorted-array