题解 | 两个有序数组的中位数

#
# 
# @param A int整型一维数组 
# @param B int整型一维数组 
# @return double浮点型
#
class Solution:
    def findMedianSortedArrays(self , A , B ):
        # write code here
        length_B = len(B)
        length_A = len(A)
        A.sort()
        B.sort()
        if A == []:
            if length_B == 1:
                return B[length_B - 1]
            if length_B % 2 == 0:
                return (B[int(length_B/2)] + B[int(length_B/2 - 1)])/2

            if length_B % 2 != 0:
                return B[int((length_B - 1)/2)]

        if B == []:
            if length_A == 1:
                return A[length_A - 1]
            if length_A % 2 == 0:
                return (A[int(length_A/2)] + A[int(length_A/2 - 1)])/2

            else:
                return A[int((length_A - 1)/2)]
        if A != [] and B != []:
            A.extend(B)
            A.sort()
            length = len(A)
            if length % 2 == 0:
                return (A[int(length/2)] + A[int(length/2 - 1)])/2
            
            else:
                return A[(int(length - 1)/2)]