Skip to content

Commit 9dc4cb2

Browse files
authored
Create Solution.py
1 parent 354dec2 commit 9dc4cb2

1 file changed

Lines changed: 9 additions & 0 deletions

File tree

  • Leetcode_Solutions/Median of Two sorted arrays
Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
class Solution:
2+
def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
3+
import math
4+
nums3 = nums1+nums2
5+
nums3.sort()
6+
if (len(nums3)%2==1):
7+
return nums3[math.floor(len(nums3)/2)]
8+
else:
9+
return ((nums3[math.floor(len(nums3)/2)]+nums3[math.floor(len(nums3)/2)-1])/2)

0 commit comments

Comments
 (0)