LeetCode 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 are mand n respectively.

思路：简单题。

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

        if (i < m) 
            for (int k = i; k < m; k++)
                ans[cur++] = A[k];
        if (j < n)
            for (int k = j; k < n; k++)
                ans[cur++] = B[k];

        for (i = 0; i < cur; i++)
            A[i] = ans[i];
    }
}

LeetCode Merge Sorted Array

原文：http://blog.csdn.net/u011345136/article/details/45031531