LeetCode Best Time to Buy and Sell Stock II
来源:互联网 发布:淘宝做什么推广好 编辑:程序博客网 时间:2024/04/29 01:35
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).
Solution:
class Solution {public: int maxProfit(vector<int> &prices) { // Start typing your C/C++ solution below // DO NOT write int main() function if(prices.empty()) return 0; int curr=prices[0],total=0; for(int i=1;i<prices.size();++i){ if(prices[i]>curr){ total+=prices[i]-curr; curr=prices[i]; }else{ curr=prices[i]; } } return total; }};
- [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
- [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
- [LeetCode] Best Time to Buy and Sell Stock II
- leetcode 61: Best Time to Buy and Sell Stock II
- [LeetCode] Best time to buy and sell a stock II
- 【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
- [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
- [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
- 调用[[UIDevice currentDevice] userInterfaceIdiom]==UIUserInterfaceIdiomPad判断设备
- 例题5.3.2
- poj 1330 Nearest Common Ancestors
- 把本地文件放到服务器端
- malloc() 函数实现
- LeetCode Best Time to Buy and Sell Stock II
- 结构体对齐
- 链表问题总结
- 二叉树先序遍历(递归)
- oracle数据库学习小结
- LeetCode Best Time to Buy and Sell Stock III
- 等概率、O(n)复杂度求随机排列
- 打印butongyanse
- HttpEntity的使用