12218759
| Pregunta | Respuesta |
| sell single stock | class 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; } } |
| 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. | 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) |
¿Quieres crear tus propias Fichas gratiscon GoConqr? Más información.