LeetCode-Best Time to Buy and Sell Stock II

文章目录

LeetCode地址：https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/

Problem:
Say you have an array for which the i^th 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).

public class Solution {
    public int maxProfit(int[] prices) {
        int ret=0,
            leftValue=0,
            length=prices.length,
            state=-1;//-1=buy,1=sale
        
        for(int i=0;i<length;i++)
        {
            if(state==-1)
            {
                if(i+1<length && prices[i]<prices[i+1])
                {
                    leftValue=prices[i];
                    state=1;
                }
            }else{
                if((i==length-1 && prices[i]>leftValue) || prices[i]>prices[i+1])
                {
                    ret+=prices[i]-leftValue;
                    state=-1;
                }
            }
        }
        
        return ret;
    }
}

---

本作品采用[知识共享署名-非商业性使用-相同方式共享 2.5]中国大陆许可协议进行许可，我的博客欢迎复制共享，但在同时，希望保留我的署名权kubiCode，并且，不得用于商业用途。如您有任何疑问或者授权方面的协商，请给我留言。