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 vote332 views3 answers
Char to charsequence in java
Java
5 votes375 views2 answers
Math.absolute java
Java
0 vote332 views1 answer
Mobile number validation to edittext in android
Java
7 votes329 views3 answers
2d arraylist in java
Java
0 vote378 views1 answer
How do I test the reverse method in java using jest
Java
-3 votes380 views2 answers
Multiplication table for number Java
Java
2 votes629 views2 answers
Spring boot connect to xampp mysql
Java
0 vote376 views1 answer
Multiple type array java
Java
0 vote347 views1 answer
Binary to octal conversion java program
Java
0 vote368 views1 answer
Concat result of List to one text java
Java