Easy 19 Merge Sorted Array(88)
来源:互联网 发布:环形网络业务保护方式 编辑:程序博客网 时间:2024/06/05 22:40
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的尾部开始,从后往前,从大往小的插入元素。有点要注意的是临界情况。
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[n]&&m>=0)?nums1[m--]:nums2[n--]; } }};
0 0
- Easy 19 Merge Sorted Array(88)
- Merge Sorted Array(easy)
- [Leetcode 88, Easy] Merge Sorted Array
- <LeetCode><Easy> 88 Merge Sorted Array
- LeetCode-88-Merge Sorted Array(归并)-Easy
- Easy 88题 Merge Sorted Array
- Leetcode OJ 88 Merge Sorted Array [Easy]
- leetcode 88[easy]---Merge Sorted Array
- Leetcode[Easy] - Merge Sorted Array
- 【Easy】88. Merge Sorted Array
- Easy-题目39:88. Merge Sorted Array
- 88. Merge Sorted Array [easy] (Python)
- Leetcode 88. Merge Sorted Array (Easy) (cpp)
- 【leetcode】88. Merge Sorted Array (easy)
- LeetCode-Easy刷题(18) Merge Sorted Array
- [88]Merge Sorted Array
- 88 Merge Sorted Array
- 88 Merge Sorted Array
- iOS开发之ReactiveCocoa下的MVVM
- JavaScript 1.6 语句
- Nginx学习之十四-GDB调试Nginx初试
- Linux copy文件cp的复制、删除和移动命令
- Spring整合Hibernate
- Easy 19 Merge Sorted Array(88)
- URL传参中不能带特殊的字符以及处理方案
- 23个统计数字揭示搜索用户行为
- 计算机图形学(六)多边形裁剪Sutherland-Hodgeman算法讲解与源代码
- unity学习笔记(一)键盘控制物体移动
- jPlayer插件的使用
- Zedboard---实验四驱动7段数码管
- CSDN博客转载方法
- Java--collection与map