FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java/Maths/SumOfDigits.java at master · coder2hacker/Java · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
coder2hacker
/
Java
Public
forked from
TheAlgorithms/Java
Notifications
You must be signed in to change notification settings
Fork
0
Star
2
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Java
/
Maths
/
SumOfDigits.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
56 lines (50 loc) · 1.61 KB
Breadcrumbs
Java
/
Maths
/
SumOfDigits.java
Copy path
File metadata and controls
56 lines (50 loc) · 1.61 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
package
Maths
;
public
class
SumOfDigits
{
public
static
void
main
(
String
[]
args
) {
assert
sumOfDigits
(-
123
) ==
6
&&
sumOfDigitsRecursion
(-
123
) ==
6
&&
sumOfDigitsFast
(-
123
) ==
6
;
assert
sumOfDigits
(
0
) ==
0
&&
sumOfDigitsRecursion
(
0
) ==
0
&&
sumOfDigitsFast
(
0
) ==
0
;
assert
sumOfDigits
(
12345
) ==
15
&&
sumOfDigitsRecursion
(
12345
) ==
15
&&
sumOfDigitsFast
(
12345
) ==
15
;
}
/**
* Calculate the sum of digits of a number
*
* @param number the number contains digits
* @return sum of digits of given {@code number}
*/
public
static
int
sumOfDigits
(
int
number
) {
number
=
number
<
0
? -
number
:
number
;
/* calculate abs value */
int
sum
=
0
;
while
(
number
!=
0
) {
sum
+=
number
%
10
;
number
/=
10
;
}
return
sum
;
}
/**
* Calculate the sum of digits of a number using recursion
*
* @param number the number contains digits
* @return sum of digits of given {@code number}
*/
public
static
int
sumOfDigitsRecursion
(
int
number
) {
number
=
number
<
0
? -
number
:
number
;
/* calculate abs value */
return
number
<
10
?
number
:
number
%
10
+
sumOfDigitsRecursion
(
number
/
10
);
}
/**
* Calculate the sum of digits of a number using char array
*
* @param number the number contains digits
* @return sum of digits of given {@code number}
*/
public
static
int
sumOfDigitsFast
(
int
number
) {
number
=
number
<
0
? -
number
:
number
;
/* calculate abs value */
char
[]
digits
= (
number
+
""
).
toCharArray
();
int
sum
=
0
;
for
(
int
i
=
0
;
i
<
digits
.
length
; ++
i
) {
sum
+=
digits
[
i
] -
'0'
;
}
return
sum
;
}
}
Back
|
FazBrowse Home
|
New Git URL