Skip to content

Commit 3a04d35

Browse files
Create MinimumInRotatedSortedArray.java
1 parent 2ee1951 commit 3a04d35

1 file changed

Lines changed: 22 additions & 0 deletions

File tree

Lines changed: 22 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
class MinimumInRotatedSortedArray {
2+
public int findMin(int[] nums) {
3+
int s = 0;
4+
int e = nums.length-1;
5+
6+
if(nums[s] <= nums[e]){
7+
return nums[s];
8+
}
9+
10+
while(s < e){
11+
int mid = s + (e-s)/2;
12+
if(nums[mid] > nums[e]){ // min lies in the right side
13+
s = mid+1;
14+
}
15+
else{ // min lies in the left side
16+
e = mid;
17+
}
18+
}
19+
20+
return nums[s];
21+
}
22+
}

0 commit comments

Comments
 (0)