2014年12月5日
【leetcode】 Unique Path ||(easy)
摘要： Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space i... 阅读全文
posted @ 2014-12-05 16:26 匡子语 阅读(219) 评论(0) 推荐(0)
【leetcode】 Unique Path(easy)
摘要： A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ... 阅读全文
posted @ 2014-12-05 14:44 匡子语 阅读(209) 评论(0) 推荐(0)
【leetcode】triangle（easy)
摘要： 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... 阅读全文
posted @ 2014-12-05 14:22 匡子语 阅读(205) 评论(0) 推荐(0)