摘要: 问题: 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, bu... 阅读全文
posted @ 2014-10-09 21:40 苍枫露雨 阅读(476) 评论(0) 推荐(0) 编辑
摘要: 问题: 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 sto... 阅读全文
posted @ 2014-10-09 21:05 苍枫露雨 阅读(1066) 评论(0) 推荐(0) 编辑