[LeetCode] 122. Best Time to Buy and Sell Stock II
来源:互联网 发布:怎么免费做网络推广 编辑:程序博客网 时间:2024/06/10 16:47
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 MaxTotalProf = 0; for (int i = 1; i < n; i++) { int diff = prices[i] - prices[i - 1]; MaxTotalProf += (diff > 0 ? diff : 0); } return MaxTotalProf; }};
阅读全文
0 0
- LeetCode 122. Best Time to Buy and Sell Stock II
- [Leetcode] 122. Best Time to Buy and Sell Stock II
- [leetcode] 122.Best Time to Buy and Sell Stock II
- 【leetcode】122.Best Time to Buy and Sell Stock II
- 【LeetCode】122.Best Time to Buy and Sell Stock II
- [leetcode] 122. Best Time to Buy and Sell Stock II
- LeetCode #122. Best Time to Buy and Sell Stock II
- 122. Best Time to Buy and Sell Stock II LeetCode
- [LeetCode]122. Best Time to Buy and Sell Stock II
- Leetcode 122. Best Time to Buy and Sell Stock II
- leetcode 122. Best Time to Buy and Sell Stock II
- LeetCode 122. Best Time to Buy and Sell Stock II
- LeetCode *** 122. Best Time to Buy and Sell Stock II
- leetcode-122. Best Time to Buy and Sell Stock II
- leetcode 122. Best Time to Buy and Sell Stock II
- leetcode 122. Best Time to Buy and Sell Stock II
- 【LeetCode】122. Best Time to Buy and Sell Stock II
- LeetCode - 122. Best Time to Buy and Sell Stock II
- Java中级知识点
- 基于协程的异步爬虫
- POJ 1321 深搜 棋盘问题
- LeetCode 513 Find Bottom Left Tree Value(二叉树层序遍历)
- [BZOJ1514]添加括号
- [LeetCode] 122. Best Time to Buy and Sell Stock II
- spring读取配置文件的两种方式
- Android应用如何匹配不同的手机分辨率
- Socket小练习
- 管闲事的小明
- 禅
- Glide使用详解(一)
- 才第一天
- 本机eclipse连接本机centos虚拟机安装好的redis