FilesExpand file tree

master

/

004.两个排序数组的中位数.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

10 lines (10 loc) · 335 Bytes

master

/

004.两个排序数组的中位数.py

Copy path

Top

File metadata and controls

• Code
• Blame

10 lines (10 loc) · 335 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

# 将两个数组相加、排序，再算中位数

class Solution(object):

def findMedianSortedArrays(self, nums1, nums2):

nums = nums1 + nums2

nums.sort()

length = len(nums)

if length%2 == 0:

return (nums[length/2-1] + nums[length/2])/2.0

else:

return nums[length/2]