121. Best Time to Buy and Sell Stock
来源:互联网 发布:代徐敬业知乎 编辑:程序博客网 时间:2024/05/23 16:07
Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.
Example 1:Input: [7, 1, 5, 3, 6, 4]Output: 5max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)Example 2:Input: [7, 6, 4, 3, 1]Output: 0In this case, no transaction is done, i.e. max profit = 0.
简单的动态规划算法:
int maxProfit(vector<int>& prices) { if (prices.size() <= 1)return 0; int sum = 0; int minimum = prices[0]; for (int i = 1; i < prices.size(); i++){ if (minimum > prices[i]){ minimum = prices[i]; } else{ sum = max(sum, prices[i] - minimum); } } return sum;}
阅读全文
0 0
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time To Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock
- .net core 基于 dapper 扩展的操作 mysql
- 接入层、汇聚层和核心层交换机
- GibbsLDA++使用记录
- Caffe学习系列(2):数据层及参数
- windows上的软件安装清单
- 121. Best Time to Buy and Sell Stock
- CDC CPaintDC、CClientDC、CWindowDC和CMetaFileDC类的含义及区别
- tomcat日志文件查看指定日期内的输出
- LeetCode (Flatten Binary Tree to Linked List)
- 60、序列化二叉树
- HTML语义化
- OkHttp3源码分析[综述]
- 关于case用法和decode用法
- 测试springmvc方法和配置文件是否有错