I think this question is too easy. I wrote it in 5 mins. So, I think the difficulty of it may be easy, not Hard.
The difficulty of this question

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