DP
blueskyliulan
这个作者很懒,什么都没留下…
展开
-
leetcode dp之Triangle
题目描述如下: Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the following triangle [ [2],原创 2015-09-25 22:35:19 · 467 阅读 · 0 评论 -
leetcode之Maximum Product Subarray
leetcode之Maximum Product Subarray java python原创 2015-10-04 11:29:08 · 367 阅读 · 0 评论