Skip to content

Commit 28bb13b

Browse files
committed
refactor(maths): use direct iteration instead of index-based loops in persistence.py
Replace for i in range(len(numbers)) with for number in numbers in both multiplicative_persistence() and additive_persistence(). Direct iteration is more Pythonic and avoids unnecessary index lookups.
1 parent 791deb4 commit 28bb13b

1 file changed

Lines changed: 4 additions & 4 deletions

File tree

maths/persistence.py

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -28,8 +28,8 @@ def multiplicative_persistence(num: int) -> int:
2828
numbers = [int(i) for i in num_string]
2929

3030
total = 1
31-
for i in range(len(numbers)):
32-
total *= numbers[i]
31+
for number in numbers:
32+
total *= number
3333

3434
num_string = str(total)
3535

@@ -67,8 +67,8 @@ def additive_persistence(num: int) -> int:
6767
numbers = [int(i) for i in num_string]
6868

6969
total = 0
70-
for i in range(len(numbers)):
71-
total += numbers[i]
70+
for number in numbers:
71+
total += number
7272

7373
num_string = str(total)
7474

0 commit comments

Comments
 (0)