LeetCode - 120. Triangle | DFS | Divide & Conquer | DP | Greedy

120. Triangle

DFS 自顶而下

def minimumTotal(self, triangle: List[List[int]]) -> int:
    def helper(i, j, cur):
        if i==len(triangle): return cur
        return min(helper(i+1, j, cur+triangle[i][j]), 
                   helper(i+1, j+1, cur+triangle[i][j]))
    return helper(0, 0, 0)

helper(i, j, cur) - min sum from top to the current index (we use the variable cur to store the sum)

DFS 自底而上 Divide & Conquer

def minimumTotal(self, triangle: List[List[int]]) -> int:
    def helper(i, j):
        if i==len(triangle): return 0
        return min(helper(i+1, j), 
                   helper(i+1, j+1))+triangle[i][j]
    return helper(0, 0)

helper(i, j) - min sum from bottom to the current index
time complexity: call depth is the num of rows = n; for each helper function, we call twice; so total will be O(2^n)
place to optimize: for each position helper(i, j), we called it twice from helper(i-1, j) and helper(i-1, j-1)

with memo

def minimumTotal(self, triangle: List[List[int]]) -> int:
    tmp = []
    for i in range(len(triangle)):
        tmp.append([])
        for j in range(len(triangle[i])):
            tmp[i].append(-1)
    def helper(i, j):
        if i==len(triangle): return 0
        if tmp[i][j]!=-1:
            return tmp[i][j]
        tmp[i][j] = min(helper(i+1, j), 
                        helper(i+1, j+1))+triangle[i][j]
        return tmp[i][j]
    return helper(0, 0)

DP 自底而上

def minimumTotal(self, triangle: List[List[int]]) -> int:
    for i in range(len(triangle)-2, -1, -1):
        for j in range(len(triangle[i])-1, -1, -1):
            triangle[i][j] += min(triangle[i+1][j], triangle[i+1][j+1])
    return triangle[0][0]

DP 自顶而下

def minimumTotal(self, triangle: List[List[int]]) -> int:
    for i in range(1, len(triangle)):
        for j in range(len(triangle[i])):
            add = float('inf')
            if j-1>=0:
                add = min(add, triangle[i-1][j-1])
            if j<len(triangle[i-1]):
                add = min(add, triangle[i-1][j])
            triangle[i][j] += add
    return min(triangle[-1])