NC22 合并两个有序的数组

排序方法： Arrays.sort()

import java.util.*;
public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        int a = A.length-B.length;
        int b = B.length;
        int k = 0;
        for (int i=a; i 

 方法2：python
 
class Solution:
    def merge(self , A, m, B, n):
        # write code here
        n1=len(A)-len(B)
        n2=len(B)
        k=0
        for i in range(n1,len(A)):
            A[i]=B[k]
            k+=1
        A.sort()