LeetCode: 62. Unique Paths

한국 고등학교 수학 공부했으면 다 푸는 문제

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        board = [[1] * n for _ in range(m)]
        for i in range(1, m):
            for j in range(1, n):
                board[i][j] = board[i-1][j] + board[i][j-1]
        return board[m-1][n-1]