2014年5月14日
LeetCode OJ - Populating Next Right Pointers in Each Node II
摘要： 题目：Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution s... 阅读全文
posted @ 2014-05-14 15:52 ThreeMonkey 阅读(218) 评论(0) 推荐(0)
LeetCode OJ - Pascal's Triangle
摘要： 题目：GivennumRows, generate the firstnumRowsof Pascal's triangle.For example, givennumRows= 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4... 阅读全文
posted @ 2014-05-14 15:41 ThreeMonkey 阅读(120) 评论(0) 推荐(0)
LeetCode OJ - Pascal's Triangle II
摘要： 题目：Given an indexk, return thekthrow of the Pascal's triangle.For example, givenk= 3,Return[1,3,3,1].Note:Could you optimize your algorithm to use onl... 阅读全文
posted @ 2014-05-14 15:38 ThreeMonkey 阅读(105) 评论(0) 推荐(0)
LeetCode OJ - 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 ... 阅读全文
posted @ 2014-05-14 15:34 ThreeMonkey 阅读(298) 评论(0) 推荐(0)
LeetCode OJ - Best Time to Buy and Sell Stock
摘要： 题目：Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction ... 阅读全文
posted @ 2014-05-14 15:25 ThreeMonkey 阅读(101) 评论(0) 推荐(0)
LeetCode OJ - Best Time to Buy and Sell Stock II
摘要： 题目：Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complet... 阅读全文
posted @ 2014-05-14 15:22 ThreeMonkey 阅读(99) 评论(0) 推荐(0)
LeetCode OJ - Best Time to Buy and Sell Stock III
摘要： 题目：Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complet... 阅读全文
posted @ 2014-05-14 15:19 ThreeMonkey 阅读(107) 评论(0) 推荐(0)
LeetCode OJ - Binary Tree Maximum Path Sum
摘要： 题目：Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 ... 阅读全文
posted @ 2014-05-14 15:16 ThreeMonkey 阅读(127) 评论(0) 推荐(0)
LeetCode OJ - Valid Palindrome
摘要： 题目：Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: P... 阅读全文
posted @ 2014-05-14 14:59 ThreeMonkey 阅读(124) 评论(0) 推荐(0)
LeetCode OJ - Word Ladder
摘要： 题目：Given two words (startandend), and a dictionary, find the length of shortest transformation sequence fromstarttoend, such that:Only one letter can ... 阅读全文
posted @ 2014-05-14 11:34 ThreeMonkey 阅读(162) 评论(0) 推荐(0)