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 andn respectively.
public class Solution { public void merge(int A[], int m, int B[], int n) { int i=m-1; int j=n-1; int index = m+n-1; while(i>-1&&j>-1){ if(A[i]>B[j]){ A[index]=A[i]; i--; index--; continue; } if(A[i]<B[j]){ A[index]=B[j]; j--; index--; continue; } if(A[i]==B[j]){ A[index]=B[j]; index--; A[index]=B[j]; j--; i--; index--; continue; } } while(i>-1){ A[index]=A[i]; i--; index--; } while(j>-1){ A[index]=B[j]; j--; index--; } } }
Merge Sorted Array,布布扣,bubuko.com
原文：http://www.cnblogs.com/yixianyixian/p/3690095.html