Leetcode Problem 1058. Minimize Rounding Error to Meet Target

1058. Minimize Rounding Error to Meet Target

Leetcode Solutions

Greedy Approach with Sorting

  1. Initialize low and high to 0, which represent the sum of floor values and ceil values respectively.
  2. Initialize an empty list diff to store the differences between ceil and floor rounding errors.
  3. Iterate over each price: a. Calculate the floor and ceil values. b. Add the floor value to low and the ceil value to high. c. If the floor and ceil values are different, add the difference to diff.
  4. If low is greater than target or high is less than target, return -1.
  5. Sort diff in descending order based on the difference between ceil and floor rounding errors.
  6. Calculate the number of ceil operations needed as ceilN = target - low.
  7. Sum the ceil rounding errors for the first ceilN prices and the floor rounding errors for the rest.
  8. Format the sum of rounding errors to three decimal places and return it as a string.
UML Thumbnail

Dynamic Programming Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...