lintcode_64. Merging sorted arrays II

Merges two sorted integer arrays A and b into a new array.

You can assume that a has enough space (the size of a array is greater than or equal to m+n) to add the elements in B.

Sample Example

Give a = [1, 2, 3, empty, empty] , B =[4, 5]

After merging A will become[1,2,3,4,5]

class Solution:     """     @param: A: sorted integer array A which have m elements, but the size of A is M+n    @param: M: an integer    @param : b:sorted integer array B which have n elements    @param: N: An integer    @return:    Nothing"" "
   def  Mergesortedarray (self, A, M, B, N):        #  Write your code here        A[m:m+n] = b[:n]        a[:m+n] = sorted (A[:m+n])

If write a = sorted (A[:m+n]) will be reported wrong answer, the function directly to a assignment does not change the value in the A array

lintcode_64. Merging sorted arrays II