4.18-合并数组

4.18

没毛病

class Solution {
    /**
     * @param A and B: sorted integer array A and B.
     * @return: A new sorted integer array
     */
    public int[] mergeSortedArray(int[] A, int[] B) {
        int aa = A.length;
        if(aa == 0){
            return B;
        }
        int bb = B.length;
        if(bb == 0){// Write your code here
            return A;
        }
        int i = 0;
        int j = 0;
        int flag = 0;
        int[] res = new int[aa+bb];
        while(i < aa && j < bb){
             if(A[i] == B[j]){
                res[flag++] = A[i];
                i++;
                res[flag++] = B[j];
                j++;
            }
            else if(A[i] < B[j]){
                res[flag++] = A[i];
                i++;
            }
            else if(B[j] < A[i]){
                res[flag++] = B[j];
                j++;
            }
        }
        while(j < bb ){
            res[flag++] = B[j];
            j++;
        }
        while(i < aa){
            res[flag ++] = A[i];
            i++;
        }
        return res;
    }
}