374. Guess Number Higher or Lower(简单二分法的实现)

最新推荐文章于 2024-10-07 07:09:00 发布

鸡蛋灌饼想加辣条

最新推荐文章于 2024-10-07 07:09:00 发布

阅读量92

点赞数

分类专栏：每日Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/gyhjlauy/article/details/100550934

版权

每日Leetcode 专栏收录该内容

124 篇文章 0 订阅

订阅专栏

problem：

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 lower.

You call a pre-defined API guess(int num) which returns 3 possible results (-1, 1, or 0):

-1 : My number is lower
1 : My number is higher
0 : Congrats! You got it!

Example :

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

tip:

找出给定的值，使用二分法即可实现。

solution:

int guess(int num);

class Solution {
public:
    int guessNumber(int n) 
    {
        int low = 1;
        int high = n;
        while(low <= high)
        {
            int mid = low+(high-low)/2;
            if(guess(mid) == 0) return mid;
            else
                if(guess(mid) == -1) high = mid-1;
            else 
                if(guess(mid) == 1) low = mid+1;
        } 
        return -1;
    }
};

以下写法效率更高：

class Solution {
public:
    int guessNumber(int n) 
    {
        int low = 1;
        int high = n;
        while(low <= high)
        {
            int mid = low+(high-low)/2;
            int kid = guess(mid);
            if(kid == 0) return mid;
            else
                    if(kid == -1) high = mid-1;
                else 
                    if(kid == 1) low = mid+1;
        } 
        return -1;
    }
};