88-Merge Sorted Array
2017-06-23 15:50
316 查看
题目
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.
分析
从后向前比较
实现
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.
分析
从后向前比较
//在当测试用例是 [0],0,[1],1 时，会输出错误的结果········ while(l1>=0&&l2>=0) nums1[l--] = nums1[l1] > nums2[l2] ? nums1[l1--] : nums2[l2--];
实现
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int l = m + n-1, l1 = m-1 , l2 = n-1 ;
while (l2 >= 0)
nums1[l--] = l1 >= 0 && nums1[l1] > nums2[l2] ? nums1[l1--] : nums2[l2--];
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 88 Merge Sorted Array
- leetcode 88 Merge Sorted Array
- 【LeetCode 88 】 Merge Sorted Array
- 88. Merge Sorted Array
- LeetCode 88:Merge Sorted Array
- FTPrep, 88 Merge Sorted Array
- <LeetCode OJ> Merge Sorted Array【88】
- 88. Merge Sorted Array
- [Leetcode 88, Easy] Merge Sorted Array
- LeetCode(88)题解-- Merge Sorted Array
- <LeetCode><Easy> 88 Merge Sorted Array
- leetcode 88:Merge Sorted Array
- 88 Merge Sorted Array
- 88 Merge Sorted Array(归并排序Easy)
- leetcode88：Merge Sorted Array
- LeetCode - 21/23/88 - Merge Sorted Lists/Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- (java)leetcode-88:Merge Sorted Array
- leetcode || 88、Merge Sorted Array