GoConqr hat ein neues Design! Sag uns, wie es dir gefällt.

Karteikarten

Single sell stock

Suhas S Englisch 2 Karten

Karten in diesem Stapel (2)

  1. 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;
    }
    }
  2. 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)

Informationen

Beschreibung
Karteikarten am Single sell stock, erstellt von Suhas S am 12/02/2018.
Erstellt von
Suhas S · Feb 2018
Aktualisiert
31 Jul 2018
Aufrufe
8
Tags
array
Bewertung

Feedback

Worum geht es?

Wie gefällt dir das neue Design?

Dein Eindruck