Merge Sorted Array
来源：互联网 发布：生意参谋数据导出工具 编辑：程序博客网 时间：2024/06/06 01:33
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.
class Solution { public: void merge(int A[], int m, int B[], int n) {int end = m + n -1;while(m > 0 && n >0){if (A[m-1] >= B[n-1])A[end--] = A[--m];elseA[end--] = B[--n];}if (n > 0)memcpy(A, B, sizeof(int) * n); } }; 0 0
- [Array]Merge Sorted Array
- LeetCode: Merge Sorted Array
- Merge Sorted Array
- [Leetcode] Merge Sorted Array
- Merge Sorted Array
- [LeetCode] Merge Sorted Array
- Merge Sorted Array
- Merge Sorted Array
- [88]Merge Sorted Array
- Merge Sorted Array
- Merge Sorted Array
- [LeetCode]Merge Sorted Array
- Merge Sorted Array
- [leetcode]Merge Sorted Array
- Merge Sorted Array
- [Leetcode]Merge Sorted Array
- Merge Sorted Array
- Merge Sorted Array
- 04 如何将ubuntu环境设置为中文
- android超时问题
- Hadoop fs命令
- Oracle数据库GLOBAL_NAMES参数的详细研究
- sendRedirect() forward() 区别 选择
- Merge Sorted Array
- Convert Sorted List to Binary Search Tree
- 什么时候声明数组可不用初始化便可以使用
- VS2012 + WDK8.0 + Win8调试内核驱动程序(一) .
- 使用npm安装phonegap失败了的看过来（npm国内镜像介绍）
- 文不对题的创业故事——Leo鉴书51
- Linux系统信息查看命令大全
- 第三周作业——冒泡排序和归并排序
- 查看 buffer cache 命中率
