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 vote119 views1 answer
System.out.println(h [2] [1] [1] [0]);
Java
0 vote121 views1 answer
Console java echo hello you
Java
0 vote118 views1 answer
Add dynamic view in android from xml
Java
10 votes105 views4 answers
Java sort 2d array
Java
0 vote108 views1 answer
Android how to know when snackbar is done
Java
1 vote112 views1 answer
Object type in java
Java
0 vote124 views1 answer
Java read public key from keystore
Java
0 vote108 views1 answer
List all android sensors in java
Java
2 votes130 views3 answers
Upcasting and downcasting in java
Java
0 vote141 views1 answer
Read wss endpoint java
Java