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

Update Armstrong Number (#2981)

Browse Source
This commit is contained in:
Vivek
2022-04-10 19:41:05 +05:30
committed by GitHub
parent cca4038008
commit 719e1d8132
4 changed files with 81 additions and 56 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
src/main/java/com/thealgorithms/maths/Armstrong.java
View File

@ -4,18 +4,11 @@ package com.thealgorithms.maths;
* An Armstrong number is equal to the sum of the cubes of its digits. For
* example, 370 is an Armstrong number because 3*3*3 + 7*7*7 + 0*0*0 = 370. An
* Armstrong number is often called Narcissistic number.
*
* @author Vivek
*/
public class Armstrong {
public static void main(String[] args) {
assert (isArmStrong(0));
assert (isArmStrong(1));
assert (isArmStrong(153));
assert (isArmStrong(1634));
assert (isArmStrong(371));
assert (!isArmStrong(200));
}
/**
* Checks whether a given number is an armstrong number or not.
*
@ -23,24 +16,14 @@ public class Armstrong {
* @return {@code true} if given number is armstrong number, {@code false}
* otherwise
*/
private static boolean isArmStrong(int number) {
int sum = 0;
int temp = number;
int numberOfDigits = 0;
while (temp != 0) {
numberOfDigits++;
temp /= 10;
public boolean isArmstrong(int number) {
long sum = 0;
long number2 = number;
while (number2 > 0) {
long mod = number2 % 10;
sum += Math.pow(mod, 3);
number2 /= 10;
}
temp = number;
/* copy number again */
while (number > 0) {
int remainder = number % 10;
int power = 1;
for (int i = 1; i <= numberOfDigits; power *= remainder, ++i)
;
sum = sum + power;
number /= 10;
}
return sum == temp;
return sum == number;
}
}
}