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 vote206 views1 answer
Multiple type array java
Java
0 vote221 views1 answer
What is the difference between Error and Exception? java
Java
1 vote197 views6 answers
This version of the Android Support plugin for IntelliJ IDEA (or Android Studio) cannot open this project, please retry with version 4.1 or newer.
Java
1 vote201 views1 answer
Mutable string in java
Java
0 vote207 views1 answer
Select photo from camera android
Java
0 vote235 views1 answer
Write a java program to print a number from the user
Java
5 votes170 views2 answers
String startswith java
Java
3 votes198 views1 answer
Java get mouse position on screen
Java
0 vote211 views1 answer
How to generate increasing random numbers in java
Java
0 vote215 views3 answers
Get selected item spinner
Java