def minCost(n, alist, blist): alist = [0] + alist blist = [0] + blist f = [0] * (n + 1) for i in range(1, n + 1): f[i] = f[i - 1] + alist[i] for i in range(2, n + 1): f[i] = min(f[i], f[i-2] + blist[i - 1] , f[i-1] + alist[i]) time = f[-1] 麻烦问一下这个计算time的哪里出错了， 只过了55%，剩下的提示我数组出错 堆栈溢出什么的。