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

Add style improvements to Project Euler problem 8 (#3001)

Browse Source
This commit is contained in:
Edward Nuno
2020-10-07 20:51:17 -07:00
committed by GitHub
parent 21581eae3b
commit f3fe29cea1
3 changed files with 28 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
project_euler/problem_08/sol1.py
View File

@ -1,4 +1,6 @@
"""
Problem 8: https://projecteuler.net/problem=8
The four adjacent digits in the 1000-digit number that have the greatest
product are 9 × 9 × 8 × 9 = 5832.
@ -50,21 +52,21 @@ N = """73167176531330624919225119674426574742355349194934\
71636269561882670428252483600823257530420752963450"""
def solution(n):
def solution(n: str = N) -> int:
"""Find the thirteen adjacent digits in the 1000-digit number n that have
the greatest product and returns it.
>>> solution(N)
23514624000
"""
LargestProduct = -sys.maxsize - 1
largest_product = -sys.maxsize - 1
for i in range(len(n) - 12):
product = 1
for j in range(13):
product *= int(n[i + j])
if product > LargestProduct:
LargestProduct = product
return LargestProduct
if product > largest_product:
largest_product = product
return largest_product
if __name__ == "__main__":