leetcode-88-Merge Sorted Array
来源:互联网 发布:网络远程教育在哪报名 编辑:程序博客网 时间:2024/05/23 16:47
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 nums1and nums2 are m and n respectively.
Subscribe to see which companies asked this question
合并两个数组。
采用从后向前合并,从而不用频繁的移动元素。
class Solution {public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { if ( n< 1) return ; int k = m + n - 1 ; m --, n -- ; while ( m >= 0 && n >= 0 ) { // or nums1[k--] = nums1[m] > nums2[n] ? nums1[m--]:nums2[n--] ; if ( nums1[m] > nums2[n] ) nums1[k--] = nums1[m--] ; else nums1[k--] = nums2[n--] ; } while( n >= 0 ) nums1[k--] = nums2[n--] ; }};
0 0
- 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
- 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
- java高并发
- 音乐播放器
- Fragment生命周期
- 使用 OpenSSL API 进行安全编程
- SpringAOP动态代理小结
- leetcode-88-Merge Sorted Array
- NSURLConnection的3种请求方式
- python学习1
- android 百度地图画路线(驾车路线)
- 多编程-NSThread
- oracle默认的用户名和密码
- POJ 3415(后缀自动机)
- JAVA设计模式-代理模式
- 78.Evaluate the following query: