(python)leetcode刷题笔记04 Median of Two Sorted Arrays

4. Median of Two Sorted Arrays

There are two sorted arrays nums1 and nums2 of size m and n respectively.

Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

Example 1:

     nums1 = [, ]

     nums2 = []

     The median is 2.0

Example 2:

     nums1 = [, ]

     nums2 = [, ]

     The median is ( + )/ = 2.5

 class Solution:

     def findMedianSortedArrays(self, nums1, nums2):

         """

         :type nums1: List[int]

         :type nums2: List[int]

         :rtype: float

         """

         nums1.extend(nums2)

         nums1.sort()

         len1=len(nums1)

         if len1:

             if len1%==:

                 return (nums1[len1//2]+nums1[len1//2-1])/2

             else:

                 return nums1[len1//2]

Code

 def main(nums1,nums2):

     nums1.extend(nums2)

     nums1.sort()

     len1=len(nums1)

     if len1:

         if len1%==:

             return (nums1[len1//2]+nums1[len1//2-1])/2

         else:

             return nums1[len1//2]

     # print(l1)

 if __name__ == '__main__':

     l1=[,]

     l2=[]

     print(main(l1,l2))

调试代码

巴特西

(python)leetcode刷题笔记04 Median of Two Sorted Arrays

4. Median of Two Sorted Arrays

Example 1:

Example 2:

最新文章

热门文章