121.Best Time to Buy and Sell Stock
来源:互联网 发布:笔记本电脑周边 知乎 编辑:程序博客网 时间:2024/06/05 22:34
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.
public class Solution { public int maxProfit(int[] prices) {if (prices == null || prices.length < 2) {return 0;}int buy = prices[0];int max = 0;for (int i = 1; i < prices.length; i++) {buy = Math.min(buy, prices[i]);max = Math.max(max, prices[i] - buy);}return max; }}
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
- 一步一步实现大图预览
- 为什么GoogleNet中的Inception Module使用1*1 convolutions?
- 不完全版天气查询
- iOS设计模式浅析之抽象工厂设计模式
- 多版本Firefox共存
- 121.Best Time to Buy and Sell Stock
- SpringBoot Data JPA
- CodeIgniter 整合 UCenter 通信成功 登录不同步
- Linux C进程与多线程
- noip模拟题11.15 距noip2016还剩三天
- iOS设计模式浅析之装饰器模式
- clang static analyzer源码分析(番外篇):removeDead() - SVal、Symbol及Environment
- 非常实用的10款网站数据实时分析工具(强烈推荐)
- 线性筛模板