FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
coding-Interview/FindMinimumRotatedSortedArray.java at master · arjunmullick/coding-Interview · GitHub
arjunmullick
/
coding-Interview
Public
Notifications
You must be signed in to change notification settings
Fork
1
Star
3
Code
Issues
0
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
coding-Interview
/
FindMinimumRotatedSortedArray.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
24 lines (22 loc) · 610 Bytes
Breadcrumbs
coding-Interview
/
FindMinimumRotatedSortedArray.java
Copy path
File metadata and controls
24 lines (22 loc) · 610 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
package
com
.
leetcode
;
public
class
FindMinimumRotatedSortedArray
{
//4 , 5, 6 , 7 , 2, 3
// mid 6 > r 3 - means min is on right
// else its on left
class
Solution
{
public
int
findMin
(
int
[]
nums
) {
int
n
=
nums
.
length
;
int
l
=
0
;
int
r
=
n
-
1
;
while
(
l
<
r
){
int
mid
=
l
+ (
r
-
l
)/
2
;
if
(
nums
[
mid
] <
nums
[
r
]){
// irrlevant nums[mid] < nums[mid+1] &&
r
=
mid
;
}
else
{
l
=
mid
+
1
;
}
}
return
nums
[
r
];
}
}
}
Back
|
FazBrowse Home
|
New Git URL