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 vote199 views1 answer
Java send an image over a socket
Java
0 vote171 views1 answer
How to check grant permissions in android
Java
0 vote189 views1 answer
How to make a ordering system in microsoft visual basic 2010 express console application
Java
1 vote189 views1 answer
Set look and feel system default java
Java
0 vote194 views1 answer
Java delete column from csv
Java
2 votes186 views1 answer
.charat() java
Java
-1 vote164 views1 answer
Save text in edditext java
Java
0 vote177 views1 answer
Java Target annotations attributes
Java
1 vote201 views1 answer
Spring serve robots.txt
Java
2 votes191 views2 answers
Format localdatetime
Java