# Leetcode 122: Best Time to Buy and Sell Stock II

70人阅读 评论(0)

Leetcode 122: Best Time to Buy and Sell Stock II

1, I got an array, the ith element is the price of a given stock on day i
2, design an algorithm to find the max profit, I can have as many as transactions as I like
3, restrains: I have to sell the stock in order to buy again

Thought map:
1, the stock array would looks like [12,3,24,3,343,24,53,345,654,6]
2, use dp to solve that problem because this is the type of questions that let you find max/min values in an array
3, I need to know when I buy a stock, what will the profit I gonna have in following days
4, then I notic that I can have as many as transactions as I like
5, In that case, that seems to find all the uptick in the array and find the total profit
6, when next number is larger than current number, find the current profit and add to total
7, if next number is smaller than current numberm then do nothing, continue the for loop

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

}
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：315次
• 积分：33
• 等级：
• 排名：千里之外
• 原创：3篇
• 转载：1篇
• 译文：0篇
• 评论：0条
文章分类
文章存档
阅读排行