leetcode | Merge Sorted Array
来源:互联网 发布:hadoop元数据是什么 编辑:程序博客网 时间:2024/06/08 05:53
Merge Sorted Array
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
将两个数组合并到其中一个数组中,从后往前遍历。
将两个数组合并到另一个缓存数组中,一般从前向后遍历
//时间复杂度O(m+n), 空间复杂度O(1)void merge(int* nums1, int m, int* nums2, int n) { int i = m-1, j = n-1, k = m+n-1; while (j >= 0) { if (i >= 0) nums1[k--] = (nums1[i] > nums2[j]) ? nums1[i--] : nums2[j--]; else nums1[k--] = nums2[j--]; } return;}
0 0
- LeetCode: Merge Sorted Array
- [Leetcode] Merge Sorted Array
- [LeetCode] Merge Sorted Array
- [LeetCode]Merge Sorted Array
- [leetcode]Merge Sorted Array
- [Leetcode]Merge Sorted Array
- LeetCode-Merge Sorted Array
- [leetcode] Merge Sorted Array
- LeetCode - Merge Sorted Array
- [LeetCode] Merge Sorted Array
- LeetCode | Merge Sorted Array
- 【leetcode】Merge Sorted Array
- Leetcode: Merge Sorted Array
- Leetcode: Merge Sorted Array
- LeetCode - Merge Sorted Array
- [LeetCode]Merge Sorted Array
- Merge Sorted Array -- LeetCode
- Merge Sorted Array - LeetCode
- MySQL增加Sequence管理功能
- 火爆的股票配资有这三方面风险
- 分页性能探索-mysql
- 08_Java基础_内部类_静态导入_增强for循环
- 交叉编译GDB
- leetcode | Merge Sorted Array
- sap 提交后台作业
- java网络编程Socket学习(一)
- android文件保存到sd卡和内存
- 批处理快速设置android开发环境
- Uip + Stm32移植问题总结
- WBS、控制账户、管理控制点、账户编码、OBS、RBS
- ORACLE 创建作业JOB例子
- python 百度地图信息采集实例(包含经纬度)