[leetcode]Best Time to Buy and Sell Stock III...
分类:
其他好文 时间:
2014-09-09 13:31:08
阅读次数:
128
[leetcode]Best Time to Buy and Sell Stock...
分类:
其他好文 时间:
2014-09-09 13:30:58
阅读次数:
202
[leetcode]Best Time to Buy and Sell Stock II...
分类:
其他好文 时间:
2014-09-09 13:30:48
阅读次数:
121
Tags: wigs for women, best wigs for womenPointers To Consider When Looking For The Ideal Ohio Automotive Refinishing Detection Company By: tysoncross0...
分类:
其他好文 时间:
2014-09-09 12:28:18
阅读次数:
262
Best Time to Buy and Sell Stock
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 (ie,...
分类:
其他好文 时间:
2014-09-08 09:39:06
阅读次数:
312
1 public class Solution { 2 public int maxProfit(int[] prices) { 3 if (prices.length prices[i]) buyPrices = prices[i];11 }12 ...
分类:
其他好文 时间:
2014-09-08 01:00:16
阅读次数:
200
I feel a little down recently.But just like Lady Antebellum's song says,there are a lot of ups and downs in life,so I choose to learn from the defea.....
分类:
其他好文 时间:
2014-09-07 17:14:35
阅读次数:
215
【原题】http://acm.hdu.edu.cn/showproblem.php?pid=1811【类型】并查集+拓扑排序【题意】给定一些点对之间的关系(大于小于相等),判断是否发生冲突。【分析】对于冲突判断,直观的想法就是拓扑排序。以大于号或者小于号方向作为拓扑序的方向,如果处理时出现违反拓扑序...
分类:
其他好文 时间:
2014-09-07 17:08:55
阅读次数:
247
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-09-07 14:41:25
阅读次数:
240
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-09-07 13:24:55
阅读次数:
229