-
Notifications
You must be signed in to change notification settings - Fork 2
/
374.GuessNumberHigherOrLower.cpp
89 lines (85 loc) · 1.89 KB
/
374.GuessNumberHigherOrLower.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
/*
* @lc app=leetcode id=374 lang=cpp
*
* [374] Guess Number Higher or Lower
*
* https://leetcode.com/problems/guess-number-higher-or-lower/description/
*
* algorithms
* Easy (44.61%)
* Likes: 566
* Dislikes: 2035
* Total Accepted: 190.3K
* Total Submissions: 425K
* Testcase Example: '10\n6'
*
* 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 will tell you whether the number I picked is
* higher or lower than your guess.
*
* You call a pre-defined API int guess(int num), which returns 3 possible
* results:
*
*
* -1: The number I picked is lower than your guess (i.e. pick < num).
* 1: The number I picked is higher than your guess (i.e. pick > num).
* 0: The number I picked is equal to your guess (i.e. pick == num).
*
*
* Return the number that I picked.
*
*
* Example 1:
* Input: n = 10, pick = 6
* Output: 6
* Example 2:
* Input: n = 1, pick = 1
* Output: 1
* Example 3:
* Input: n = 2, pick = 1
* Output: 1
* Example 4:
* Input: n = 2, pick = 2
* Output: 2
*
*
* Constraints:
*
*
* 1 <= n <= 2^31 - 1
* 1 <= pick <= n
*
*
*/
// @lc code=start
/**
* 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);
*/
int guess(int num);
class Solution {
public:
int guessNumber(int n) {
int left = 1;
int right = n;
while (left < right) {
int mid = ((long)left + right) / 2;
if (guess(mid) == 0) {
return mid;
} else if (guess(mid) == 1) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return left;
}
};
// @lc code=end