- 跟我一起刷leetCode算法题9之Best Time to B
- Leetcode PHP题解--D109 122. Best T
- leetcode:122. Best Time to Buy a
- [数组]122. Best Time to Buy and Se
- Leetcode122-Best Time to Buy and
- Leetcode 122. Best Time to Buy a
- LeetCode 122. Best Time to Buy a
- LeetCode 122. Best Time to Buy a
- Leetcode 122. Best Time to Buy a
- leetcode 122. Best Time to Buy a
Best Time to Buy and Sell Stock II
unlocked question, 所以不贴截图了
This solution is really smart. 当后一个比前一个大的时候，把差值加入result中。 e.g.: ｛7, 1, 2, 5, 4, 3｝，7, 1递减，不对result操作。 1，2，5递增，5 - 1 = (2 - 1) + (5 - 2)， 把(2 - 1) and (5 - 2)分别加入result。
class Solution {
public:
int maxProfit(vector<int>& prices) {
int res = 0;
for (int i = 1; i < prices.size(); i++)
res += max(prices[i] - prices[i - 1], 0);
return res;
}
};
网友评论