# [LeetCode] 122. Best Time to Buy and Sell Stock II

【原题】 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 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). 【解释】 此为Best Time to Buy and Sell Stock的follow up，这里可以多次买入卖出，但是一次不能持有多支股票，求最多可以赚多少钱。 【思路】 数组中后面的元素的值和前面的值的差若大于0，则加上这个差，直至循环结束。求得的值即为目标值。

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

0 条评论

## 相关文章

2767

1949

531

1023

1915

### sqlserver 的事务和c#的事务

sql的事务 1 sql 2 create database model 3 go 4 use model 5 go 6 create table ...

1979

2296

### Net连接mysql的公共Helper类MySqlHelper.cs带MySql.Data.dll下载

MySqlHelper.cs代码如下： using System; using System.Collections.Generic; using System...

4659

441

1163