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

2 votes289 views1 answer
Rjava error
Java
11 votes295 views3 answers
How to remove letters from string java
Java
1 vote310 views1 answer
View binding in recyclerview adapter android java
Java
10 votes349 views5 answers
Remove spaces java
Java
8 votes299 views2 answers
Arraylist reverse in java
Java
0 vote311 views1 answer
How to find the size of a queue in java
Java
1 vote298 views1 answer
How to convert a collection to array in java
Java
0 vote319 views1 answer
Action bar message spigot 1.8
Java
2 votes340 views1 answer
Spigot how to make an inventory
Java
0 vote344 views1 answer
Bad notification for startForeground: java.lang.RuntimeException: invalid channel for service notification: Notification
Java