Leetcode 第 374 题(Guess Number Higher or Lower)

Leetcode 第 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 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:
n = 10, I pick 6.

Return 6.

这道题是比较简单的猜数游戏。适合使用二分查找法来确定结果。需要注意的有一个地方，当二分查找法的区间缩短到 1 时，直接取平均来求中间值的话得到的永远是较小的那个值，这会导致死循环。下面的代码根据 mid 值与真实值直接的关系来合理的确定下一个 mid 值。

int guessNumber(int n)
{
    int low = 1;
    int high = n;
    int mid = low + (high - low) / 2;
    char res = guess(mid);
    while(res != 0)
    {
        if( res  == 1)
        {
            low = mid;
            mid = high - (high - low) / 2;
        }
        else
        {
            high = mid;
            mid = low + (high - low) / 2;
        }
        res = guess(mid);
    }
    return mid;
}