算法作业

1.根据身高重建队列问题：
代码：

def rec(people):
people = sorted(people, key=lambda x: (x[0], x[1]),reverse=True)
Line = []
for each in people:
    Line.insert(each[1], each)
return Line


print(rec([[7, 0], [4, 4], [7, 1], [5, 0], [6, 1], [5, 2]]))

l = []
def minimumTotal(triangle, i, j, sum=0):
    if j > len(triangle) - 1 or i > len(triangle) - 1:
        return sum
    sum += triangle[i][j]
    if i == len(triangle) - 1:
        l.append(sum)
    minimumTotal( triangle, i + 1, j, sum)
    minimumTotal(triangle, i + 1, j + 1, sum)
    return min(l)
triangle = [
    [2],
    [3, 4],
    [6, 5, 7],
    [4, 1, 8, 3],
    [2, 3, 4, 5, 6]
]
a = minimumTotal(triangle, 0, 0,0)
print(a)