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.
思路:先用迭代的方式做,就是每次都猜中间数。注意要用double型,否则会因为约去后面的小数部分而造成错误。
// 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) {
if(n<=1) return n;
double i=1,j=n;
while(1)
{
switch (guess((i+j)/2))
{
case 1:
i=(i+j)/2;
break;
case 0:
return (i+j)/2;
break;
case -1:j=(i+j)/2;
break;
}
}
}
};
以下是我写的递归实现,应注意要写default语句,否则会报返回值错误。
// 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) {
return (int)bisearch(1,n);
}
double bisearch(double i,double j)
{
double a=0;
switch(guess((i+j)/2))
{
case -1:
a=bisearch(i,(i+j)/2);
return a;
break;
case 0:
a=(i+j)/2;
return a;
break;
case 1:
a=bisearch((i+j)/2,j);
return a;
break;
default:
return 0;
}
}
};