摘要： http://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/哈哈, 状态不错, 虽然很水, 但是很快就ac了, 感觉还是很高兴~思路就是, 找到所有递增序列, 然后最低买, 最高卖. 1 class Solution { 2 public: 3 int maxProfit(vector &prices) { 4 int cur = 1; 5 int low = 0, high = 0; 6 int profit = 0; 7 while (cur ... 阅读全文