LeetCode 1033: Moving Stones Until Consecutive
Problem Restatement Three stones are at positions a , b , c on a number line where a < b < c . In one move, we pick the leftmost or rightmost stone and move it to an open position between the other two stones. We need to return an array of two integers: result[0] : minimum number of moves. result[1] : maximum number of moves. The official constraints state...