Leetcode-88. Merge Sorted Array
2017-03-20 20:09
375 查看
题目
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.合并两个有序的数组nums1和nums2到nums1中。
代码
class Solution { public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { int i = m + n - 1, j = m - 1, k = n - 1; while(j >= 0 && k >= 0) if(nums1[j] < nums2[k]) nums1[i--] = nums2[k--]; else nums1[i--] = nums1[j--]; while(k >= 0) nums1[i--] = nums2[k--]; } };
相关文章推荐
- 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 (Easy) (cpp)
- [leetcode-排序]--88. Merge Sorted Array
- Leetcode题解 88. Merge Sorted Array(todo)
- LeetCode WIith JS || 88. Merge Sorted Array[合并有序数组]
- 【LeetCode】88. Merge Sorted Array
- LeetCode-Easy部分中标签为Two Pointers 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
- LeetCode 88. Merge Sorted Array
- 【Leetcode】88. Merge Sorted Array