Leetcode Problem 1040. Moving Stones Until Consecutive II

1040. Moving Stones Until Consecutive II

Leetcode Solutions

Sort the stones array to have the stones in ascending order.
Initialize variables for the size of the array (n), the low number of moves (low), and the high number of moves (high).
Use a sliding window of size n to find the number of stones within the window.
For each window position, calculate the number of missing stones and update the low number of moves accordingly.
Handle the special case where there is exactly one gap in the window, which requires two moves.
For the high number of moves, calculate the maximum distance to move all stones to the leftmost or rightmost side.
Return the low and high number of moves as the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen