Also the very first problem on EPI.class Solution {public: int maxProfit(vector &prices) { size_t len = prices.size(); if (len = pric...
分类：
其他好文 时间：
2014-08-08 15:53:26
阅读次数：
170
Best Time to Buy and Sell StockSay you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to compl...
分类：
其他好文 时间：
2014-08-07 00:20:37
阅读次数：
185
Best Time to Buy and Sell Stock IISay you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the ...
分类：
其他好文 时间：
2014-08-07 00:20:17
阅读次数：
257
题目：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 com....
分类：
编程语言 时间：
2014-07-30 05:35:13
阅读次数：
260
题目：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 com....
分类：
编程语言 时间：
2014-07-30 05:35:03
阅读次数：
309
题目：Say 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 complete at most one transact....
分类：
编程语言 时间：
2014-07-30 05:34:13
阅读次数：
248
描述：数组 A，对于 i max_minus:17 max_minus = tmp18 19 return max_minus动态规划：设dp[i]是[0,1,2...i]区间的最大利润，则该问题的一维动态规划方程如下dp[i+1] = ma...
分类：
其他好文 时间：
2014-07-29 16:51:52
阅读次数：
233
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-07-27 09:49:52
阅读次数：
237
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-07-26 14:30:11
阅读次数：
156
Say 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 complete at most one transaction ...
分类：
其他好文 时间：
2014-07-26 01:23:26
阅读次数：
229
