leetcode 日经贴,python code -Unique Paths
2015-02-16 14:57
513 查看
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
相关文章推荐
- leetcode 日经贴,python code -Longest Valid Parentheses
- leetcode 日经贴,python code -Copy List with Random Pointer
- leetcode 日经贴,python code -Median of Two Sorted Arrays
- leetcode 日经贴,python code -Remove Duplicates from Sorted Array
- leetcode 日经贴,python code -Sqrt(x)
- leetcode 日经贴,python code -Reverse Words in a String
- leetcode 日经贴,python code -Decode Ways
- leetcode 日经贴,python code - 3sum
- leetcode 日经贴,python code -Excel Sheet Column Title
- leetcode 日经贴,python code -Gas Station
- leetcode 日经贴,python code -Spiral Matrix
- leetcode 日经贴,python code -Remove Element
- leetcode 日经贴,python code -Different Ways to Add Parentheses
- leetcode 日经贴,python code -Valid Parentheses
- leetcode 日经贴,python code -Remove Element
- leetcode 日经贴,python code -repeated-dna-sequences
- leetcode 日经贴,python code -Balanced Binary Tree
- leetcode 日经贴,python code -Word Search II
- leetcode 日经贴,python code -Symmetric Tree
- leetcode 日经贴,python code - 3sumClosest