Problem 8:Largest product in a series

最新推荐文章于 2021-01-12 10:40:34 发布

cfeibiao

最新推荐文章于 2021-01-12 10:40:34 发布

阅读量1k

点赞数

分类专栏： ProjectEuler 文章标签： ProjectEuler Python

本文链接：https://blog.csdn.net/cfeibiao/article/details/9723187

版权

ProjectEuler 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

原题地址：http://projecteuler.net/problem=8

Largest product in a series

Problem 8

Find the greatest product of five consecutive digits in the 1000-digit number.

73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450

大意是：

找出以下这个1000位的整数中连续5个数字的最大乘积。（例如前五个数字的乘积是7*3*1*6*7=882)

解法1：

1.首先是数据的读取：将这20行共1000个数字粘贴到一个文件里，再一行一行读取出来并拼接成一个字符串

2.然后从第1个数字遍历到第996位数字，每次顺序取5个数字并相乘，得出的乘积比当前最大的乘积要大的话，则保存为当前最大的乘积。

python代码如下所示：

f = open('data.txt','r')
text = [line.strip() for line in f.readlines()]
f.close()

#concatenate the strings
data = ''
length = len(text)
for i in range(length):
    data += text[i]
    
#convert to number
length = len(data)
numbers = [int(data[i]) for i in range(length) ]

maxproduct = 0
for i in range(length - 4):
    product = 1
    for j in range(5):
        product *= numbers[i+j]

    if product > maxproduct:
        maxproduct = product

print maxproduct

注：题目的中文翻译源自http://pe.spiritzhang.com