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 vote181 views1 answer
Difference between final and constant in java
Java
0 vote157 views1 answer
TextInputEditText click event
Java
0 vote142 views1 answer
Remove unused imports android studio
Java
2 votes153 views1 answer
Call activity with data android studio
Java
0 vote183 views1 answer
Spring commandlinerunner example
Java Spring
0 vote151 views1 answer
Recyclerview stop scrolling
Java
1 vote217 views2 answers
Games
Java
0 vote143 views1 answer
How to add to a date in android
Java
0 vote145 views1 answer
Location.href webview android studio
Java
0 vote149 views1 answer
Java launch exe
Java