# 题目

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 nrespectively.

ps：下面的解法非常巧妙，我也没想到，是借鉴leet里面某大神的代码。

# 代码

public class Solution {
public void merge(int A[], int m, int B[], int n) {
while (m > 0 && n > 0) {
if (A[m-1] > B[n-1]) {
A[m+n-1] = A[m-1];
m--;
} else {
A[m+n-1] = B[n-1];
n--;
}
}
while (n > 0) {
A[n-1] = B[n-1];
n--;
}
}
}

/********************************

* 本文来自博客  “李博Garvin“

* 转载请标明出处

******************************************/

|
10月前
Leetcode 4. Median of Two Sorted Arrays

28 0
|
10月前
Leetcode Find Minimum in Rotated Sorted Array 题解

37 0
Search in Rotated Sorted Array - 循环有序数组查找问题
Search in Rotated Sorted Array - 循环有序数组查找问题
63 0
LeetCode 167 Two Sum II - Input array is sorted（输入已排序数组，求其中两个数的和等于给定的数）

77 0
|

LeetCode contest 200 5476. 找出数组游戏的赢家 Find the Winner of an Array Game
LeetCode contest 200 5476. 找出数组游戏的赢家 Find the Winner of an Array Game
121 0
|

LeetCode 108. 将有序数组转换为二叉搜索树 Convert Sorted Array to Binary Search Tree
LeetCode 108. 将有序数组转换为二叉搜索树 Convert Sorted Array to Binary Search Tree
117 0
|
1月前
|
Python
【Leetcode刷题Python】剑指 Offer 32 - III. 从上到下打印二叉树 III

38 6
|
1月前
|
Python
【Leetcode刷题Python】剑指 Offer 26. 树的子结构

34 4
|
1月前
|

【Leetcode刷题Python】牛客. 数组中未出现的最小正整数

65 2
|
1月前
|

【Leetcode刷题Python】从列表list中创建一颗二叉树

32 7