2014年12月9日
【leetcode】Minimum Path Sum(easy)
摘要： Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:Yo... 阅读全文
posted @ 2014-12-09 16:37 匡子语 阅读(180) 评论(0) 推荐(0)
【leetcode】 Unique Binary Search Trees II (middle)☆
摘要： Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 uni... 阅读全文
posted @ 2014-12-09 14:59 匡子语 阅读(201) 评论(0) 推荐(0)
【leetcode】 Unique Binary Search Trees (middle)☆
摘要： Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1 ... 阅读全文
posted @ 2014-12-09 12:46 匡子语 阅读(212) 评论(0) 推荐(0)