# 1040. Moving Stones Until Consecutive II

On an infinite number line, the position of the i-th stone is given by `stones[i]`.  Call a stone an  endpoint stone  if it has the smallest or largest position.

Each turn, you pick up an endpoint stone and move it to an unoccupied position so that it is no longer an endpoint stone.

In particular, if the stones are at say, `stones = [1,2,5]`, you cannot move the endpoint stone at position 5, since moving it to any position (such as 0, or 3) will still keep that stone as an endpoint stone.

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: [7,4,9]
Output: [1,2]
Explanation:
We can move 4 -> 8 for one move to finish the game.
Or, we can move 9 -> 5, 4 -> 6 for two moves to finish the game.
``````

Example 2:

``````Input: [6,5,4,3,10]
Output: [2,3]
We can move 3 -> 8 then 10 -> 7 to finish the game.
Or, we can move 3 -> 7, 4 -> 8, 5 -> 9 to finish the game.
Notice we cannot move 10 -> 2 to finish the game, because that would be an illegal move.
``````

Example 3:

``````Input: [100,101,104,102,103]
Output: [0,0]
``````

Note:

1. `3 <= stones.length <= 10^4`
2. `1 <= stones[i] <= 10^9`
3. `stones[i]` have distinct values.

``````class Solution {
public:
vector<int> numMovesStonesII(vector<int>& stones) {
sort(stones.begin(), stones.end());
int n = stones.size(), low = n, i = 0;
for (int j = 0; j < n; ++j) {
while (stones[j] - stones[i] + 1 > n) ++i;
int already_store = j - i + 1;
if (already_store == n - 1 && stones[j] - stones[i] + 1 == n - 1) {
low = min(low, 2);
} else {
low = min(low, n - already_store);
}
}
return {low, max(stones[n - 1] - stones[1] - n + 2, stones[n - 2] - stones[0] - n + 2)};
}
};
``````

Github 同步地址:

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

Moving Stones Until Consecutive

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

https://leetcode.com/problems/moving-stones-until-consecutive-ii/discuss/289357/c%2B%2B-with-picture

https://leetcode.com/problems/moving-stones-until-consecutive-ii/discuss/286707/JavaC%2B%2BPython-Sliding-Window

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

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

×

Help us with donation