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 vote158 views1 answer
Entre clavier java
Java
1 vote241 views1 answer
Find shortest string in array java
Java
0 vote140 views1 answer
Single responsibility
Java
10 votes128 views1 answer
Intent android open activity
Java
0 vote139 views1 answer
Inorder, PreOrder, PostOrder java
Java
0 vote153 views1 answer
Java get parent process name
Java
1 vote165 views1 answer
Run specific test case junit
Java
0 vote135 views1 answer
Action media scanner scan file android 30 deprecated
Java
0 vote145 views1 answer
Format print java
Java
1 vote143 views2 answers
How to create dynamic string array in java
Java