标签：
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
分析：
这恐怕是最简单的二分法面试题！
// Forward declaration of guess API.
// @param num, your guess
// @return -1 if my number is lower, 1 if my number is higher, otherwise return 0
int guess(int num);
class Solution {
public:
int guessNumber(int n) {
int mid=0,left=1,right=n;
while(left < right)
{
mid=left+(right-left)/2;
if(guess(mid)==0)
return mid;
else if(guess(mid) == 1)
left=mid+1;
else
right=mid-1;
}
return left;
}
};注：本博文为EbowTang原创，后续可能继续更新本文。如果转载，请务必复制本条信息！
原文地址：http://blog.csdn.net/ebowtang/article/details/51812032
原作者博客：http://blog.csdn.net/ebowtang
本博客LeetCode题解索引：http://blog.csdn.net/ebowtang/article/details/50668895
<LeetCode OJ> 374. Guess Number Higher or Lower
标签：
原文地址：http://blog.csdn.net/ebowtang/article/details/51912969
