LeetCode Merge Sorted Array

标签：io   ar   java   for   sp   strong   on   cti   ad   

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 m and n respectively.

水题，直接把B中元素加入A中，再排序即可。

利用Arrays.sort(array)进行快速排列。

import java.util.Arrays;
public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        for(int i=m,j=0;j<n;i++,j++)
            A[i]=B[j];
        Arrays.sort(A);
    }
}

LeetCode Merge Sorted Array

标签：io   ar   java   for   sp   strong   on   cti   ad   

原文地址：http://blog.csdn.net/zhuangjingyang/article/details/40584429