'''
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)).

You may assume nums1 and nums2 cannot be both empty.

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
'''
## My solution
class Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        nums = nums1+nums2
        nums.sort()
        num_len = len(nums)
        idx = num_len//2
        if num_len/2 == idx:
            return(nums[idx-1]/2+nums[idx]/2)
        else:
            return(nums[idx])

ef5098fe50d9337cb1362ffb77e46fddd668d784
<mask token>

<mask token>


class Solution:
    <mask token>

<mask token>


class Solution:

    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]
        ) ->float:
        nums = nums1 + nums2
        nums.sort()
        num_len = len(nums)
        idx = num_len // 2
        if num_len / 2 == idx:
            return nums[idx - 1] / 2 + nums[idx] / 2
        else:
            return nums[idx]

'''
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)).

You may assume nums1 and nums2 cannot be both empty.

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
'''
## My solution
class Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        nums = nums1+nums2
        nums.sort()
        num_len = len(nums)
        idx = num_len//2
        if num_len/2 == idx:
            return(nums[idx-1]/2+nums[idx]/2)
        else:
            return(nums[idx])
