【Leetcode-Easy-121】Best Time to Buy and Sell Stock
2017-10-18 13:31
447 查看
【Leetcode-Easy-121】Best Time to Buy and Sell Stock
题目
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: 5
max. 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: 0
In this case, no transaction is done, i.e. max profit = 0.
思路
找出截止当前位置的最小值和截至当前位置的最大值,记录两者之差,保留最大的差值。
程序
class Solution { public int maxProfit(int[] prices) { if (prices == null || prices.length == 0) return 0; int profit = 0; int low = prices[0]; for (int i = 0; i < prices.length; i ++){ low = Math.min(low, prices[i]); profit = Math.max(profit, prices[i]-low); } return profit; } }
声明:题目来自Leetcode.
相关文章推荐
- 121. Best Time to Buy and Sell Stock (一) leetcode解题笔记
- leetCode 121. Best Time to Buy and Sell Stock 数组
- 【LeetCode从零单排】No121 Best Time to Buy and Sell Stock
- leetcode 121 —— Best Time to Buy and Sell Stock
- leetcode【121+122+123 best time to buy and sell stock】【python】
- Easy 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
- leetcode 121 122 123 . Best Time to Buy and Sell Stock
- LeetCode 121, 122, 123. Best Time to Buy and Sell Stock i, ii, iii
- 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[facebook]
- 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: -Dynamic Programming-Best Time to Buy and Sell Stock[121]