2014年8月3日
[LeetCode] Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3, Return [1,3,3,1].Note: Could you optimize your algorithm to us... Read More
posted @ 2014-08-03 22:25 Xylophone Views(132) Comments(0) Diggs(0)
[LeetCode] Triangle（'Bottom-up' DP）
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 fol... Read More
posted @ 2014-08-03 21:23 Xylophone Views(401) Comments(0) Diggs(0)