1
class Solution:
2
    def minimumTotal(self, t: List[List[int]]) -> int:
3
        dp = []
4
        dp.append(t[0])
5

6
        r = len(t)
7
        answer = float("inf")
8
        for i in range(1, r):
9
            c = len(t[i])
10
            dp.append([])
11
            for j in range(0, c):
12
                if j == 0:
13
                    val = dp[i - 1][j] + t[i][j]
14
                elif j == c - 1:
15
                    val = dp[i - 1][j - 1] + t[i][j]
16
                else:
17
                    val = min(dp[i - 1][j], dp[i - 1][j - 1]) + t[i][j]
18
                if i == r - 1:
19
                    answer = min(answer, val)
20
                dp[i].append(val)
21
        return answer if r > 1 else t[0][0]