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 vote138 views1 answer
Java ordenar los valores de un array de menor a mayor
Java
0 vote164 views1 answer
Java spring boot json deserialize date inaccurate
Java Spring
1 vote145 views1 answer
Default method in interface java
Java
0 vote183 views1 answer
Display an image java
Java
0 vote134 views1 answer
Java escribir ventana grafica
Java
0 vote140 views1 answer
Enlist Operations in ComboBox (Addition, Subtraction, Division, Multiplication in java
Java
1 vote141 views2 answers
Import in java
Java
0 vote142 views2 answers
Also in java
Java
13 votes159 views2 answers
Java version command
Java
4 votes162 views1 answer
Java remove while iterating
Java