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

5 votes323 views1 answer
Binary string to int java
Java
0 vote332 views2 answers
How to create a console in java gui
Java
1 vote340 views1 answer
Android switch on change
Java
0 vote342 views1 answer
SPOJ Prime1
Java
9 votes340 views2 answers
Input array through scanner in java
Java
0 vote284 views0 answer
Java
0 vote336 views1 answer
Quick sort in java progrmmieren
Java
1 vote326 views1 answer
Rewrite file java
Java
0 vote343 views1 answer
Java regex replace all characters before
Java
1 vote393 views1 answer
What is java plug-in
Java