算法 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 (size that is greater or equal to m +n) to hold additional elements from B. The number of elements initialized in A and B arem and n respectively.

public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        
        int temp[]=new int[A.length];
        int i=0,j=0,k=0;
        while(i<m&&j<n)
        {
            if(A[i]<B[j])
            {
                temp[k++]=A[i++];
            }
            else
            {
                temp[k++]=B[j++];
            }
        }
        while(i<m)
        {
            temp[k++]=A[i++];
        }
        while(j<n)
        {
            temp[k++]=B[j++];
        }
        i=0;
        for(i=0;i<temp.length;i++)
        {
            A[i]=temp[i];
        }
        
    }
}