mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-30 16:31:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Minimization of while loop in Armstrong Numbers (#9976)

Browse Source 
* Minimization of while loop in Armstrong Numbers

The while loop is removed and simple length calculation is used so the task of minimization of while loop is achieved

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
Dwarkadhish Kamthane 2023-10-16 13:51:03 +05:30 committed by GitHub
parent 96f81770d7
commit 69707bf693
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
maths/armstrong_numbers.py
View File

@ -29,9 +29,7 @@ def armstrong_number(n: int) -> bool:
number_of_digits = 0 number_of_digits = 0
temp = n temp = n
# Calculation of digits of the number # Calculation of digits of the number
while temp > 0: number_of_digits = len(str(n))
number_of_digits += 1
temp //= 10
# Dividing number into separate digits and find Armstrong number # Dividing number into separate digits and find Armstrong number
temp = n temp = n
while temp > 0: while temp > 0: