一、问题描述
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.
Subscribe to see which companies asked this question
二、解决思路
利用二分查找法,注意每次的mid的取值都是left+(right - left)/2,这点至关重要,开始我没注意到这点,结果就超时没通过~
三、代码
class Solution {
public:
int guessNumber(int n) {
if(guess(n) == 0)
return n;
int left = 1,right = n;
while(left < right){
int mid = left + (right - left) / 2;
if(guess(mid) == 0)
return mid;
else if(guess(mid) == 1)
left = mid;
else
right = mid;
}
return left;
}
};