[LeetCode] 054: Merge Sorted Array

[Problem]

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.

[Solution]

class Solution {
public:
void merge(int A[], int m, int B[], int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int i = m-1, j = n-1, k = m+n-1;
while(i >= 0 || j >= 0){
if(i < 0){
A[k--] = B[j--];
}
else if(j < 0){
A[k--] = A[i--];
}
else{
if(A[i] > B[j]){
A[k--] = A[i--];
}
else{
A[k--] = B[j--];
}
}
}
}
};

说明：版权所有，转载请注明出处。Coder007的博客