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 vote229 views1 answer
Long in java
Java
0 vote253 views1 answer
Spring yml property boolean
Java Spring
0 vote221 views1 answer
Open camera or gallery on button click android
Java
0 vote196 views1 answer
[ERROR] Error executing Maven. java.io.FileNotFoundException: The specified user settings file does not exist: /usr/lib/jvm/java-1.8.0-openjdk-amd64
Java
0 vote217 views1 answer
Como criar uma classe em java
Java
0 vote232 views2 answers
Math square java
Java
4 votes213 views2 answers
Java create directory if not exists
Java
0 vote215 views1 answer
Instantiate matrix java
Java
0 vote207 views1 answer
How to iterate pixels image java
Java
0 vote212 views4 answers
Java loop through array
Java