Mountain array leetcode

class Solution:
    def peakIndexInMountainArray(self, arr: List[int]) -> int:
        start = 0
        end = len(arr)-1
        
        while (start < end):
            mid = start + (end-start)//2
            if (arr[mid]>arr[mid+1]):
                end = mid
            else: start = mid+1
        return start

Mountain array leetcode

class Solution {    
    public static int peakIndexInMountainArray(int[] arr) {
        int start = 0;
        int end = arr.length-1;

        while(start < end){
            int mid = start + (end-start)/2;

            if (arr[mid] > arr[mid+1]) end = mid;
            else start = mid+1;
        }
        return start;
    }
}

Similar codes

1 vote196 views1 answer
Convert datetime to custom format in java 8
Java
8 votes191 views10 answers
Print
Java
9 votes191 views3 answers
Java long to int
Java
1 vote175 views1 answer
Dagger kapt dependency and plugin
Java
1 vote187 views1 answer
How to create a variable java
Java
1 vote288 views1 answer
Execute application jar
Java
1 vote245 views1 answer
How to create a circle in java
Java
0 vote190 views1 answer
Case sensitive in java
Java
0 vote193 views1 answer
Java setting logging with rotation logback
Java
0 vote189 views1 answer
Java asynchronous programming example
Java