Commit 48020d2

committed

fix bug in solution 0004

Math.min(nums2[i], nums1[j]) -> Math.min(nums2[j], nums1[i])

1 parent 7e600d7 commit 48020d2Copy full SHA for 48020d2

File tree

-4

lines changed

-4

lines changed

Lines changed: 2 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -55,7 +55,6 @@ class Solution {`
`55`	`55`	`int len1 = nums1.length;`
`56`	`56`	`int len2 = nums2.length;`
`57`	`57`
`58`		`- // 确保 len1 不大于 len2`
`59`	`58`	`if (len1 > len2) {`
`60`	`59`	`int[] tmp = nums1;`
`61`	`60`	`nums1 = nums2;`
`@@ -69,10 +68,9 @@ class Solution {`
`69`	`68`	`int max = len1;`
`70`	`69`
`71`	`70`	`int m = (len1 + len2 + 1) / 2;`
`72`		`-`
	`71`	`+`
`73`	`72`	`while (min <= max) {`
`74`	`73`	`int i = (min + max) / 2;`
`75`		`-`
`76`	`74`	`int j = m - i;`
`77`	`75`
`78`	`76`	`if (i > min && nums1[i - 1] > nums2[j]) {`
`@@ -87,7 +85,7 @@ class Solution {`
`87`	`85`	`return maxLeft;`
`88`	`86`	`}`
`89`	`87`
`90`		`- int minRight = i == len1 ? nums2[j] : j == len2 ? nums1[i] : Math.min(nums2[i], nums1[j]);`
	`88`	`+ int minRight = i == len1 ? nums2[j] : j == len2 ? nums1[i] : Math.min(nums2[j], nums1[i]);`
`91`	`89`
`92`	`90`	`return (maxLeft + minRight) / 2.0;`
`93`	`91`

Comments

(0)