LeetCode 筆記 - 62. Unique Paths

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        if m == 1 or n == 1:
            return 1
        
        length_y = m
        length_x = n
        
        count_map = [[0 for _ in range(length_x)] for _ in range(length_y)]
        count_map[0][0] = 1
        
        for y in range(length_y):
            for x in range(length_x):
                if y > 0:
                    count_map[y][x] += count_map[y - 1][x]
                if x > 0:
                    count_map[y][x] += count_map[y][x - 1]
        
        return count_map[-1][-1]