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 vote161 views3 answers
How to solve Caused by: java.lang.IllegalStateException: You need to use a Theme.AppCompat theme (or descendant) with this activity.
Java
4 votes164 views1 answer
Remeove space between date and time java
Java
3 votes182 views3 answers
Spring mvc
Java
0 vote166 views1 answer
Android java string video
Java
4 votes162 views2 answers
Integer.MAX_VALUE
Java
0 vote174 views1 answer
Java install in fedora
Java
0 vote183 views3 answers
Float
Java
2 votes185 views2 answers
Android settextcolor programmatically
Java
0 vote158 views1 answer
Java print stack
Java
1 vote169 views1 answer
Does set automatically get rid of duplicates in java
Java