Leetcode: Merge Sorted Array
来源：互联网 发布：淘宝联名信用卡怎么用 编辑：程序博客网 时间：2024/06/14 04:15
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.
public class Solution { public void merge(int A[], int m, int B[], int n) { int index = m + n; while (m > 0 && n > 0) { if (A[m - 1] > B[n - 1]) { A[--index] = A[--m]; } else { A[--index] = B[--n]; } } while (m > 0) { A[--index] = A[--m]; } while (n > 0) { A[--index] = B[--n]; } }} 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
- 会计法开始减肥可适当分开
- Ubuntu系统下如何在不重启的情况下修改hostname
- 代码面试题：Find two smallest number of an array
- poj 1953 Team Rankings
- 软件开发流程（转载）
- Leetcode: Merge Sorted Array
- 工作日报http://www.cnblogs.com/suyang/archive/2008/05/18/1201990.html
- 代码面试题：Find the first element in a given string A that also appears in another given string B
- Combinations
- osg入门系列7- 一个小房子
- SonarQube4.4+Jenkins进行代码检查实例之三-单元测试分析
- POJ3518_Prime Gap【素数】【水题】
- 服务端JS研究
- Node.js Async Tutorial
