Can someone explain possibly with an example, how we assumed or concluded i=0∼m, j=(m+n+1)/2 − i ?
I got how i+j=m−i+n−j (or: m  i + n  j + 1m−i+n−j+1) part but couldn't get my head around j = (m+n+1)/2 − i.
K
kool
@kool
1
Reputation
12
Posts
152
Profile views
0
Followers
0
Following
Posts made by kool

RE: Median of two sorted arrays

RE: Sum of Count of Different bits
It's actually similar to finding total hamming distance.
https://leetcode.com/problems/totalhammingdistance/#/description