Flashcards
Single sell stock
Cards in this deck (2)
- 1sell single stockclass Solution {
public int maxProfit(int[] prices) {
int minimumPrice = Integer.MAX_VALUE;
int profit = 0;
for(int i = 0;i < prices.length; i++){
profit = Math.max(prices[i] - minimumPrice,profit);
minimumPrice = Math.min(minimumPrice, prices[i]);
}
return profit;
}
} - 2Say 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.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)
Information
- Description
- Flashcards on Single sell stock, created by Suhas S on 12/02/2018.
- Created by
- Suhas S · Feb 2018
- Updated
- Jul 31, 2018
- Views
- 8
- Tags
- Rating