Welcome to Subscribe On Youtube

Formatted question description: https://leetcode.ca/all/1033.html

1033. Moving Stones Until Consecutive (Easy)

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. 1 <= a <= 100
  2. 1 <= b <= 100
  3. 1 <= c <= 100
  4. a != b, b != c, c != a

 

 

Related Topics:
Brainteaser

Solution 1.

  • class Solution {
    public int[] numMovesStones(int a, int b, int c) {
        int left = Math.min(Math.min(a, b), c);
        int right = Math.max(Math.max(a, b), c);
        int mid = a + b + c - left - right;
        int min = 2;
        if (mid - left == 1 && right - mid == 1)
            min = 0;
        else if (mid - left <= 2 || right - mid <= 2)
            min = 1;
        int max = right - left - 2;
        return new int[]{min, max};
    }
}

############

class Solution {
    public int[] numMovesStones(int a, int b, int c) {
        int x = Math.min(a, Math.min(b, c));
        int z = Math.max(a, Math.max(b, c));
        int y = a + b + c - x - z;
        int mi = 0, mx = 0;
        if (z - x > 2) {
            mi = y - x < 3 || z - y < 3 ? 1 : 2;
            mx = z - x - 2;
        }
        return new int[]{mi, mx};
    }
}

  • // OJ: https://leetcode.com/problems/moving-stones-until-consecutive/
// Time: O(1)
// Space: O(1)
class Solution {
public:
    vector<int> numMovesStones(int a, int b, int c) {
        int mx = max({ a, b, c }), mn = min({ a, b, c }), mid = a + b + c - mx - mn;
        return { mid - mn == 2 || mx - mid == 2 ? 1 : (mid - mn > 1) + (mx - mid > 1), mx - mn - 2 };
    }
};

  • class Solution:
    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:
        a, b, c = sorted([a, b, c])
        ans = [0] * 2
        if c - a == 2:
            return ans
        if b - a < 3 or c - b < 3:
            ans[0] = 1
        else:
            ans[0] = 2
        ans[1] = c - a - 2
        return ans

############

# 1033. Moving Stones Until Consecutive
# https://leetcode.com/problems/moving-stones-until-consecutive

class Solution:
    def numMovesStones(self, a: int, b: int, c: int) -> List[int]:
        A = sorted([a, b, c])
        a, b, c = A
        if c - a == 2: return [0, 0]
        return [1 if min(c - b, b - a) <= 2 else 2, c - a - 2]


  • func numMovesStones(a int, b int, c int) []int {
	x := min(a, min(b, c))
	z := max(a, max(b, c))
	y := a + b + c - x - z
	mi, mx := 0, 0
	if z-x > 2 {
		mi = 2
		if y-x < 3 || z-y < 3 {
			mi = 1
		}
		mx = z - x - 2
	}
	return []int{mi, mx}
}

func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

  • function numMovesStones(a: number, b: number, c: number): number[] {
    const x = Math.min(a, Math.min(b, c));
    const z = Math.max(a, Math.max(b, c));
    const y = a + b + c - x - z;
    let mi = 0,
        mx = 0;
    if (z - x > 2) {
        mi = y - x < 3 || z - y < 3 ? 1 : 2;
        mx = z - x - 2;
    }
    return [mi, mx];
}

All Problems

All Solutions