每次思考都是一次进步
1、这个就不用多说了吧,经典的引出二分查找概念的示例。
/**
* Forward declaration of guess API.
* @param num your guess
* @return -1 if num is lower than the guess number
* 1 if num is higher than the guess number
* otherwise return 0
* int guess(int num);
*/
class Solution {
public:
int guessNumber(int n) {
int l=0,r=n;
while(l<r)
{
int mid=l+(r-l)/2;
if(guess(mid)==1) l=mid+1;
else if(guess(mid)==-1) r=mid;
else return mid;
}
return l;
}
};