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 vote354 views1 answer
Android kotlin center text
Java
2 votes356 views2 answers
Apt install java 11
Java
0 vote352 views1 answer
Linked list Introduction
Java
3 votes346 views2 answers
Java infinite for loop
Java
0 vote332 views1 answer
How to change the color of a drawable programmically
Java
0 vote349 views3 answers
Cant change button color when app run android studio
Java
0 vote372 views2 answers
Java meeting scheduler
Java
0 vote357 views1 answer
Android sqlite insert or replace
Java
1 vote411 views1 answer
Set $JAVA_HOME variable in ubuntu
Java
0 vote374 views1 answer
Buy and sell stock
Java