Moving Stones Until Consecutive

Similar Problems:

Three stones are on a number line at positions a, b, and c.

Each turn, you pick up a stone at an endpoint (ie., either the lowest or highest position stone), and move it to an unoccupied position between those endpoints. Formally, let’s say the stones are currently at positions x, y, z with x < y < z. You pick up the stone at either position x or position z, and move that stone to an integer position k, with x < k < z and k != y.

The game ends when you cannot make any more moves, ie. the stones are in consecutive positions.

When the game ends, what is the minimum and maximum number of moves that you could have made? Return the answer as an length 2 array: answer = [minimum_moves, maximum_moves]

Example 1:

Input: a = 1, b = 2, c = 5 Output: [1,2] Explanation: Move the stone from 5 to 3, or move the stone from 5 to 4 to 3.

Example 2:

Input: a = 4, b = 3, c = 2 Output: [0,0] Explanation: We cannot make any moves.

Example 3:

Input: a = 3, b = 5, c = 1 Output: [1,2] Explanation: Move the stone from 1 to 4; or move the stone from 1 to 2 to 4.

Note:

- 1 <= a <= 100
- 1 <= b <= 100
- 1 <= c <= 100
- a != b, b != c, c != a

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.

- Solution:

// Blog link: https://code.dennyzhang.com/moving-stones-until-consecutive // Basic Idea: Greedy // For max, move slowly towards middle step by step // For min, move to the smaller gap first. Then move the other end to join them. // min <= 2 // Complexity: Time O(1), Space O(1) import "sort" func numMovesStones(a int, b int, c int) []int { l := []int{a, b, c} sort.Ints(l) max := l[2]-l[0]-2 min := 0 // all nodes are not adjacent if max != 0 { smaller_gap := l[2]-l[1]-1 if smaller_gap > l[1]-l[0]-1 { smaller_gap = l[1]-l[0]-1 } if smaller_gap <= 1 { min = 1 } else { min = 2 } } return []int{min, max} }