解题思路:
注意事项:
参考代码:
def getNum():
arr = []
line = int(input())
for i in range(line):
s = list(map(int,input().split()))
arr.append(s)
newArr = [[arr[0][0]]]
for i in range(1,len(arr)):
s = []
for j in range(len(arr[i])):
if j == 0:
maxSum = newArr[i - 1][j] + arr[i][j]
elif j == len(arr[i]) - 1:
maxSum = newArr[i - 1][j - 1] + arr[i][j]
else:
maxSum = max(arr[i][j] + newArr[i - 1][j - 1],arr[i][j] + newArr[i - 1][j])
s.append(maxSum)
newArr.append(s)
print(max(newArr[-1]))
n = int(input())
for i in range(n):
getNum()
0.0分
0 人评分
分糖果 (C++代码)浏览:1450 |
拆分位数 (C语言代码)浏览:1328 |
数组输出 (C语言代码)--此题的题目描述有问题浏览:1817 |
简单的a+b (C语言代码)浏览:573 |
简单的a+b (C语言代码)浏览:695 |
三角形 (C++代码)递归(存在大量重复计算,容易出现时间超限)浏览:781 |
出圈】指针malloc版浏览:355 |
C语言程序设计教程(第三版)课后习题11.5 (C语言代码)浏览:1479 |
The 3n + 1 problem (C语言代码)浏览:505 |
程序员的表白 (C语言代码)浏览:598 |