Median of Two Sorted Arrays LeetCode solution in Python

1
class Solution(object):
2
    def findMedianSortedArrays(self, nums1, nums2):
3
        lis = nums1 + nums2
4
        lis.sort()
5
        hi = len(lis)
6
        print(5 / 2)
7
        if hi % 2 == 0:
8
            if (lis[hi / 2] + lis[hi / 2 - 1]) % 2 == 0:
9
                return (lis[hi / 2] + lis[hi / 2 - 1]) / 2
10
            return (lis[hi / 2] + lis[hi / 2 - 1]) / 2 + 0.5
11
        else:
12
            return lis[hi // 2]