[LeetCode] DP / Unique-paths

class Solution:
    def uniquePaths(self, r: int, c: int) -> int:
        if (r == 1 or c == 1):
            return 1
        
        dp = [[1] * c for _ in range(r)]
        
        for i in range(1, r):
            for j in range(1, c):
                dp[i][j] = dp[i-1][j] + dp[i][j-1]
        
        return dp[r-1][c-1]