update solution 0004 [java], fix bug, exchange i and j

lightfish-zhang · lightfish-zhang · commit 71e008ce2e0a · 2019-03-21T18:04:36.000+08:00
diff --git a/solution/0004.Median of Two Sorted Arrays/Solution.java b/solution/0004.Median of Two Sorted Arrays/Solution.java
@@ -33,7 +33,7 @@ public double findMedianSortedArrays(int[] nums1, int[] nums2) {
                     return maxLeft;
                 }
 
-                int minRight = i == len1 ? nums2[j] : j == len2 ? nums1[i] : Math.min(nums2[i], nums1[j]);
+                int minRight = i == len1 ? nums2[j] : j == len2 ? nums1[i] : Math.min(nums2[j], nums1[i]);
 
                 return (maxLeft + minRight) / 2.0;
 

Original file line number	Diff line number	Diff line change
`@@ -33,7 +33,7 @@ public double findMedianSortedArrays(int[] nums1, int[] nums2) {`
`33`	`33`	`return maxLeft;`
`34`	`34`	`}`
`35`	`35`
`36`		`- int minRight = i == len1 ? nums2[j] : j == len2 ? nums1[i] : Math.min(nums2[i], nums1[j]);`
	`36`	`+ int minRight = i == len1 ? nums2[j] : j == len2 ? nums1[i] : Math.min(nums2[j], nums1[i]);`
`37`	`37`
`38`	`38`	`return (maxLeft + minRight) / 2.0;`
`39`	`39`