leetcode:122. Best Time to Buy and Sell Stock II(java)解答

Posted boy_nihao

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了leetcode:122. Best Time to Buy and Sell Stock II(java)解答相关的知识,希望对你有一定的参考价值。

转载请注明出处:z_zhaojun的博客
原文地址
题目地址
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).

解答(Java):

public int maxProfit(int[] prices) 
        int maxPro = 0;
        int length = prices.length - 1;
        for (int i = 0; i < length; i++) 
            if (prices[i] < prices[i + 1]) 
                maxPro += prices[i + 1] - prices[i];
            
        
        return maxPro;
    

以上是关于leetcode:122. Best Time to Buy and Sell Stock II(java)解答的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode 122. Best Time to Buy and Sell Stock II

LeetCode OJ 122. Best Time to Buy and Sell Stock II

Java [Leetcode 122]Best Time to Buy and Sell Stock II

122. Best Time to Buy and Sell Stock leetcode解题笔记

[LeetCode]题解(python):122-Best Time to Buy and Sell Stock II

LeetCode122:Best Time to Buy and Sell Stock II