Leetcode:Merge Sorted Array
2015-01-06 14:14
288 查看
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 mand n respectively.
分析:本题的难点在于是将排序的结果放在数组A中,解决方法是按descending的顺序从后往前遍历A和B。代码如下:
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 mand n respectively.
分析:本题的难点在于是将排序的结果放在数组A中,解决方法是按descending的顺序从后往前遍历A和B。代码如下:
class Solution { public: void merge(int A[], int m, int B[], int n) { int lasta = m-1, lastb = n-1, cur = m+n-1; while(lasta >= 0 && lastb >= 0){ A[cur--] = (A[lasta] >= B[lastb])?A[lasta--]:B[lastb--]; } while(lastb >= 0){ A[cur--] = B[lastb--]; } } };
相关文章推荐
- 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
- [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