Find the median value of two merged arrays

findMedianSortedArrays.py

class Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        # first merge the arrays
        merged = nums1 + nums2
        # sort it inplace
        merged.sort()

        #todo: now we need to find median 
        # find the length 
        merged_len = len(merged)

        if merged_len % 2:
            # if there is a remainder then it is odd
            middle_index_start = int(merged_len/2)
            middle_index_end = int(middle_index_start+1)
            return float(merged[middle_index_start:middle_index_end][0])

        else:
            # remainder will be 0 if even
            middle_index_right = int(merged_len/2)
            middle_index_left = int(middle_index_right-1)
            right_side_num = merged[middle_index_right]
            left_side_num = merged[middle_index_left]
            return float((right_side_num + left_side_num)/2)