We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent ed259ed commit 39d9564Copy full SHA for 39d9564
java/852. Peak Index in a Mountain Array.java
@@ -0,0 +1,18 @@
1
+//Use binary search
2
+class Solution {
3
+ public int peakIndexInMountainArray(int[] arr) {
4
+ int start = 0;
5
+ int end = arr.length;
6
+ int n = arr.length;
7
+ while (start<=end) {
8
+ int mid = start+(end-start)/2;
9
+ if (mid!=0 && mid!=n-1 && arr[mid-1]<arr[mid] && arr[mid+1]<arr[mid])
10
+ return mid;
11
+ else if (mid!=n-1 && arr[mid+1]>arr[mid])
12
+ start = mid+1;
13
+ else if (mid!=0 && arr[mid-1]>arr[mid])
14
+ end = mid-1;
15
+ }
16
+ return end;
17
18
+}
0 commit comments