Leetcode[Easy] - Merge Sorted Array

来源：互联网发布：飞机杯品牌知乎编辑：程序博客网时间：2024/06/07 13:09

public class Solution {
public void merge(int A[], int m, int B[], int n) {
int currentA = m-1; int currentB = n-1; int k = m+n-1;
while(currentA >= 0 && currentB >= 0)
A[k--] = A[currentA]>B[currentB] ? A[currentA --] : B[currentB--];

while(currentB >=0 || currentA >=0 )
A[k--] = currentA < 0 ? B[currentB--]:A[currentA--];
}

}

------

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 mand n respectively.

0 0

Leetcode[Easy] - Merge Sorted Array
[Leetcode 88, Easy] Merge Sorted Array
<LeetCode><Easy> 88 Merge Sorted Array
LeetCode-88-Merge Sorted Array(归并)-Easy
Leetcode 88. Merge Sorted Array (Easy) (cpp)
Leetcode OJ 88 Merge Sorted Array [Easy]
【leetcode】88. Merge Sorted Array (easy)
LeetCode-Easy刷题(18) Merge Sorted Array
leetcode 88[easy]---Merge Sorted Array
【LeetCode】88.Merge Sorted Array(easy)解题报告
Merge Sorted Array（easy）
【Easy】88. 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
java int与integer的区别
leetcode 153: Find Minimum in Rotated Sorted Array
Unity如何组建复合碰撞器(Compound Colliders)
新浪微博数据挖掘食谱之三：搜索篇 (selenium)
【干货】免费获得WebStorm软件
Leetcode[Easy] - Merge Sorted Array
145 李長坤琴軒
Java：Cookie实现记住用户名、密码
146 李延慶灘叟版築屠狗之賢
ubuntu 图标
CSDN 2014博客之星
大型网站架构演变和知识体系
vicoapp使用备忘
《LoadRunner 没有告诉你的》之一——描述性统计与性能结果分析