Fix

Hardvan · Hardvan · commit 3d362ef612c0 · 2024-10-03T20:30:38.000+05:30
diff --git a/src/main/java/com/thealgorithms/divideandconquer/MedianOfTwoSortedArrays.java b/src/main/java/com/thealgorithms/divideandconquer/MedianOfTwoSortedArrays.java
@@ -34,7 +34,7 @@ public static double findMedianSortedArrays(int[] nums1, int[] nums2) {
             // Check if partition is valid
             if (maxLeft1 <= minRight2 && maxLeft2 <= minRight1) {
                 // If combined array length is odd
-                if ((m + n) % 2 == 1) {
+                if (((m + n) & 1) == 1) {
                     return Math.max(maxLeft1, maxLeft2);
                 }
                 // If combined array length is even

Original file line number	Diff line number	Diff line change
`@@ -34,7 +34,7 @@ public static double findMedianSortedArrays(int[] nums1, int[] nums2) {`
`34`	`34`	`// Check if partition is valid`
`35`	`35`	`if (maxLeft1 <= minRight2 && maxLeft2 <= minRight1) {`
`36`	`36`	`// If combined array length is odd`
`37`		`- if ((m + n) % 2 == 1) {`
	`37`	`+ if (((m + n) & 1) == 1) {`
`38`	`38`	`return Math.max(maxLeft1, maxLeft2);`
`39`	`39`	`}`
`40`	`40`	`// If combined array length is even`