LeetCode: Merge Sorted Array

[b]LeetCode: Merge Sorted Array[/b]

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.

地址：https://oj.leetcode.com/problems/merge-sorted-array/

直接给代码吧：

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