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

1 vote334 views1 answer
Evaluate how much a python program memory
Python
0 vote352 views1 answer
Range function in python use cases
Python
1 vote320 views1 answer
Pages.User Settings.user: (fields.W342) Setting unique=True on a Foreign Key
Python
7 votes344 views2 answers
How to get index of pandas dataframe python
Python
1 vote355 views1 answer
Return result from exec python
Python
0 vote316 views1 answer
Exercism phone number python
Python
1 vote337 views1 answer
Python cv2.Canny()
Python
1 vote317 views1 answer
Discord python command alias
Python
0 vote335 views3 answers
Click on button tag with only class selenium python
Python
0 vote344 views1 answer
Hidden semi markov model python from scratch
Python