[LeetCode][python3]0004. Median of Two Sorted Arrays

  1. My first solution
class Solution:
def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
return median(nums1+nums2)
N2I -2020.03.15
N2I -2020.03.15

--

--

--

HI I’m N2I. Now a SWE in Taiwan. Check out more about me in https://nzi2020.blogspot.com/ or contact via email: nayzi9999@gmail.com

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Python: data storing, SQL vs NoSQL

5 years of DevFest Countdown — Part 1

Computer Graphics and Why should you care.

Clone of GoodReads

front page of bookreads

Infrastructure and Ops Book Bundle by O’Reilly

Monday — Week Eleven

Flutter BloC pattern + new Provider + test + persistent datastore

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
N2I

N2I

HI I’m N2I. Now a SWE in Taiwan. Check out more about me in https://nzi2020.blogspot.com/ or contact via email: nayzi9999@gmail.com

More from Medium

You can shortcut 90% of Data Structures and Algorithms courses by learning about Big O notation

[LeetCode]#2053. Kth Distinct String in an Array

Python collections useful tips

My Calendar I