LeetCode 88. Merge Sorted Array
2016-11-07 12:53
399 查看
描述
合并两个已经排序了的数组解决
从后往前遍历class Solution { public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { int last_pos = m + n - 1; int nums1_pos = m - 1, nums2_pos = n - 1; while (nums1_pos >= 0 && nums2_pos >= 0) { if (nums1[nums1_pos] >= nums2[nums2_pos]) { nums1[last_pos--] = nums1[nums1_pos--]; } else { nums1[last_pos--] = nums2[nums2_pos--]; } } while (nums2_pos >= 0) { nums1[last_pos--] = nums2[nums2_pos--]; } } };
相关文章推荐
- leetcode_88. Merge Sorted Array 合并两个排好序的数组,尾插法,从尾数开始合并
- LeetCode||88. Merge Sorted Array
- 【leetcode】88. Merge Sorted Array (easy)
- LeetCode 88. Merge Sorted Array
- Leetcode 88. Merge Sorted Array 合并已排序数组
- LeetCode 88. Merge Sorted Array
- 【LeetCode】88. Merge Sorted Array
- 【LeetCode】88. Merge Sorted Array
- LeetCode 88. Merge Sorted Array(合并有序数组)
- 【LeetCode题解】88. Merge Sorted Array
- Leetcode: 88. Merge Sorted Array
- leetcode: 88. Merge Sorted Array
- LeetCode88. Merge Sorted Array-python(easy)
- [LeetCode] 88. Merge Sorted Array
- leetcode --88. Merge Sorted Array
- [leetcode]88. Merge Sorted Array
- [leetcode]#88. Merge Sorted Array
- LeetCode-Array-88. Merge Sorted Array
- leetcode 88. Merge Sorted Array
- Leetcode - 88. Merge Sorted Array