[Project Euler] Problem 18 & Problem 67 Python解答

用python來解決的，python就是乾脆利索。代碼少。python編碼還是需要努力啊

import io# read dataf = open("D:\Euler\E18\Test.txt", "r")graph = {}lineno = 0while 1:    data = f.readline()    if not data:        break    else:        linenodes = data.strip().split()        for i in range(0, len(linenodes)):            linenodes[i] = int(linenodes[i])        graph[lineno] = linenodes        lineno = lineno + 1f.close()# find the biggest pathpath = {}for i in range(0, lineno):    path[i] = []    if i == 0:        path[0] = graph[i]        else:        path[i].append(path[i-1][0] + graph[i][0])                for j in range(1, i):            path[i].append(max(path[i-1][j-1], path[i-1][j]) + graph[i][j])        path[i].append(path[i-1][i-1] + graph[i][i])print max(path[lineno-1])

　　

速度還可以，算67題也基本都是三秒以內。