human
Write me a Python program to find the median of the two sorted arrays given the following:
I found an interesting problem on https://leetcode.com/problems/median-of-two-sorted-arrays/:
There are two sorted arrays nums1 and nums2 of size m and n respectively.

Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

Example 1:

nums1 = [1, 3]
nums2 = [2]

The median is 2.0


Example 2:

nums1 = [1, 2]
nums2 = [3, 4]

The median is (2 + 3)/2 = 2.5

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is Python program to find the median of the two sorted arrays.

class Solution:
     def findMedianSortedArrays(self, nums1, nums2):
         """
         :type nums1: List[int]
         :type nums2: List[int]
         :rtype: float
         """
         nums = sorted(nums1 + nums2)
         n = len(nums)
         return nums[int(n/2)] if n%2==1 else (nums[int(n/2)]+nums[int(n/2)-1])/2.0