题目：
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 ...
分类：
其他好文 时间：
2015-03-29 12:22:52
阅读次数：
130
题目：
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, buy one and sell one share of ...
分类：
其他好文 时间：
2015-03-29 12:21:10
阅读次数：
210
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 an...
分类：
其他好文 时间：
2015-03-29 12:16:23
阅读次数：
108
题目：
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...
分类：
其他好文 时间：
2015-03-29 12:14:11
阅读次数：
150
/*ajax调用扩展*/$.extend($,{ajaxGetJson:function(url,data,callback){$.ajax({url:url,data:data,datatype:"json",method:"get",contentType:"application/json",beforeSend:function(){//myLoad();//打开加载层},complete:function(data){//closeLoad();//关闭加载层},succ..
分类：
Web程序 时间：
2015-03-29 07:13:58
阅读次数：
493
1、完全二叉树(Complete Binary Tree)的概念若设二叉树的深度为h，除第 h 层外，其它各层 (1～h-1) 的结点数都达到最大个数，第 h 层所有的结点都连续集中在最左边，这就是完全二叉树。完全二叉树是由满二叉树而引出来的。对于深度为K的，有n个结点的二叉树，当且仅当其每一个结点...
分类：
其他好文 时间：
2015-03-20 21:51:51
阅读次数：
122
在Oracle EBS Integration Repository中，打开一个Webservice，报了一个警告。英文：Warning Service Provider Access is not available. You may not be able to see complete inf...
分类：
数据库 时间：
2015-03-20 10:42:52
阅读次数：
487
Very good problem to learn knapsack (complete knapsack in this case).My brutal-force solution in Python got AC too, which surprised me a bit. Here is ...
分类：
其他好文 时间：
2015-03-19 06:18:36
阅读次数：
135
Disclaimer: Here is a complete answer taking the last version of OS X (10.9 AKA Mavericks) into account. I am aware that everything I compiled in this answer is already present in the page, but having...
分类：
系统相关 时间：
2015-03-17 21:53:23
阅读次数：
278
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...
分类：
其他好文 时间：
2015-03-16 00:54:36
阅读次数：
160
