algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-26 22:14:08 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
src/main/java/com/thealgorithms/maths/SumOfDigits.java
View File

@ -3,13 +3,17 @@ package com.thealgorithms.maths;
public class SumOfDigits {
public static void main(String[] args) {
assert sumOfDigits(-123) == 6 && sumOfDigitsRecursion(-123) == 6 && sumOfDigitsFast(-123) == 6;
assert sumOfDigits(-123) == 6 &&
sumOfDigitsRecursion(-123) == 6 &&
sumOfDigitsFast(-123) == 6;
assert sumOfDigits(0) == 0 && sumOfDigitsRecursion(0) == 0 && sumOfDigitsFast(0) == 0;
assert sumOfDigits(0) == 0 &&
sumOfDigitsRecursion(0) == 0 &&
sumOfDigitsFast(0) == 0;
assert sumOfDigits(12345) == 15
&& sumOfDigitsRecursion(12345) == 15
&& sumOfDigitsFast(12345) == 15;
assert sumOfDigits(12345) == 15 &&
sumOfDigitsRecursion(12345) == 15 &&
sumOfDigitsFast(12345) == 15;
}
/**
@ -38,7 +42,9 @@ public class SumOfDigits {
public static int sumOfDigitsRecursion(int number) {
number = number < 0 ? -number : number;
/* calculate abs value */
return number < 10 ? number : number % 10 + sumOfDigitsRecursion(number / 10);
return number < 10
? number
: number % 10 + sumOfDigitsRecursion(number / 10);
}
/**