LeetCode374. Guess Number Higher or Lower——二分查找

最新推荐文章于 2024-09-04 15:29:39 发布

叶卡捷琳堡

最新推荐文章于 2024-09-04 15:29:39 发布

阅读量486

点赞数 8

文章标签：算法数据结构 leetcode 开发语言

本文链接：https://blog.csdn.net/weixin_46841376/article/details/136098284

版权

本文介绍了一个编程题目，玩家需通过调用预定义的`guess`API猜测一个从1到n之间的数字，每次给出提示是高了、低了还是相等。作者提供了一个使用二分查找算法的`Solution`类来解决此问题，满足给定的约束条件。

摘要由CSDN通过智能技术生成

文章目录

- 一、题目
- 二、题解

一、题目

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 will tell you whether the number I picked is higher or lower than your guess.

You call a pre-defined API int guess(int num), which returns three possible results:

-1: Your guess is higher than the number I picked (i.e. num > pick).
1: Your guess is lower than the number I picked (i.e. num < pick).
0: your guess is equal to the number I picked (i.e. num == pick).
Return the number that I picked.

Example 1:

Input: n = 10, pick = 6
Output: 6
Example 2:

Input: n = 1, pick = 1
Output: 1
Example 3:

Input: n = 2, pick = 1
Output: 1

Constraints:

1 <= n <= 231 - 1
1 <= pick <= n

二、题解

/** 
 * Forward declaration of guess API.
 * @param  num   your guess
 * @return 	     -1 if num is higher than the picked number
 *			      1 if num is lower than the picked number
 *               otherwise return 0
 * int guess(int num);
 */

class Solution {
public:
    int guessNumber(int n) {
        int l = 1,r = n;
        while(l <= r){
            int mid = l + ((r - l) >> 1);
            if(guess(mid) == 0) return mid;
            else if(guess(mid) == 1) l = mid + 1;
            else r = mid - 1;
        }
        return 0;
    }
};