Leetcode刷题76-1033. 移动石子直到连续(C++详细解法！！！)

最新推荐文章于 2024-01-26 16:48:10 发布

huyunceng_cloud

最新推荐文章于 2024-01-26 16:48:10 发布

阅读量496

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode从零开始文章标签： LeetCode C++

本文链接：https://blog.youkuaiyun.com/qq_40858438/article/details/90114185

本文介绍了LeetCode中的一道题目，编号为76-1033，题目名称为“移动石子直到连续”。文章讨论了如何使用C++解决这个问题，指出这是一个看似简单但实则需要巧妙思考的题目。作者分享了题目的具体要求，例如在一条数轴上，三颗石子分别位于a, b, c的位置，玩家需要通过移动石子到未占据的位置，使得石子最终连续排列。游戏结束条件是无法再进行移动。文章给出了问题的示例和解决方案，并表达了作者在解题过程中的收获，认为这是一个有趣的脑筋急转弯挑战。" 53669724,5148875,前端开发者如何突破工作一到三年的能力瓶颈,"['前端开发', '技术提升', '工作经验', 'CSS技巧']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Come from : [https://leetcode-cn.com/problems/moving-stones-until-consecutive/]

1.Question

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

2.Answer

easy 类型题目。（明明是脑筋急转弯题目，给你个大白眼~）

class Solution {
   
   
public:
    vector<int> numMovesStones(int a, int b, int c) {
   
   
        vector<int> res(2, 0)

最低0.47元/天解锁文章

200万优质内容无限畅学