374. Guess Number Higher or Lower

最新推荐文章于 2024-10-21 14:58:17 发布
转载 最新推荐文章于 2024-10-21 14:58:17 发布 · 57 阅读 · 0 ·
CC 4.0 BY-SA版权
原文链接：http://www.cnblogs.com/zhuangbijingdeboke/p/9093796.html

本文介绍了一种使用二分查找算法解决猜数字游戏的方法。通过定义一个向前声明的guess API来判断猜测数字与目标数字的关系，并利用二分查找快速定位到正确答案。此算法效率高，适用于范围较大的猜数字游戏。 
 1 // Forward declaration of guess API.
 2 // @param num, your guess
 3 // @return -1 if my number is lower, 1 if my number is higher, otherwise return 0
 4 int guess(int num);
 5 
 6 class Solution 
 7 {
 8 public:
 9     int guessNumber(int n) 
10     {
11         int left=1,right=n,mid=0;
12         while(left<right)
13         {
14             mid=left+(right-left)/2;
15             if(guess(mid)==1)
16                 left=mid+1;
17             else if(guess(mid)==-1)
18                 right=mid;
19             else
20                 return mid;
21         }
22         return left;
23     }
24 };

二分，问题不大

转载于:https://www.cnblogs.com/zhuangbijingdeboke/p/9093796.html

[LeetCode]--374. Guess Number Higher or Lower
杜鲁门的博客
10-17 719
We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I’ll tell you whether the number is higher or lowe
(LeetCode)Guess Number Higher or Lower --- 猜数字
杨鑫newlife的专栏
07-18 717
(LeetCode)Guess Number Higher or Lower --- 猜数字
leetcode374. Guess Number Higher or Lower
weixin_44245188的博客
10-21 397
二分时，记当前区间为 [left,right]，初始时 left=1，right=n。记区间中间元素为 mid，若有 guess(mid)≤0 则说明 pick∈[left,mid]，否则 pick∈[mid+1,right]。当区间左右端点相同时，则说明我们找到了答案，退出循环。记选出的数字为 pick，猜测的数字为 x。根据题目描述，若 guess(x)≤0 则说明 x≥pick，否则 x<pick。根据这一性质我们可以使用二分查找来求出答案 pick。
Leetcode题解 374. Guess Number Higher or Lower
Xd_Yu的专栏
07-16 1110
We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to gue-1 : My number is lower 1 : My number is higher 0 : Congrats! You got it!Example:n = 10, I pick 6.R
<LeetCode OJ> 374. Guess Number Higher or Lower
EbowTang的练习场
07-14 2685
We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wrong, I'll tell you whether the number is higher
Leetcode 374. Guess Number Higher or Lower
小白菜又菜
03-18 433
【代码】Leetcode 374. Guess Number Higher or Lower。
lc374. Guess Number Higher or Lower
weixin_33737774的博客
05-31 117
374. Guess Number Higher or Lower We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wrong, I'll tell you...
leetcode 374. Guess Number Higher or Lower（猜数字）
蓝羽飞鸟的博客
11-16 480
leetcode 374
374. Guess Number Higher or Lower java
weixin_30888707的博客
05-16 85
We are playing the Guess Game. The game is as follows: I pick a number from1ton. You have to guess which number I picked. Every time you guess wrong, I'll tell you whether the number is high...
LeetCode 374. Guess Number Higher or Lower
Learn From The Masters
04-19 356
题目： We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wrong, I’ll tell you whether the number is highe
[LeetCode] 374. Guess Number Higher or Lower 猜数字大小
weixin_30530939的博客
03-24 171
We are playing the Guess Game. The game is as follows: I pick a number from1ton. You have to guess which number I picked. Every time you guess wrong, I'll tell you whether the number is higher or...
374. Guess Number Higher or Lower [easy] (Python)
Coder_Orz的博客
07-26 3162
题目链接https://leetcode.com/problems/guess-number-higher-or-lower/题目原文 We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked.
LeetCode——375. 猜数字大小 II(Guess Number Higher or Lower II)[中等]——分析及代码（C++）
江南土豆的博客
11-12 396
LeetCode——375. 猜数字大小 II[Guess Number Higher or Lower II][中等]——分析及代码[C++]一、题目二、分析及代码1. 动态规划（1）思路（2）代码（3）结果三、其他 一、题目 我们正在玩一个猜数游戏，游戏规则如下： 我从 1 到 n 之间选择一个数字。 你来猜我选了哪个数字。 如果你猜到正确的数字，就会 赢得游戏 。 如果你猜错了，那么我会告诉你，我选的数字比你的 更大或者更小 ，并且你需要继续猜数。 每当你猜了数字 x 并且猜错了
opencv4.5.5 基于微信在opencv开源的二维码扫码 opencv-wechat-qrcode.zip
09-12
opencv4.5.5 基于微信在opencv开源的二维码扫码 opencv-wechat-qrcode.zip
Kotlin 二维码_条形码.zip
最新发布
09-12
Kotlin 二维码_条形码.zip
Matlab_无人潜水器动力学仿真模型_Matlab_Simulink model of UUV dynamics.zi
09-12
Matlab_无人潜水器动力学仿真模型_Matlab_Simulink model of UUV dynamics.zip
mksSandbox.log
09-12
mksSandbox
Android二维码扫描和生成小工具.zip
09-12
Android二维码扫描和生成小工具.zip
C++回溯法力扣374.猜数字大小
12-20
在LeetCode的第374题“猜数字游戏”（Guess Number Higher or Lower）中，玩家和计算机进行一种简单的猜数字游戏。玩家需要猜测一个由计算机随机生成的1到n之间的整数，如果玩家猜的数字太小，计算机会提示“太低”，如果玩家猜的数字太大，计算机则提示“太高”。玩家有最多次数限制来猜测这个数字。 C++中可以使用回溯法（Backtracking）策略来解决这个问题。基本步骤如下： 1. 定义一个递归函数，接受当前猜测的数字、剩余的最大猜测次数以及已尝试过的数字范围。 2. 在函数开始时，设置一个标志变量，表示当前猜测的是最后一次机会。然后从剩余的数字范围内随机选择一个数字作为猜测。 3. 检查猜测的数字与实际数字的关系，如果是正确的，则返回胜利；如果太小，递归地调用函数并减去1次机会；如果太大，直接返回失败。 4. 在所有猜测机会用完之前，继续尝试新的数字，直到找到正确答案或者机会耗尽。 以下是简化的C++代码示例： ```cpp #include <vector> #include <ctime> int guessNumber(int n, vector<int>& guesses) { srand(time(0)); // 初始化随机种子 int target = rand() % (n + 1); // 生成1到n之间的随机数 int attempts = guesses.size(); // 最大尝试次数等于已给出的猜测次数 bool lastChance = false; for (int i = 0; i <= attempts && !lastChance; ++i) { int guess = guesses[i]; // 使用已知的猜测值 if (guess == target) { return i + 1; // 胜利，返回猜测次数 } else if (guess < target) { cout << "太低了 (" << guess << ")"; lastChance = i == attempts - 1; // 如果这是最后的猜测，标记为最后一次机会 } else { // guess > target cout << "太高了 (" << guess << ")"; lastChance = true; } } return -1; // 如果超过最大次数仍未能猜中，返回-1 } // 示例调用 int main() { vector<int> guesses = {2, 3, 5}; // 给出已有的猜测值 cout << guessNumber(10, guesses); return 0; } ```
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值