wayetan

12/27/2013 - 11:21 AM

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.
*/
public class Solution{
public void merge(int A[], int m, int B[], int n) {
while( n > 0){
// the original A has all merged into the new A, and merge the left B
if(m <= 0 || A[m - 1] < B[n - 1])
A[n + m - 1] = B[--n];
else
A[n + m - 1] = A[--m];
}
}
}
```