88. Merge Sorted Array
2017-01-08 00:50
232 查看
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.
解题思路:
从后往前比较。
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.
解题思路:
从后往前比较。
class Solution { public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { int i = m - 1; int j = n - 1; int k = m + n - 1; while (k >= 0 && i >= 0 && j >= 0) { if (nums1[i] > nums2[j]) nums1[k--] = nums1[i--]; else nums1[k--] = nums2[j--]; } while (i >= 0) nums1[k--] = nums1[i--]; while (j >= 0) nums1[k--] = nums2[j--]; } };
相关文章推荐
- LeetCode - 21/23/88 - Merge Sorted Lists/Array
- LeetCode88 Merge Sorted Array 解题报告
- 88. Merge Sorted Array
- (java)leetcode-88:Merge Sorted Array
- leetcode || 88、Merge Sorted Array
- Leetcode[88]-Merge Sorted Array
- 88. Merge Sorted Array LeetCode
- leetcode88:Merge Sorted Array
- 88. Merge Sorted Array
- 88 Merge Sorted Array
- 88. Merge Sorted Array
- LeetCode---(88)Merge Sorted Array
- Lettcode_88_Merge Sorted Array ——“正难则反”的思想
- LeetCode@Array_88_MergeSortedArray
- 88/19 Merge Sorted Array/Remove Nth Node From End of List(指针运算)
- LeetCode(88) Merge Sorted Array
- leetcode88~Merge Sorted Array
- 88. Merge Sorted Array
- 88 Merge Sorted Array
- leetcode[88]:Merge Sorted Array