python中的数字子集的产品

-3

我正在经历项目euler，而且我在这个问题上陷入困境。python中的数字子集的产品

我打算用评论发布我的代码，所以每个人都可以按照我的想法看看我出错的地方。所有的建议表示赞赏:)

# need to find the largest product in a series 

import time # brings time into the code 

start = time.time() # creates a start time for the code 

list = [] # where I'm going to store the multipules 

# the '\ takes the grid and converts it into one long number' 

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

i = 0 # start of the ticker 

for i in range(0, 1000, 1): # the length of the large block of numbers is 1000 

    hold_num = int(num[i])*int(num[i+1])*int(num[i+2]) # im creating a number of every three consecutive numbers ... this is the subset 
    list.append(hold_num) # storing the products in a list 
    i =+ 1 

print max(list) # finding the max of the products in the stored list

我最终得到这个错误：

Traceback (most recent call last): 
    File "/Users/robertdefilippi/Documents/Python/Euler/8eu.py", line 37, in <module> 
    hold_num = int(num[i])*int(num[i+1])*int(num[i+2]) 
IndexError: string index out of range 
[Finished in 0.0s with exit code 1]

任何建议什么我做错了吗？

来源

2014-10-28 Chef1075

'num [i + 2]'when I is 1000 is the problem.loop until 998. – vks 2014-10-28 14:28:33

考虑使用zip（num，num [1：]，num [2：]）'得到所有的列表3元组而不用担心最终的特殊问题。试着用'num = range（10）'来看看它做了什么。 – Alfe 2014-10-28 14:44:54

当你在做for i in range(0, 1000, 1)时，达到999，num[i+1]和num[i+2]将超出范围。您必须改用range(0,998,1)。其中可缩写为range(998)。这样做，i将递增并从0开始。您不需要执行i+=1或i=0。

来源

2014-10-28 14:30:57 fredtantini

使用'998'不是一种好的风格;编程时不要计算，让计算机为你做。事实上，你的方式是一个隐藏的代码加倍，因为998直接来自1000和3（以及偏移效果）。因此，如果代码被改为不支持3而是6，那么您必须将998调整为995，并且可能会被遗忘。 – Alfe 2014-10-28 14:48:00

python中的数字子集的产品

回答

相关问题