2014年5月6日
Leetcode | Populating Next Right Pointers in Each Node I & II
摘要： Populating Next Right Pointers in Each Node IGiven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLin... 阅读全文
posted @ 2014-05-06 19:56 linyx 阅读(161) 评论(0) 推荐(0) 编辑
爱是恒久忍耐，又有恩慈
摘要： 爱是恒久忍耐，又有恩慈；爱是不嫉妒，爱是不自夸，不张狂，不做害羞的事，不求自己的益处，不轻易发怒，不计算人的恶，不喜欢不义，只喜欢真理；凡事包容，凡事相信，凡事盼望，凡事忍耐。 阅读全文
posted @ 2014-05-06 18:31 linyx 阅读(281) 评论(0) 推荐(0) 编辑
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... 阅读全文
posted @ 2014-05-06 17:43 linyx 阅读(130) 评论(0) 推荐(0) 编辑
Leetcode | Best Time to Buy and Sell Stock
摘要： Best Time to Buy and Sell Stock ISay you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to ... 阅读全文
posted @ 2014-05-06 13:59 linyx 阅读(192) 评论(0) 推荐(0) 编辑