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 views1 answer
Multi dimensional array declaration in java
Java
0 vote324 views1 answer
Reading data from wsdl in java
Java
0 vote331 views1 answer
Counting nodes in binary search tree
Java
0 vote323 views1 answer
Java static generic method
Java
0 vote356 views1 answer
Hide element selenium
Java
0 vote349 views1 answer
Java coding standards for constants
Java
0 vote351 views1 answer
Java isalphanum
Java
0 vote335 views1 answer
Mobile view next and previous button
Java
30 votes378 views3 answers
How to get the time in java
Java
0 vote327 views1 answer
Create thread
Java