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 vote173 views1 answer
Python replace 0 in series
Python
0 vote180 views2 answers
Django template in views.py
Python Django
0 vote156 views1 answer
Pandas exploring dataframe
Python
0 vote154 views2 answers
Spyder 32 bit download
Python
0 vote145 views1 answer
Python count bits
Python
0 vote150 views1 answer
TypeError: can't pickle weakref objects site:stackoverflow.com
Python
0 vote142 views1 answer
Change orientatin of dict read pandas
Python
1 vote165 views1 answer
Erreur install pyaudio
Python
0 vote170 views1 answer
Root.iconbitmap
Python
0 vote148 views1 answer
Redirect user based on input with python cgi code
Python