Median of Two Sorted Arrays in O(log(m+n)) Time

bytedance Given two sorted arrays nums1 and nums2 of size m and n respectively, return 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 Input nums1 = [1, 3], nums2 = [2]