```
class Solution(object):
def findMedianSortedArrays(self, nums1, nums2):
"""
:type nums1: List[int]
:type nums2: List[int]
:rtype: float
"""
merged = nums1+nums2
merged = sorted(merged)
merged_len = len(merged)
half = (merged_len/2)
if merged_len == 0: return 0
if merged_len == 1: return merged[0]
if merged_len == 2: return (float(merged[0])+merged[1])/2
if merged_len >= 3:
if half < (float(merged_len)/2):
return merged[half]
else:
return (merged[half] + float(merged[half-1]))/2
```