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 vote214 views2 answers
How to sum only the even values in python
Python
3 votes213 views4 answers
If or Python
Python
1 vote200 views1 answer
Cannot be loaded as Python module
Python
0 vote227 views1 answer
-bash: /usr/local/bin/python3: no such file or directory
Python
0 vote214 views1 answer
Machine learning project outline
Python
0 vote216 views1 answer
How to stop all pygame mixer sound
Python
4 votes198 views1 answer
Replace empty string and "records with only spaces" with npnan pandas
Python
0 vote198 views1 answer
Pandas separator are multiple spaces
Python
0 vote210 views1 answer
Create folders with subfolders python
Python
5 votes223 views3 answers
Remove help command discord py
Python