[3]122. Best Time to Buy and Sell Stock II(Java)

最新推荐文章于 2022-07-29 20:36:59 发布

Crystal_ting

最新推荐文章于 2022-07-29 20:36:59 发布

阅读量385

点赞数

分类专栏： leetcode Array

本文链接：https://blog.csdn.net/Crystal_ting/article/details/75118882

版权

leetcode 同时被 2 个专栏收录

79 篇文章 0 订阅

订阅专栏

Array

41 篇文章 0 订阅

订阅专栏

注：此博客不再更新，所有最新文章将发表在个人独立博客limengting.site。分享技术，记录生活，欢迎大家关注

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 total = 0;
        for (int i = 0; i < prices.length - 1; i ++) {
            if (prices[i+1] > prices[i]) total += prices[i+1] - prices[i];
        }
        return total;
    }
}