FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
leetcode/findminimuminrotatedsortedarrayII.java at master · wpande/leetcode · GitHub
wpande
leetcode
Repository navigation
Code
Issues
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
leetcode
/
findminimuminrotatedsortedarrayII.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
10 lines (10 loc) · 230 Bytes
Breadcrumbs
leetcode
/
findminimuminrotatedsortedarrayII.java
Copy path
File metadata and controls
10 lines (10 loc) · 230 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
public
class
Solution
{
public
int
findMin
(
int
[]
nums
) {
int
res
=
nums
[
0
];
int
len
=
nums
.
length
;
for
(
int
i
=
1
;
i
<
len
;
i
++)
if
(
nums
[
i
]<
res
)
res
=
nums
[
i
];
return
res
;
}
}
Back
|
FazBrowse Home
|
New Git URL