题目摘要 给定一个数组，第i个元素代表第i天的股票价格。 你可以随意交易，但是买进之前必须先卖出，求出最大利润
解法 1. 如果第i个元素大于第i - 1个元素，将差价加到总利润上
注意
可问问题
原题 Say you have an array for which the
ith
element is the price of a given stock on day
i
<script type="math/tex" id="MathJax-Element-10">i</script>.
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).
转载请注明原文地址: https://ju.6miu.com/read-3824.html
