LeetCode Best Time to Buy and Sell Stock II

原创 2015年07月07日 16:25:15

Description:

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

Solution:

这道题目和上一道的不同之处在于可以买入卖出多次。

这个时候可以进行这样的题目转换:就是找所有递增的子序列的递增之和。

import java.util.*;

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


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

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

122. Best Time to Buy and Sell Stock IISay you have an array for which the i-th element is the price...

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

LeetCode122 Best Time to Buy and Sell Stock II

详细见:leetcode.com/problems/best-time-to-buy-and-sell-stock-ii Java Solution: github package l...

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

和大神们学习每天一题(leetcode)-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...

【leetcode】Array——Best Time to Buy and Sell Stock I/II/III

Best Time to Buy and Sell Stock 题目: Say you have an array for which the ith element is the pri...

LeetCode题解:122. Best Time to Buy and Sell Stock II

题目链接:122. Best Time to Buy and Sell Stock II题目描述: Say you have an array for which the ith element ...

LeetCode_Best Time to Buy and Sell Stock II

LeetCode_Best Time to Buy and Sell Stock II 解题思路

LeetCode——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 a...

算法设计Week5 LeetCode Algorithms Problem #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. ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)