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 vote285 views1 answer
Sort the map by values
Java
0 vote333 views1 answer
Change button background drawable in code
Java
1 vote291 views1 answer
Java map values to list
Java
0 vote324 views1 answer
Sethomebutton listener android
Java
1 vote303 views1 answer
Java get enum from string
Java
22 votes284 views2 answers
Java close application
Java
2 votes314 views1 answer
Date difference in minutes java
Java
0 vote289 views1 answer
Printing array list through for loop in java
Java
0 vote308 views1 answer
BasicAWSCredentials
Java
8 votes301 views6 answers
Print list in java
Java