Flashcards
Single sell stock
Flashcards do conjunto (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)
Informações
- Descrição
- FlashCards sobre Single sell stock, criado por Suhas S em 12-02-2018.
- Criado por
- Suhas S · fev 2018
- Atualizado
- 31 jul 2018
- Visualizações
- 8
- Tags
- Avaliação