Best Time to Buy and Sell Stock
来源:互联网 发布:数据共享交换 编辑:程序博客网 时间:2024/06/06 04:12
Say you have an array for which the ith element is the price of a given stock on dayi.
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.
class Solution(object): def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ min_price, max_profit = float('inf'), 0 for price in prices: min_price = min(price, min_price) max_profit = max(max_profit, price - min_price) return max_profit
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
- 用python学习数据结构与算法-堆栈
- 庄股底部特征
- Scala基础语法-4List
- Neutron学习笔记
- 括号匹配算法
- Best Time to Buy and Sell Stock
- 使用Android Studio快速上传项目到github
- Windows 远程桌面不够Copy文件
- 实现一个简单的token认证
- pyhthon下中文报错问题
- java中volatile关键字的含义
- 报错:Unable to execute dex: Multiple dex files define
- Eclipse插件开发中的Action
- Oracle 11g 的新特性 —— 虚拟列