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

4 votes261 views1 answer
Java thread class sleep
Java
0 vote243 views1 answer
GetMapping("/rest/v1/books") in spring rest api
Java
0 vote277 views1 answer
Java init arraylist string
Java
1 vote275 views1 answer
Edittext hint color
Java
9 votes271 views3 answers
Function in java
Java
0 vote269 views1 answer
How to connect from Android emulator to application on localhost?
Java
0 vote274 views2 answers
Java localtime
Java
0 vote270 views1 answer
How do you rate yourself in java
Java
1 vote215 views1 answer
Observer vs observable
Java
0 vote272 views1 answer
Why are my if statements not working with inputs in java
Java