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

0 vote125 views1 answer
Fly dfguyghj: Javascript
Java
0 vote153 views1 answer
Make handler running continuously
Java
13 votes224 views2 answers
Androidx cardview
Java
0 vote140 views1 answer
Intent flag clear task
Java
34 votes127 views6 answers
Java declare array
Java
7 votes125 views2 answers
Area of circle formula
Java
0 vote121 views1 answer
Automatic Code Completion in NetBeans
Java
0 vote133 views1 answer
Java sort arraylist of floats
Java
0 vote119 views1 answer
Print values of bst java
Java
0 vote152 views1 answer
Java scanner input float
Java