2015年1月5日
【leetcode】Maximum Subarray
摘要： Maximum SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−... 阅读全文
posted @ 2015-01-05 20:08 H5开发技术 阅读(195) 评论(0) 推荐(0) 编辑
【leetcode】Minimum Path Sum
摘要： Minimum Path SumGiven amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along ... 阅读全文
posted @ 2015-01-05 15:13 H5开发技术 阅读(140) 评论(0) 推荐(0) 编辑
【leetcode】Unique Paths II
摘要： Unique Paths IITotal Accepted:22828Total Submissions:81414My SubmissionsFollow up for "Unique Paths":Now consider if some obstacles are added to the g... 阅读全文
posted @ 2015-01-05 14:27 H5开发技术 阅读(163) 评论(0) 推荐(0) 编辑