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

17 votes354 views6 answers
Django model
Python Django
3 votes304 views1 answer
Python strlen
Python
0 vote336 views1 answer
Python simple number formatting samples
Python
1 vote280 views1 answer
Python type hint for a string
Python
0 vote277 views1 answer
Subprocess the system cannot find the file specifie
Python
0 vote305 views1 answer
Argsort in descending order numpy
Python
28 votes341 views2 answers
Simple python for loop print 1 to 5
Python
1 vote315 views1 answer
Test cuda pytorch
Python
0 vote302 views1 answer
.replace pandas in for loop
Python
0 vote605 views1 answer
UserWarning: X does not have valid feature names, but LinearRegression was fitted with feature names
Python