2014年7月3日
[LeetCode] Best Time to Buy and Sell Stock III
摘要： 将Best Time to Buy and Sell Stock的如下思路用到此题目思路1：第i天买入，能赚到的最大利润是多少呢？就是i + 1 ~ n天中最大的股价减去第i天的。思路2：第i天买出，能赚到的最大利润是多少呢？就是第i天的价格减去0~ i-1天中最小的。和前两道题比起来的话，这道题最... 阅读全文
posted @ 2014-07-03 15:43 穆穆兔兔 阅读(228) 评论(0) 推荐(0) 编辑
[LeetCode] 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 complete a... 阅读全文
posted @ 2014-07-03 14:48 穆穆兔兔 阅读(143) 评论(0) 推荐(0) 编辑
[LeetCode] 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 (ie... 阅读全文
posted @ 2014-07-03 11:23 穆穆兔兔 阅读(201) 评论(0) 推荐(0) 编辑
[LeetCode] Word Ladder II
摘要： Given two words (startandend), and a dictionary, find all shortest transformation sequence(s) fromstarttoend, such that:Only one letter can be changed... 阅读全文
posted @ 2014-07-03 10:03 穆穆兔兔 阅读(311) 评论(0) 推荐(0) 编辑
[LeetCode] Path Sum
摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo... 阅读全文
posted @ 2014-07-03 09:47 穆穆兔兔 阅读(168) 评论(0) 推荐(0) 编辑