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 vote131 views1 answer
Java quotes in string
Java
0 vote142 views3 answers
What city is 94609
Java
1 vote88 views1 answer
Combinations
Java
-1 vote130 views1 answer
Android activity keyboard hide
Java
2 votes125 views2 answers
Java get enum by ordinal
Java
0 vote120 views1 answer
Matlab leslie eigenvalue java
Java
0 vote117 views1 answer
How to make more than one jlabel at once in java
Java
1 vote114 views1 answer
Menghitung luas segitiga
Java
4 votes136 views1 answer
Int to double java
Java
2 votes123 views3 answers
Java string to lower case
Java