Median of Two Sorted Arrays -LeetCode

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)

 

”’
Created on Jun 23, 2017

@author: asharda
”’
import numpy as np
x=np.array([1,2])
y=np.array([3,4])
mid=(np.dot(x,y)-1)/2
print “Mid is “,mid

Advertisements

About qainterviews

Software Geek,QA Expert,Blogger
This entry was posted in LeetCode Solutions, Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s