LintCode6. 合并排序数组

public class Solution {    /*     * @param A: sorted integer array A     * @param B: sorted integer array B     * @return: A new sorted integer array     */    public int[] mergeSortedArray(int[] A, int[] B) {        // write your code here        if(A==null){            return B;        }        if(B==null){            return A;        }        int[] result = new int[A.length+B.length];        int i = 0,j = 0,z=0;        while(i<A.length&&j<B.length){            if(A[i]<=B[j]){             result[z++]=A[i++];            }            else if(A[i]>=B[j]){             result[z++]=B[j++];            }        }        for(;i<A.length;i++){            result[z++] = A[i];        }        for(;j<B.length;j++){            result[z++] = B[j];        }        return result;    }}