[LeetCode]Merge Sorted Array
来源:互联网 发布:服务器机柜和网络机柜 编辑:程序博客网 时间:2024/06/07 22:51
题目:
Merge Sorted Array
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 n respectively.
来源:https://oj.leetcode.com/problems/merge-sorted-array/
思路:
从后往前合,可以避免不断的移动数据,只要一次遍历。
C++ AC代码:
class Solution {public: void merge(int A[], int m, int B[], int n) { int a = m-1, b = n-1, l = m+n-1;while ( a >= 0 && b >=0 ){ if ( A[a] >= B[b] ) A[l--] = A[a--];else A[l--] = B[b--];}while ( b >= 0 ){ A[l--] = B[b--];} }};
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
- asp.net中使用ajax的两种方式
- Java初学札记step by step(一)
- R逻辑回归与CTR预估
- GhostDoc使用与原始注释
- 《Linux设备驱动开发详解》——I2C核心、总线与设备驱动
- [LeetCode]Merge Sorted Array
- 我的CSDN博客世界:欢迎切磋和交流
- HDU 4417 Super Mario
- 【IPV6基础知识】IPV6地址结构
- 1033. To Fill or Not to Fill
- Ubuntu 配置 Tomcat与日常错误解决
- android学习笔记(2.1)--7.20--(5中布局方式+android单位)
- Ubuntu字典app开发(二)——探索与实践
- poj 2240 Arbitrage