From 160742104d3aea0ba28627bfd2b990fcc3277deb Mon Sep 17 00:00:00 2001 From: Godwill Christopher Date: Fri, 24 May 2024 05:08:37 -0600 Subject: [PATCH] Enabled LocalFinalVariableName in Checkstyle (#5172) --- checkstyle.xml | 2 +- src/main/java/com/thealgorithms/maths/DudeneyNumber.java | 6 +++--- src/main/java/com/thealgorithms/sorts/SimpleSort.java | 6 +++--- 3 files changed, 7 insertions(+), 7 deletions(-) diff --git a/checkstyle.xml b/checkstyle.xml index ce584392b..7a91d5210 100644 --- a/checkstyle.xml +++ b/checkstyle.xml @@ -109,7 +109,7 @@ - + diff --git a/src/main/java/com/thealgorithms/maths/DudeneyNumber.java b/src/main/java/com/thealgorithms/maths/DudeneyNumber.java index 88e008cf8..acf1e55d4 100644 --- a/src/main/java/com/thealgorithms/maths/DudeneyNumber.java +++ b/src/main/java/com/thealgorithms/maths/DudeneyNumber.java @@ -16,13 +16,13 @@ public final class DudeneyNumber { throw new IllegalArgumentException("Input must me positive."); } // Calculating Cube Root - final int cube_root = (int) Math.round(Math.pow(n, 1.0 / 3.0)); + final int cubeRoot = (int) Math.round(Math.pow(n, 1.0 / 3.0)); // If the number is not a perfect cube the method returns false. - if (cube_root * cube_root * cube_root != n) { + if (cubeRoot * cubeRoot * cubeRoot != n) { return false; } // If the cube root of the number is not equal to the sum of its digits, we return false. - return cube_root == SumOfDigits.sumOfDigits(n); + return cubeRoot == SumOfDigits.sumOfDigits(n); } } diff --git a/src/main/java/com/thealgorithms/sorts/SimpleSort.java b/src/main/java/com/thealgorithms/sorts/SimpleSort.java index e68b9a87a..7aab7c784 100644 --- a/src/main/java/com/thealgorithms/sorts/SimpleSort.java +++ b/src/main/java/com/thealgorithms/sorts/SimpleSort.java @@ -4,10 +4,10 @@ public class SimpleSort implements SortAlgorithm { @Override public > T[] sort(T[] array) { - final int LENGTH = array.length; + final int length = array.length; - for (int i = 0; i < LENGTH; i++) { - for (int j = i + 1; j < LENGTH; j++) { + for (int i = 0; i < length; i++) { + for (int j = i + 1; j < length; j++) { if (SortUtils.less(array[j], array[i])) { T element = array[j]; array[j] = array[i];