Best Time to Buy and Sell Stock II
来源:互联网 发布:编程主要学什么 编辑:程序博客网 时间:2024/04/29 22:33
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) { // Start typing your C/C++ solution below // DO NOT write int main() function int profit = 0; for(int i = 1;i<prices.size();i++) { int dif = prices[i] - prices[i-1]; if( dif > 0) profit += dif; } return profit; }};
48 milli secs.
- [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
- 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
- Best Time to Buy and Sell Stock II
- 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
- Best Time to Buy and Sell Stock II
- 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
- 杭电4508
- jsp入门:Jsp运行原理
- 解决Win8磁盘占用100%“怪招”集合
- C++忽略大小写的字符串进行比较
- 2013ACM/ICPC湘潭多省程序设计竞赛暨湘潭市第五届大学生程序设计竞赛
- Best Time to Buy and Sell Stock II
- UVa11300
- 阿里成高德最大股东 移动互联再添筹码
- 10085The most distant state(八数码,bfs+康拓判重)
- 微软10亿买下Nook背后:叫板苹果和亚马逊
- 驱动程序
- 听《计算机从业人员职业道德》课程
- POJ 1611 The Suspects
- 2013中国互联网创业者大会今日在京召开