최적의 행렬 곱셈

https://school.programmers.co.kr/learn/courses/30/lessons/12942 

def solution(matrix_sizes):
    table = [[0 for _ in matrix_sizes] for _ in matrix_sizes]
    for i in range(1, len(matrix_sizes)):
        for j in range(len(matrix_sizes) - i):
            k = j + i
            table[j][k] = min(
                table[j][m] + table[m + 1][k] + matrix_sizes[j][0] * matrix_sizes[m][1] * matrix_sizes[k][1]
                for m in range(j, k))
    return table[0][-1]