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 void merge(int A[], int m, int B[], int n) { // Start typing your Java solution below // DO NOT write main() function int runnerA = m-1; int runnerB = n-1; int runner = m+n-1; while(runnerA>=0 && runnerB>=0){ A[runner] = Math.max(A[runnerA],B[runnerB]); runner--; if(A[runnerA]>=B[runnerB]){ runnerA--; }else{ runnerB--; } } if(runnerB>=0){ for(int i=0;i<=runnerB;i++){ A[i]=B[i]; } } }