4. Median of Two Sorted Arrays(Leetcode) Accepted solution

class Solution:

def findMedianSortedArrays(self,l1,l2):

sorted_new_list = l1 + l2

sorted_new_list.sort()

val = len(sorted_new_list)

if (val % 2 != 0):

return float(sorted_new_list[val //2])

else:

num1 = sorted_new_list[val//2 -1]

num2 = sorted_new_list [val//2]

return (num1 +num2 )/2

a = Solution()

print(a.findMedianSortedArrays([1,2,3,4,5] ,[6,7,8,9]))