1、来源:merge-sorted-array 牛客网
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 to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.
2、思路:两个数组从后往前遍历;
3、代码:
public class Solution {
public void merge(int A[], int m, int B[], int n) {
int len = m + n;
int cur = len - 1;
int i = m - 1 , j = n - 1;
while(i >= 0 && j >= 0){
if(B[j] > A[i])
A[cur--] = B[j--];
else
A[cur--] = A[i--];
}
if(j == -1)
return;
while(j >= 0)
A[cur--] = B[j--];
}
}