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

15 votes344 views1 answer
Python dict to kwargs
Python
63 votes390 views4 answers
Python find in string
Python
0 vote364 views1 answer
Finding the Sum of a Symmetrical Sub-List
Python
1 vote330 views2 answers
How to find rows with missing data in pandas
Python
0 vote337 views1 answer
Extends template django file system
Python
1 vote362 views2 answers
Lastindexof python
Python
19 votes353 views3 answers
Python list with all letters
Python
0 vote341 views1 answer
Best algorithm for classification
Python
-1 vote350 views1 answer
Phyton datetime comparison
Python
24 votes367 views3 answers
Tkinter image
Python