We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Search
  4. Minimum Loss
  5. Discussions

Minimum Loss

  • mmhelloworld
     + 0 comments

    Java solution with TreeSet that provides a higher function to query the closest higher element.

        public static int minimumLoss(List<Long> prices) {
        var sortedPrices = new TreeSet<Long>();
        var minimumLoss = (long) Integer.MAX_VALUE;
        for (var price : prices) {
            var higher = sortedPrices.higher(price);
            if (higher != null) {
                minimumLoss = Math.min(minimumLoss, higher - price);
            }
            sortedPrices.add(price);
        }
        return (int) minimumLoss;
    }