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 vote188 views1 answer
Python tkinter AttributeError: 'NoneType' object has no attribute 'insert'
Python
0 vote174 views1 answer
Adf test python
Python
0 vote167 views1 answer
Flask mongoengine getting started
Python
22 votes134 views2 answers
Range() function
Python
183 votes197 views6 answers
How to update pip python
Python
0 vote165 views1 answer
2 liste to a dictionary
Python
65 votes185 views6 answers
Create folder python
Python
0 vote180 views1 answer
Python convert to hmac sha256
Python
23 votes209 views6 answers
If in python
Python
0 vote174 views1 answer
Abrir notebooks jupyter administrador de archivos
Python