# 1033. Moving Stones Until Consecutive

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`

``````class Solution {
public:
vector<int> numMovesStones(int a, int b, int c) {
vector<int> nums{a, b, c};
sort(nums.begin(), nums.end());
int diff1 = nums[2] - nums[1], diff2 = nums[1] - nums[0];
if (diff1 == 2 || diff2 == 2) return {1, nums[2] - nums[0] - 2};
return {(diff1 > 1) + (diff2 > 1), nums[2] - nums[0] - 2};
}
};
``````

``````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};
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1033

https://leetcode.com/problems/moving-stones-until-consecutive/

https://leetcode.com/problems/moving-stones-until-consecutive/discuss/965583/C%2B%2B-2-lines

https://leetcode.com/problems/moving-stones-until-consecutive/discuss/282836/C%2B%2BJava-4-lines

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation