版权所有，欢迎转载，转载请注明出处，谢谢
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 sel...
分类：
其他好文 时间：
2015-02-06 13:22:16
阅读次数：
121
1.jQuery.ajax(url,[settings])//通过 HTTP 请求加载远程数据如果要处理$.ajax()得到的数据，则需要使用回调函数。beforeSend、error、dataFilter、success、complete。beforeSend 在发送请求之前调用，并且传入一个XM...
分类：
Web程序 时间：
2015-02-05 17:59:05
阅读次数：
191
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 the stock),...
分类：
其他好文 时间：
2015-02-04 18:49:28
阅读次数：
123
1、编辑一个tab.py文件root@ubuntu:/lzg/python-learn/s8#cattab.py#!/usr/bin/envpythonimportsysimportreadlineimportrlcompleterreadline.parse_and_bind(‘tab:complete‘)2、把tab.py这个文件存放到/usr/lib/python2.7/dist-packages/目录3、这样就可以在任何目录进入python..
分类：
编程语言 时间：
2015-02-02 07:17:28
阅读次数：
234
思路：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 ...
分类：
编程语言 时间：
2015-01-31 21:47:24
阅读次数：
180
Description The left figure below shows a complete 3*3 grid made with 2*(3*4) (=24) matchsticks. The lengths of all matchsticks are one. You can fi...
分类：
其他好文 时间：
2015-01-31 14:13:45
阅读次数：
144
This document is from my evernote, when I was still at baidu, I have a complete hadoop development/Debug environment. But at that time, I was tired of...
分类：
系统相关 时间：
2015-01-30 15:28:07
阅读次数：
294
《C++大学教程》（第二版） 【原书名】 The Complete C++ Training Course，Second Edition 【作者】 （美）Harvey M.Deitel Paul James Deitel 【译者】 邱仲潘 等 【丛书名】 国外计算机科学教材系列 【出版社】 电子工业...
分类：
编程语言 时间：
2015-01-30 14:51:42
阅读次数：
164
Say you have an array for which the ith element isthe price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as manytransactions as you like (ie, buy one an...
分类：
其他好文 时间：
2015-01-30 09:11:13
阅读次数：
176
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.
注意
You may n...
分类：
其他好文 时间：
2015-01-28 14:47:27
阅读次数：
197
