[LintCode] Merge Sorted Array
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 |
public void mergeSortedArray(int[] A, int m, int[] B, int n) { // write your code here int i = m - 1; int j = n - 1; int index = m+n - 1; while(i >= 0 && j >= 0) { if(A[i] < B[j]) { A[index] = B[j]; j--; index --; } else{ A[index] = A[i]; i--; index--; } } while(i >= 0){ A[index] = A[i]; i--; index--;; } while(j >= 0) { A[index] = B[j]; j--; index--; } } |
Leave A Comment