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 vote333 views1 answer
Thymeleaf string not equal
Java
0 vote346 views3 answers
Float
Java
20 votes358 views2 answers
Color from hex code flutter
Java
0 vote338 views2 answers
Print line number java
Java
0 vote333 views1 answer
Android studio space
Java
0 vote400 views1 answer
Influx cli with docker container
Java
0 vote406 views1 answer
Spring Boot - Hashicorp Vault Integration
Java Spring
253 votes575 views6 answers
Math.random
Java
10 votes469 views2 answers
Change port in spring boot
Java Spring
5 votes344 views4 answers
File append in java
Java