62. Unique Paths

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        if not m or not n:
            return 0
        #f = [[1] * (n) for _ in range(m)]
        curiour = [1] * n
        for i in range(1, m):
            for j in range(1, n):
                curiour[j] += curiour[j-1] 
        #for i in range(1, m):
         #   for j in range(1, n):
          #      f[i][j] = f[i-1][j] + f[i][j-1]
        return curiour[-1]