Given a list of daily temperatures
Continue reading “[Leetcode]739. Daily Temperatures”
T, return a list such that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which this is possible, put
For example, given the list of temperatures
T = [73, 74, 75, 71, 69, 72, 76, 73], your output should be
[1, 1, 4, 2, 1, 1, 0, 0].
Note: The length of
temperatures will be in the range
[1, 30000]. Each temperature will be an integer in the range
Given the array
Continue reading “[Leetcode problems]1475. Final Prices With a Special Discount in a Shop”
prices[i] is the price of the
ith item in a shop. There is a special discount for items in the shop, if you buy the
ith item, then you will receive a discount equivalent to
j is the minimum index such that
j > i and
prices[j] <= prices[i], otherwise, you will not receive any discount at all.
Return an array where the
ith element is the final price you will pay for the
ith item of the shop considering the special discount.
Input: prices = [8,4,6,2,3] Output: [4,2,4,2,3]
Input: prices = [1,2,3,4,5] Output: [1,2,3,4,5]