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 vote130 views1 answer
Keras load model with custom objects
Python
2 votes130 views1 answer
Pychamrfind and replace
Python
0 vote133 views1 answer
Wrds in python
Python
0 vote174 views1 answer
F-string print
Python
0 vote148 views1 answer
Print all variables jupyter notebook
Python
0 vote177 views1 answer
Python using string to access objects
Python
0 vote134 views1 answer
Username__icontains in django
Python
49 votes136 views6 answers
How to color print in python
Python
10 votes125 views1 answer
How to add legend to python plot
Python
0 vote161 views1 answer
Python get number of arguments of a function
Python