Rijkstra的专栏

https://github.com/Ray137076517

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

class Solution {
public:
int maxProfit(vector<int>& prices) {
int result = 0;
int profit = 0;
if (prices.size() < 2)
return result;
for (vector<int>::iterator it = prices.begin() + 1; it != prices.end(); ++it)
{
profit = *it - *(it-1);
if (profit > 0)
result += profit;
}
return result;
}
};

Personal Note

Leetcode_122_Best Time to Buy and Sell Stock II

2015-01-26 18:28:17

leetcode【121+122+123 best time to buy and sell stock】【python】

2016-09-12 21:04:35

【LeetCode】 Best Time to Buy and Sell Stock I II III IV 解题报告

2015-04-06 11:10:34

Best Time to Buy and Sell Stock II -- LeetCode

2014-04-09 05:33:51

【LeetCode】【Python题解】Best Time to Buy and Sell Stock II

2014-07-24 10:11:44

LeetCode -- Best Time to Buy and Sell Stock II （贪心策略，差分序列）

2014-05-27 15:44:01

leetcode_c++：Best Time to Buy and Sell Stock II（122）

2016-06-10 23:19:48

【LeetCode-面试算法经典-Java实现】【121-Best Time to Buy and Sell Stock（最佳买卖股票的时间）】

2015-08-14 06:16:32

Best Time to Buy and Sell Stock -- LeetCode

2014-04-09 05:33:32

关于LeetCode中Best Time to Buy and Sell Stock一题的理解

2016-09-09 13:55:36

不良信息举报

【leetcode】Best Time to Buy and Sell Stock II