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 vote246 views1 answer
Huffman coding in Java
Java
0 vote239 views1 answer
Java code for square
Java
0 vote223 views1 answer
Hashmaps java
Java
0 vote231 views1 answer
Java eclipse console clear
Java
1 vote240 views2 answers
What is local variable in java
Java
0 vote224 views1 answer
Iterate map in java 8 using stream
Java
0 vote230 views1 answer
Xml button color not changing
Java
0 vote254 views2 answers
Spring tag library in jsp header
Java Spring
6 votes241 views2 answers
Document.set() firebasefirestore java
Java
5 votes210 views1 answer
Ubuntu change default java path
Java