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 vote235 views4 answers
Java how to make a parameter optional
Java
0 vote231 views1 answer
Saving to a mongodb java
Java
0 vote242 views1 answer
Create a file in java in user home
Java
0 vote233 views3 answers
Number Formating in java
Java
0 vote242 views1 answer
Spring mvc aop transaction management
Java
3 votes249 views2 answers
Change size of array java
Java
0 vote236 views1 answer
Get ocurrences in array java
Java
14 votes237 views3 answers
Arraylist add method
Java
3 votes256 views6 answers
How to change the value of an arraylist in java
Java
0 vote251 views1 answer
What does .hasNext() do in java
Java