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 vote211 views2 answers
Android studio keep device awake
Java
3 votes244 views1 answer
Konnichiwa in japanese
Java
0 vote176 views1 answer
Stack push java
Java
0 vote188 views1 answer
Spring cli latest version
Java Spring
5 votes175 views2 answers
Android studio remove action bar
Java
1 vote175 views1 answer
Javafx filechooser specific file
Java
9 votes316 views2 answers
Change the default port in spring boot codegrepper
Java Spring
0 vote184 views1 answer
Java empty a combobox
Java
1 vote195 views1 answer
AddAll java
Java
0 vote282 views1 answer
Ternary operator in java for null check
Java