2015年9月1日
LeetCode -- 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 fol... Read More
posted @ 2015-09-01 15:05 sunalive Views(188) Comments(0) Diggs(0)
(leetcode)Product of Array Except Self
Given an array ofnintegers wheren> 1,nums, return an arrayoutputsuch thatoutput[i]is equal to the product of all the elements ofnumsexceptnums[i].Solv... Read More
posted @ 2015-09-01 11:02 sunalive Views(171) Comments(0) Diggs(0)