Problem Description: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...
分类：
其他好文 时间：
2014-07-07 16:05:24
阅读次数：
229
Problem Description: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...
分类：
其他好文 时间：
2014-07-07 15:24:41
阅读次数：
212
Problem Description: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...
分类：
其他好文 时间：
2014-07-07 15:24:05
阅读次数：
206
归一化：可以将大量重复特征聚合为单一特征，降低重复带来的相似度差异。方法: Vx = Vx /abs(v1)+...abs(Vn)词干处理：(变形词，同意词，近义词聚合) 减少特征的重复性 imaging-images buy-bought 我-俺 早餐-早饭.......停用词：（弱特征）大量出现的没有实际特征意义的虚词，副词，语气词等 I ,am, is ,a,an,always 我，啊，了...
分类：
其他好文 时间：
2014-07-02 10:41:28
阅读次数：
267
As long as you know, the purpose of the bag that you want to buy, everything goes, and you can get a good deal. For more information, click on this li...
分类：
其他好文 时间：
2014-07-01 18:13:09
阅读次数：
210
需要注意的是，可以操作两次买卖，但是第二次买入必须在第一次卖出之后才能操作。所以思路就是先正序使用贪心计算每一天之前买入卖出可能达到的最大收益，拿数组记录下来。再逆序计算每一天对应的之后买入卖出可能达到的最大收益，拿数组记录下来。然后将两个数组中每一天对应的两种情况可以实现的收益之和，得到最大值即为可以实现的最大收益。code如下：...
分类：
其他好文 时间：
2014-06-27 23:44:49
阅读次数：
247
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-06-25 13:06:16
阅读次数：
198
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-06-25 12:59:40
阅读次数：
202
【题目】
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 transactions.
Note:
You may not engage in multiple transactions at the same time (i...
分类：
其他好文 时间：
2014-06-24 23:28:43
阅读次数：
223
【题目】
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 as many transactions as you like (ie, buy one and sell one share of the stock multiple times). H...
分类：
其他好文 时间：
2014-06-24 19:40:53
阅读次数：
240
