本文介绍了一个算法问题，即如何在给定股票价格序列的情况下找到最大的利润。允许进行最多两次交易，但不能同时持有股票，即卖出后才能再次买入。文章探讨了如何设计高效的算法来解决这一问题。
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 at most two transactions.
Note:
You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
{优快云:CODE:628226}
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
