chore: Adjust result to be the smallest positive solution in ChineseRemainderTheorem

SuprHUlk · SuprHUlk · commit da99a7385ef2 · 2024-10-16T18:02:33.000+05:30
diff --git a/src/main/java/com/thealgorithms/maths/ChineseRemainderTheorem.java b/src/main/java/com/thealgorithms/maths/ChineseRemainderTheorem.java
@@ -36,8 +36,13 @@ public static int solveCRT(List<Integer> remainders, List<Integer> moduli) {
             result += remainders.get(i) * partialProduct * inverse;
         }
 
-        // The result should be modulo product to find the smallest positive solution
-        return result % product;
+        // Adjust result to be the smallest positive solution
+        result = result % product;
+        if (result < 0) {
+            result += product;
+        }
+
+        return result;
     }
 
     /**

Original file line number	Diff line number	Diff line change
`@@ -36,8 +36,13 @@ public static int solveCRT(List<Integer> remainders, List<Integer> moduli) {`
`36`	`36`	`result += remainders.get(i) * partialProduct * inverse;`
`37`	`37`	`}`
`38`	`38`
`39`		`- // The result should be modulo product to find the smallest positive solution`
`40`		`- return result % product;`
	`39`	`+ // Adjust result to be the smallest positive solution`
	`40`	`+ result = result % product;`
	`41`	`+ if (result < 0) {`
	`42`	`+ result += product;`
	`43`	`+ }`
	`44`	`+`
	`45`	`+ return result;`
`41`	`46`	`}`
`42`	`47`
`43`	`48`	`/**`