Leetcode题解 121. Best Time to Buy and Sell Stock
来源:互联网 发布:21天学通java百度云 编辑:程序博客网 时间:2024/06/06 09:57
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.
用动态规划法。从前向后遍历数组,记录当前出现过的最低价格,作为买入价格,并计算以当天价格出售的收益,作为可能的最大收益,整个遍历过程中,出现过的最大收益就是所求。
public class Solution { public int maxProfit(int[] prices) { if(prices==null||prices.length<2){ return 0; } int min=prices[0]; int profit=0; for(int i=1;i<prices.length;i++){ min=Math.min(min,prices[i]); profit=Math.max(profit,(prices[i]-min)); } return profit; }}
0 0
- LeetCode题解:121. Best Time to Buy and Sell Stock
- Leetcode题解 121. Best Time to Buy and Sell Stock
- 【LeetCode题解】121. Best Time to Buy and Sell Stock
- LeetCode题解:121. Best Time to Buy and Sell Stock
- LeetCode 121. Best Time to Buy and Sell Stock & 122. Best Time to Buy and Sell Stock II题解
- LeetCode - Best Time to Buy and Sell Stock III 题解
- LeetCode题解-Best Time to Buy and Sell Stock
- LeetCode题解-Best Time to Buy and Sell Stock II
- LeetCode题解-Best Time to Buy and Sell Stock III
- LeetCode题解:Best Time to Buy and Sell Stock
- LeetCode题解:Best Time to Buy and Sell Stock II
- LeetCode 121 Best Time to Buy and Sell Stock题解
- 【动态规划】Leetcode编程题解:121. Best Time to Buy and Sell Stock Add to List
- LeetCode 121. Best Time to Buy and Sell Stock
- [Leetcode] 121. Best Time to Buy and Sell Stock
- [leetcode] 121. Best Time to Buy and Sell Stock
- 【leetcode】121. Best Time to Buy and Sell Stock
- [leetcode] 121. Best Time to Buy and Sell Stock
- 加载一张高德地图
- rapidjson 简单封装
- mybatis sqlmap能否、如何直接使用IN + 字符串
- 排序算法总结(1)——冒泡排序
- Java LinkedHashMap源码解析
- Leetcode题解 121. Best Time to Buy and Sell Stock
- Android开发之解决APP启动白屏或者黑屏闪现的问题,androidapp
- Crypto++库在VS 2005中的使用——RSA加解密
- 项目50-二进制文件浏览器
- 统计字符串中不同字符类型的个数
- Graph-Slam(一)
- java集合类源码剖析
- 项目51-处理C++源代码的程序
- Java自增和自减运算符