FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_01/id_1/LeetCode_153_1.java at master · feixiangcode/algorithm · GitHub
feixiangcode
/
algorithm
Public
forked from
algorithm001/algorithm
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
algorithm
/
Week_01
/
id_1
/
LeetCode_153_1.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
35 lines (31 loc) · 813 Bytes
Breadcrumbs
algorithm
/
Week_01
/
id_1
/
LeetCode_153_1.java
Copy path
File metadata and controls
35 lines (31 loc) · 813 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
class
Solution
{
public
int
findMin
(
int
[]
nums
) {
int
len
=
nums
.
length
;
if
(
len
==
1
) {
return
nums
[
0
];
}
int
min
=
0
;
int
max
=
len
-
1
;
if
(
nums
[
min
] <
nums
[
max
]) {
return
nums
[
min
];
}
int
mid
= (
min
+
max
) /
2
;
while
(
min
<=
max
) {
if
(
nums
[
min
] <
nums
[
mid
]) {
min
=
mid
;
mid
= (
min
+
max
) /
2
;
}
else
if
(
nums
[
min
] >
nums
[
mid
]){
max
=
mid
;
mid
= (
min
+
max
) /
2
;
}
else
{
break
;
}
}
if
(
min
<
len
-
1
) {
if
(
nums
[
min
] >
nums
[
min
+
1
]) {
return
nums
[
min
+
1
];
}
}
return
nums
[
min
];
}
}
Back
|
FazBrowse Home
|
New Git URL