1、問(wèn)題：

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).

分析：

假設(shè)你有一個(gè)數(shù)組，其中第i個(gè)元素是一個(gè)給定股票第i天的價(jià)格。請(qǐng)找出最大利潤(rùn)值，可以交易多次，即多次購(gòu)買和售出，但是在再次買進(jìn)之前必須賣出之前買的。

? ? ? ?只要判斷相鄰元素是否遞增即可，只要增加就把利潤(rùn)差累積起來(lái)。

2、解法：

public class Solution {public int maxProfit(int[] prices) {int out = 0;int temp = 0;for(int i = 0;i<prices.length-1;i++){if(prices[i+1]>prices[i]){temp = prices[i+1]-prices[i];out += temp;}}return out;} }

注意數(shù)組的兩端下標(biāo)的臨界值不要越界。

總結(jié)

以上是生活随笔為你收集整理的LeetCode-best time to buy and sell stock 2 数组的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。