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

2 votes208 views1 answer
Python keep value recursive function
Python
0 vote188 views1 answer
.lstrip()
Python
0 vote162 views1 answer
Range of y & x in scatter
Python
1 vote190 views2 answers
Changing default python version ubuntu
Python
7 votes254 views4 answers
Modules in python
Python
0 vote188 views1 answer
How to find permutation of numbers in python
Python
1 vote198 views1 answer
RuntimeError: error in LoadLibraryA
Python
0 vote187 views1 answer
Smtplib send pdf
Python
0 vote217 views2 answers
Call for a last number in series python
Python
1 vote204 views3 answers
Superuser creation skipped due to not running in a TTY.
Python