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 and n respectively.

 

1 public class Solution { 2     public void merge(int A[], int m, int B[], int n) { 3         int[] newA=new int[m+n]; 4         int indexA = 0,indexB=0; 5         int i=0; 6         while (indexA