LintCode——合并排序数组II

描述：合并两个排序的整数数组A和B变成一个新的数组

样例：给出A=[1,2,3,4]，B=[2,4,5,6]，返回 [1,2,2,3,4,4,5,6]

1、Python:先将数组B加到数组A之后，然后对新数组进行排序

 1 class Solution:
 2     """
 3     @param A: sorted integer array A
 4     @param B: sorted integer array B
 5     @return: A new sorted integer array
 6     """
 7     def mergeSortedArray(self, A, B):
 8         # write your code here
 9         C = A + B
10         C.sort()
11         return C

2、Java

 1 public class Solution {
 2     /**
 3      * @param A: sorted integer array A
 4      * @param B: sorted integer array B
 5      * @return: A new sorted integer array
 6      */
 7     public int[] mergeSortedArray(int[] A, int[] B) {
 8         // write your code here
 9         int Size_A = A.length;
10         int Size_B = B.length;
11         int[] result = new int[Size_A + Size_B];
12         int i = 0,j = 0,k = 0;
13         while(i < Size_A && j < Size_B){
14             if(A[i] <= B[j]){
15                 result[k++] = A[i++];
16             }
17             else{
18                 result[k++] = B[j++];
19             }
20         }
21         while(i < Size_A){
22             result[k++] = A[i++];
23         }
24         while(j < Size_B){
25             result[k++] = B[j++];
26         }
27         return result;
28     }
29 }

转载于:https://www.cnblogs.com/wangcj2015/p/9112130.html