My notes on leetcode
Tuesday, September 9, 2014
Code Ganker: Unique Paths -- LeetCode
Code Ganker: Unique Paths -- LeetCode
: 原题链接: http://oj.leetcode.com/problems/unique-paths/ 这道题是比较典型的动态规划的题目。模型简单，但是可以考核动态规划的思想。 我们先说说brute force的解法，比较容易想到用递归，到达某一格的路径数量等于它的上面和左...
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment