Commit b2de5fc

authored

Update Median of Two Sorted Arrays

1 parent 4075883 commit b2de5fcCopy full SHA for b2de5fc

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`	`使之符合 partitionA + partitionB = (m + n + 1) / 2`
`3`	`3`	`切出 nums1[0 .. partitionA - 1] , nums2[0 .. partitionB - 1] 以及 nums1[partitionA .. m] , nums2[partitionB .. n]`
`4`	`4`	`且 nums1[partitionA - 1] <= nums2[partitionB] and nums2[partitionB - 1] <= nums1[partitionA]`
`5`		`-這樣就代表剛好切到中線上,反之則依照大小關係向左向右推進`
	`5`	`+這樣就代表剛好切到中線上,反之則依照大小關係向左或向右推進`
`6`	`6`
`7`	`7`	`Time Complexity : O( log(min(m , n))) for binary searching on the smaller array`
`8`	`8`	`Space Complexity : O(1) for variables`

Comments

(0)