122 Best Time to Buy and Sell Stock II

目录

原题描述

Best Time to Buy and Sell Stock II
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 and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

分析

现有每天交易价格，一种可能的策略是在价格呈升序时，最低点买入最高点卖出。这种策略可以拆分成每次比较相邻的两个价格，遍历数组每次取两个值，当后一个比前一个大则收益为它们的差，否则不进行操作，累加这个收益便可得到最大收益。

代码示例

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int count = 0;
        if (prices.empty())
            return count;
        if (sizeof(prices) / sizeof(int) == 1)
            return count;
        else
            for (vector<int>::iterator i = prices.begin(); i != prices.end() - 1; ++i)
                if (*i < *(i + 1))
                    count += *(i + 1) - *i;
        return count;
    }
};

注意

对容器元素访问之前一定要确定有这个元素，首先判断容器是否为空，其次还要判断迭代器是都越界。