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 vote150 views1 answer
Java-util of geofence polygon
Java
1 vote130 views1 answer
Import javax.validation.Valid error
Java
6 votes142 views4 answers
Install java in ubuntu 20.04
Java
0 vote124 views1 answer
Buscando Objeto do Array
Java
-1 vote134 views2 answers
Running Sum of 1d Array
Java
0 vote132 views1 answer
SpringBootStarter maven dependency
Java
0 vote127 views1 answer
Free pearson uk textbooks
Java
0 vote122 views1 answer
How to install java jdk 8 on ubuntu 20.04 for spark
Java
2 votes134 views1 answer
Android how to split string
Java
0 vote155 views1 answer
Convert date to offsetdatetime in java
Java