Problem Description
Whuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in ...
分类：
其他好文 时间：
2014-10-03 02:05:13
阅读次数：
356
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-10-02 13:58:53
阅读次数：
321
stock.picking.out 和 stock.picking.in 都是继承自stock.picking新添加columns时需要注意，在stock.picking.out和stock.picking.in里新添的column必须在stock.picking里重复定义一遍，否则即使编译通过也还...
分类：
其他好文 时间：
2014-09-29 16:01:31
阅读次数：
185
一定要判断好边界条件，edge case很关键。 1 #include 2 #include 3 using namespace std; 4 5 class Solution { 6 public: 7 int maxProfit(vector &prices) { 8 ...
分类：
其他好文 时间：
2014-09-27 19:02:20
阅读次数：
202
Problem: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 transac...
分类：
其他好文 时间：
2014-09-25 21:10:47
阅读次数：
171
【转http://lz357502668.blog.163.com/blog/static/16496743201231941718527/】?MD_STOCK_REQUIREMENTS_LIST_API 取MD04的MRP Element MD_STOCK_REQUIREMENTS_LIST_A....
Buy Tickets
Time Limit: 4000MS
Memory Limit: 65536K
Total Submissions: 13618
Accepted: 6802
Description
Railway tickets were difficult to buy around the Lunar New Yea...
分类：
其他好文 时间：
2014-09-23 22:29:05
阅读次数：
280
1111 ,'item_id' => 1, 'pro_id' => 1, 'pro_name' => 1111 ,'buy_num' => 5),Array ( 'order_id' => 1111 ,'item_id' => 2 ,'pro_id' => 2 ,'pro_name' => 222....
分类：
其他好文 时间：
2014-09-23 20:25:35
阅读次数：
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 as many transactions as you like (i...
分类：
其他好文 时间：
2014-09-21 03:10:29
阅读次数：
265
Problem Description
Corrupt governors always find ways to get dirty money. Paint something, then sell the worthless painting at a high price to someone who wants to bribe him/her on an auction, this ...
分类：
其他好文 时间：
2014-09-20 22:56:29
阅读次数：
258
