Merge Sorted Array

Merge Sorted Array

  Total Accepted: 6782  Total Submissions: 21148 My Submissions

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 static void merge2(int[] A, int m, int[] B, int n) {
        int i = m + n - 1;
        m--;n--;
        while (m >= 0 && n >= 0) A[i--] = A[m] > B[n] ? A[m--] : B[n--];
        while (n >= 0) A[i--] = B[n--];
    }

或者：

public static void merge(int[] A, int m, int[] B, int n) {
        System.arraycopy(A, 0, A, n, m);
        int a = n, b = 0, i = 0;
        while (a < m + n && b < n) A[i++] = A[a] <= B[b] ? A[a++] : B[b++];
        while (b < n) A[i++] = B[b++];
    }