LeetCode--Best Time to Buy and Sell Stock II
来源:互联网 发布:阿里云 快照创建磁盘 编辑:程序博客网 时间:2024/05/16 15:46
题目:
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).
代码:int maxProfit(vector<int>& prices) { int max = 0; for(int i = 1; i < prices.size(); ++i) { if(prices[i] > prices[i-1]) max += prices[i] - prices[i-1]; } return max; }
找出所有后一天比前一天价钱高的,其总和就是结果.
0 0
- [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
- distribution源码分析(三):registry pull操作详细流程
- Webview所见
- 学习DMA原理
- IReport+jasperReport制作报表并打印
- leetcode 240 : Search a 2D Matrix II
- LeetCode--Best Time to Buy and Sell Stock II
- 背景图片的自适应
- 卧槽!这么简单MD
- Android触发器组件BroadcastReceiver详解
- android 中怎么实现点击了对话框的按钮以后对话框不会消失
- PHP - 解决中文乱码问题
- Android Studio 第三方API 无效key问题解析
- monkeyrunner自动化测试工具--UI元素获取
- Deep Convolutional Network Cascade for Facial Point Detection阅读笔记