本文探讨了一个算法问题：给定一个数组，其中第i个元素表示第i天某股票的价格。设计一种算法来找出可以获得的最大利润。允许进行多次买入卖出操作，但同一时刻只能持有一股。文章将详细解释解决方案。
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).
扫一扫
401
06-18
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
