121. Best Time to Buy and Sell Stock
2013-09-26 09:07
375 查看
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.
---
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) { int minIndex = 0; int maxDiff = 0; for (int i = 0; i < prices.length; i++) { if (prices[i] < prices[minIndex]) minIndex = i; // keep track of the possible min index int diff = prices[i] - prices[minIndex]; // current dif if (diff > maxDiff) { // update maxDiff = diff; } } return maxDiff; } }
相关文章推荐
- 121. Best Time to Buy and Sell Stock
- 121. Best Time to Buy and Sell Stock
- 121. Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock - LeetCode 121
- Leetcode 121 Best Time to Buy and Sell Stock
- 121. Best Time to Buy and Sell Stock
- 121. Best Time to Buy and Sell Stock--LeetCode Record
- [LeetCode 121]Best Time to Buy and Sell Stock(动态规划)
- [121] Best Time to Buy and Sell Stock
- 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 I
- 121. Best Time to Buy and Sell Stock
- 121. Best Time to Buy and Sell Stock
- LeetCode121—Best Time to Buy and Sell Stock
- 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--股票买入后再卖出,求最大收益,最多交易一次
- 121. Best Time to Buy and Sell Stock
- LeetCode 121. Best Time to Buy and Sell Stock (买卖股票的最好时机)