Easy 19 Merge Sorted Array(88)
2017-04-21 11:02
337 查看
Description
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.
Solution
从nums1的尾部开始,从后往前,从大往小的插入元素。有点要注意的是临界情况。
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.
Solution
从nums1的尾部开始,从后往前,从大往小的插入元素。有点要注意的是临界情况。
class Solution { public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { int len=m+n-1; n--; m--; while(n>=0){ nums1[len--]=(nums1[m]>nums2 &&m>=0)?nums1[m--]:nums2[n--]; } } };
相关文章推荐
- LeetCode-88-Merge Sorted Array(归并)-Easy
- Easy 88题 Merge Sorted Array
- [Leetcode 88, Easy] Merge Sorted Array
- 88/19 Merge Sorted Array/Remove Nth Node From End of List(指针运算)
- Leetcode OJ 88 Merge Sorted Array [Easy]
- LeetCode 88 Merge Sorted Array(合并排序数组)(*)
- Leetcode 88 Merge Sorted Array
- 88-Merge Sorted Array
- LeetCode(88)Merge Sorted Array
- 88 Merge Sorted Array
- 【LEETCODE】88-Merge Sorted Array
- 【LeetCode 88_数组】Merge Sorted Array
- [leedcode 88] Merge Sorted Array
- [C语言][LeetCode][88]Merge Sorted Array
- LeetCode(88)Merge Sorted Array
- 88. Merge Sorted Array
- 88. Merge Sorted Array
- LeetCode 88 — Merge Sorted Array(C++ Java Python)
- Leetcode-88 Merge Sorted Array
- 88. Merge Sorted Array (合并有序数组)