leetcode

0 class Solution {

1 public:

2 int guessNumber(int n) {

3 int low = 1, high = n;

4 while (true) {

5 int mid = low + (high - low) / 2;

6 switch (guess(mid)) {

7 case 0: return mid;

8 case 1: low = mid + 1; break;

9 case -1: high = mid - 1; break;

10 default: return -1;

11 }

12 }

13 return -1;

14 }

15 };