88. Merge Sorted Array
2016-03-18 21:16
281 查看
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 nums1and nums2 are m and n respectively.
Subscribe to see which companies asked this question
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 nums1and nums2 are m and n respectively.
Subscribe to see which companies asked this question
public class Solution { public void merge(int A[], int m, int B[], int n) { int i = m - 1; int j = n - 1; int k = m + n - 1; while (k >= 0) { if (j < 0 || (i >= 0 && A[i] > B[j])) A[k--] = A[i--]; else A[k--] = B[j--]; } } }
相关文章推荐
- 通过百度BAE搭建微信二次开发的服务(2)
- JavaScript下拉列表的二级联动
- WebRTC in the real world: STUN, TURN and signaling
- 《经济学》--曼昆
- android window类
- 36. Valid Sudoku
- css中如何给块元素设置自动居中
- PHP任意文件包含绕过截断新姿势
- 160. Intersection of Two Linked Lists
- 111. Minimum Depth of Binary Tree
- POJ1088滑雪
- C++模拟C#事件委托机制(一)
- http协议(2)
- 深入理解Android的RPC方式与AIDL
- 4. 两种数据类型
- Tableciew的基本属性和侧滑(删除 置顶 更多)
- 112. Path Sum
- Leetcode:204. Count Primes(JAVA)
- Android 中拦截 Activity 的启动(拦截系统的 Intent)
- HDU3247 Resource Archiver(AC自动机+BFS+DP)