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 vote109 views1 answer
You may test the newly compiled and packaged JAR in maven
Java
1 vote126 views6 answers
Insertion sorting
Java
0 vote96 views1 answer
BodyContentImpl memory leak
Java
0 vote99 views1 answer
Unmappable character java
Java
-2 votes108 views1 answer
Difference between void and return method in java
Java
0 vote141 views1 answer
Cookie jsf
Java
0 vote112 views1 answer
Sealed class java codegrepper
Java
0 vote112 views3 answers
Get numbers from a string
Java
55 votes111 views4 answers
How to get last element in java
Java
0 vote101 views1 answer
Java copy string
Java