[LeetCode]374. Guess Number Higher or Lower<Binary Search>

注意两点。1、low=mid+1; high=mid;

2、mid=(high-low)/2+low; 不可以用mid=(low+high)/2，因为加了以后数据有可能会溢出。

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.

/* The guess API is defined in the parent class GuessGame.
   @param num, your guess
   @return -1 if my number is lower, 1 if my number is higher, otherwise return 0
      int guess(int num); */

public class Solution extends GuessGame {
    public int guessNumber(int n) {
        int low=1, high=n;
        int mytry=(high-low)/2+low;
        int res=guess(mytry);
        while(res!=0){
            if(res>0) low=mytry+1;
            else high=mytry;
            mytry=(high-low)/2+low;
            res=guess(mytry);
        }
        return mytry;
    }
}