Merge remote-tracking branch 'origin/master'

itakurah · itakurah · commit dfc9f3aeba96 · 2023-12-02T19:19:58.000+01:00
diff --git a/src/main/java/com/thealgorithms/conversions/BinaryToHexadecimal.java b/src/main/java/com/thealgorithms/conversions/BinaryToHexadecimal.java
@@ -34,7 +34,7 @@ static String binToHex(int binary) {
             for (i = 0; i < 4; i++) {
                 currbit = binary % 10;
                 binary = binary / 10;
-                code4 += currbit * Math.pow(2, i);
+                code4 += currbit * (int) Math.pow(2, i);
             }
             hex = hm.get(code4) + hex;
         }
diff --git a/src/main/java/com/thealgorithms/greedyalgorithms/FractionalKnapsack.java b/src/main/java/com/thealgorithms/greedyalgorithms/FractionalKnapsack.java
@@ -32,7 +32,7 @@ public static int fractionalKnapsack(int weight[], int value[], int capacity) {
                 current -= weight[index];
             } else {
                 // If only a fraction of the item can fit, add a proportionate value.
-                finalValue += ratio[i][1] * current;
+                finalValue += (int) (ratio[i][1] * current);
                 break; // Stop adding items to the knapsack since it's full.
             }
         }
diff --git a/src/main/java/com/thealgorithms/maths/Armstrong.java b/src/main/java/com/thealgorithms/maths/Armstrong.java
@@ -27,7 +27,7 @@ public boolean isArmstrong(int number) {
 
         while (originalNumber > 0) {
             long digit = originalNumber % 10;
-            sum += Math.pow(digit, power); // The digit raised to the power of the number of digits and added to the sum.
+            sum += (long) Math.pow(digit, power); // The digit raised to the power of the number of digits and added to the sum.
             originalNumber /= 10;
         }
 
diff --git a/src/main/java/com/thealgorithms/maths/HarshadNumber.java b/src/main/java/com/thealgorithms/maths/HarshadNumber.java
@@ -15,7 +15,7 @@ public static boolean isHarshad(long n) {
         if (n <= 0) return false;
 
         long t = n;
-        int sumOfDigits = 0;
+        long sumOfDigits = 0;
         while (t > 0) {
             sumOfDigits += t % 10;
             t /= 10;

Original file line number	Diff line number	Diff line change
`@@ -34,7 +34,7 @@ static String binToHex(int binary) {`
`34`	`34`	`for (i = 0; i < 4; i++) {`
`35`	`35`	`currbit = binary % 10;`
`36`	`36`	`binary = binary / 10;`
`37`		`- code4 += currbit * Math.pow(2, i);`
	`37`	`+ code4 += currbit * (int) Math.pow(2, i);`
`38`	`38`	`}`
`39`	`39`	`hex = hm.get(code4) + hex;`
`40`	`40`	`}`
Original file line number	Diff line number	Diff line change
`@@ -32,7 +32,7 @@ public static int fractionalKnapsack(int weight[], int value[], int capacity) {`
`32`	`32`	`current -= weight[index];`
`33`	`33`	`} else {`
`34`	`34`	`// If only a fraction of the item can fit, add a proportionate value.`
`35`		`- finalValue += ratio[i][1] * current;`
	`35`	`+ finalValue += (int) (ratio[i][1] * current);`
`36`	`36`	`break; // Stop adding items to the knapsack since it's full.`
`37`	`37`	`}`
`38`	`38`	`}`
Original file line number	Diff line number	Diff line change
`@@ -27,7 +27,7 @@ public boolean isArmstrong(int number) {`
`27`	`27`
`28`	`28`	`while (originalNumber > 0) {`
`29`	`29`	`long digit = originalNumber % 10;`
`30`		`- sum += Math.pow(digit, power); // The digit raised to the power of the number of digits and added to the sum.`
	`30`	`+ sum += (long) Math.pow(digit, power); // The digit raised to the power of the number of digits and added to the sum.`
`31`	`31`	`originalNumber /= 10;`
`32`	`32`	`}`
`33`	`33`