121. Best Time to Buy and Sell Stock
来源:互联网 发布:java依赖注入 编辑:程序博客网 时间:2024/05/29 17:26
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 == 0){ return 0; } int min = Integer.MAX_VALUE; int profit = 0; for(int i=0; i<prices.length; i++){ if(prices[i] > min){ min = prices[i]; } if(prices[i] - min > profit){ profit = prices[i] - min; } } return 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
- SyntaxError- Non-ASCII character '-xe8' in file
- JavaScript Set集合的并集,交集,差集
- Hadoop家族学习路线图
- Unity面试编程题
- Android Shape自定义纯色圆角按钮
- 121. Best Time to Buy and Sell Stock
- Caffe源码解读(六): Caffe的I/O模块
- Leetcode 193. Valid Phone Numbers
- Caffe源码解读(七):将图片数据转化为LMDB数据
- 爬虫Debug
- 圆与三角形-51NOD 1298
- JAVA零基础入门(2)
- 从ImageLoader看设计模式
- centos6.5系统 使用rxtx串口转USB收数据