python进阶练习题:减少金字塔【难度：2级】--景越Python编程实例训练营,不同难度Python习题，适合自学Python的新手进阶

python进阶练习题:减少金字塔【难度:2级】:

数字金字塔

数字金字塔是递归结构,其中每个下一行是通过添加当前行的相邻值来构造的.例如:


第1行[1 2 3 4]
第2行[3 5 7]
第3行[8 12]
第4行[20]

任务

给定数字金字塔的第一行,找到存储在其最后一行中的值.

例子

reduce_pyramid([1])== 1
reduce_pyramid([3,5])== 8
reduce_pyramid([3,9,4])== 25

reducePyramid([1n])=== 1n
reducePyramid([3n,5n])=== 8n
reducePyramid([3n,9n,4n])=== 25n

reduce_pyramid([1])== 1
reduce_pyramid([3,5])== 8
reduce_pyramid([3,9,4])== 25

reducePyramid([1])== 1
reducePyramid([3,5])== 8
reducePyramid([3,9,4])== 25

性能测试

测试次数:10
清单大小:10,000

测试次数:5
数组大小:10,000

测试次数:10
数组大小:10,000

测试次数:5
清单大小:10,000

编程目标:

def reduce_pyramid(base):
    return

测试样例:

Test.assert_equals(reduce_pyramid([1]), 1)
Test.assert_equals(reduce_pyramid([3, 5]), 8)
Test.assert_equals(reduce_pyramid([3, 9, 4]), 25)
Test.assert_equals(reduce_pyramid([5, 6, 7, 8]), 52)
Test.assert_equals(reduce_pyramid([13, 1, 21, 9]), 88)
Test.assert_equals(reduce_pyramid([13, 76, 21, 42, 63]), 674)