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 vote135 views1 answer
How to use drop for file in python
Python
1 vote180 views1 answer
Get wav file in dir
Python
14 votes163 views6 answers
Binary search python
Python
1 vote144 views1 answer
Python not equal multiple values
Python
68 votes317 views2 answers
Pyton do while loop+
Python
0 vote183 views1 answer
Dev.to flask heroku
Python Flask
0 vote179 views1 answer
Django listview
Python Django
0 vote150 views1 answer
Pandas groupby mean round
Python
3 votes136 views5 answers
Calc
Python
2 votes208 views3 answers
Get absolute url django
Python Django