-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathguess_number_higher_or_lower.dart
102 lines (80 loc) · 1.84 KB
/
guess_number_higher_or_lower.dart
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
90
91
92
93
94
95
96
97
98
99
100
101
102
/*
-* 374. Guess Number Higher or Lower *-
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 three possible results:
-1: Your guess is higher than the number I picked (i.e. num > pick).
1: Your guess is lower than the number I picked (i.e. num < pick).
0: your guess is equal to the number I picked (i.e. num == pick).
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
Constraints:
1 <= n <= 231 - 1
1 <= pick <= n
Accepted
416,581
Submissions
815,531
*/
int guess(int number) => number;
class A {
int guessNumber(int n) {
int low = 1;
int high = n;
while (low <= high) {
int mid = low + (high - low) ~/ 2;
int g = guess(mid);
if (g == 0) {
return mid;
} else if (g == -1) {
high = mid - 1;
} else {
low = mid + 1;
}
}
return -1;
}
}
class B {
int guessNumber(int n) {
int i = 1, mid = n ~/ 2, k, l = 0;
if (guess(mid) == 0)
return mid;
else if (guess(mid) == -1) {
k = mid;
l = 0;
} else
k = n;
l = mid;
for (i = l; i < k; i++) {
if (guess(i) == 0) break;
}
return i;
}
}
class C {
int guessNumber(int n) {
return binarySearch(0, n);
}
int binarySearch(int start, int end) {
if (start > end) return -1;
int mid = start + (end - start) ~/ 2;
switch (guess(mid)) {
case -1:
return binarySearch(start, mid - 1);
case 1:
return binarySearch(mid + 1, end);
default:
return mid;
}
}
}