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 vote209 views1 answer
Java question mark operator
Java
0 vote215 views1 answer
Encrypt words facebook
Java
0 vote195 views1 answer
How does minus works in Java
Java
1 vote178 views1 answer
Java replace string case insensitive
Java
0 vote191 views1 answer
V2ray
Java
3 votes205 views1 answer
Java get next enum
Java
0 vote196 views1 answer
Type mismatch cannot convert from string to string in java cucumber
Java
1 vote194 views1 answer
Change color of eclipse editor
Java
0 vote249 views1 answer
Convert arraylist to csv file java
Java
0 vote218 views1 answer
Reading string after double in java
Java