leetcode 日经贴，python code -Unique Paths

Unique Paths

class Solution:    # @return an integer    def uniquePaths(self, m, n):        numerator, denominator = 1, 1        for i in range(m - 1):            numerator *= i + 1            denominator *= n + i        return denominator / numerator