Merge Sorted Array -- leetcode
来源：互联网 发布：大数据mobi 编辑：程序博客网 时间：2024/06/15 05:45
Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note:
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m and nrespectively.
从A数组的后面往前填充。省掉数组插入时的移动操作。
class Solution {public: void merge(int A[], int m, int B[], int n) { while (n) { A[m+n-1] = (!m || A[m-1]<B[n-1]) ? B[--n] : A[--m]; } }};代码参考自：
https://leetcode.com/discuss/30859/1-line-solution
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
- 腾讯笔试题
- 直线交点
- jQuery学习后的总结--选择器（二）
- javaScript判断字符串是否包含中文或英文
- apache 配置
- Merge Sorted Array -- leetcode
- 《CTCI》2.2 单项链表中倒数第k个结点
- IE中swfupload上传文件报404或500错误
- 喜羊羊系列之【 tty1 汉化 】
- IOS-ARC下dealloc的作用
- 题目
- 手绘思维导图：第8，9章知识点总结
- PAT B1021 个位数统计
- 微软2016校招笔试 第一场部分题目个人思路
