Problem Description:
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete at most two transa...
分类：
其他好文 时间：
2014-06-05 09:33:52
阅读次数：
342
2014百度之星初赛(第二场)——Best Financing
Problem Description
小A想通过合理投资银行理财产品达到收益最大化。已知小A在未来一段时间中的收入情况，描述为两个长度为n的整数数组dates和earnings，表示在第dates[i]天小A收入earnings[i]元（0
限制条件:
1
1
对于任意i（0
对于任意i（0
...
分类：
其他好文 时间：
2014-06-05 07:49:41
阅读次数：
164
Speaking Tips from Popular TED Talks1. best
practices in presenting THE2. Knowledge is power. Pass it on. Click this button
to share information on ea...
分类：
其他好文 时间：
2014-05-30 19:39:38
阅读次数：
417
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...
分类：
其他好文 时间：
2014-05-30 16:30:00
阅读次数：
282
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...
分类：
其他好文 时间：
2014-05-30 16:19:05
阅读次数：
320
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...
分类：
其他好文 时间：
2014-05-30 15:00:54
阅读次数：
335
class Solution {public: int maxProfit(vector
&prices) { if(prices.size() == 0) return 0; vector f1(prices.size()); int
minV = pri...
分类：
其他好文 时间：
2014-05-30 02:54:28
阅读次数：
231
class Solution {public: int maxProfit(vector
&prices) { if(prices.size() == 0) return 0; vector f(prices.size()); f[0] =
0; ...
分类：
其他好文 时间：
2014-05-30 02:46:12
阅读次数：
318
My original thought was to calculate all the
possible transactions by using nested loop. But got time limit excess error.I
knew it can be done in O(n)...
分类：
其他好文 时间：
2014-05-29 20:44:37
阅读次数：
271
一次过，思路是：最大收益可以由所有上升序列差价叠加中获得 1 public class
Solution { 2 public int maxProfit(int[] prices) { 3 int profit = 0; 4 if
(prices.lengt...
分类：
其他好文 时间：
2014-05-29 20:43:33
阅读次数：
254
