mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-28 23:15:17 +08:00
Code cleanup (#4246)
This commit is contained in:
@ -8,7 +8,6 @@ public class FactorialTest {
|
||||
|
||||
@Test
|
||||
public void test() {
|
||||
Factorial fact = new Factorial();
|
||||
assertEquals(120, fact.factorial(5));
|
||||
assertEquals(120, Factorial.factorial(5));
|
||||
}
|
||||
}
|
||||
|
@ -10,22 +10,22 @@ class SumOfDigitsTest {
|
||||
|
||||
@Test
|
||||
void testZero() {
|
||||
assertEquals(0, SoD.sumOfDigits(0));
|
||||
assertEquals(0, SoD.sumOfDigitsRecursion(0));
|
||||
assertEquals(0, SoD.sumOfDigitsFast(0));
|
||||
assertEquals(0, SumOfDigits.sumOfDigits(0));
|
||||
assertEquals(0, SumOfDigits.sumOfDigitsRecursion(0));
|
||||
assertEquals(0, SumOfDigits.sumOfDigitsFast(0));
|
||||
}
|
||||
|
||||
@Test
|
||||
void testPositive() {
|
||||
assertEquals(15, SoD.sumOfDigits(12345));
|
||||
assertEquals(15, SoD.sumOfDigitsRecursion(12345));
|
||||
assertEquals(15, SoD.sumOfDigitsFast(12345));
|
||||
assertEquals(15, SumOfDigits.sumOfDigits(12345));
|
||||
assertEquals(15, SumOfDigits.sumOfDigitsRecursion(12345));
|
||||
assertEquals(15, SumOfDigits.sumOfDigitsFast(12345));
|
||||
}
|
||||
|
||||
@Test
|
||||
void testNegative() {
|
||||
assertEquals(6, SoD.sumOfDigits(-123));
|
||||
assertEquals(6, SoD.sumOfDigitsRecursion(-123));
|
||||
assertEquals(6, SoD.sumOfDigitsFast(-123));
|
||||
assertEquals(6, SumOfDigits.sumOfDigits(-123));
|
||||
assertEquals(6, SumOfDigits.sumOfDigitsRecursion(-123));
|
||||
assertEquals(6, SumOfDigits.sumOfDigitsFast(-123));
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user