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 vote130 views1 answer
Python get current process id
Python
0 vote206 views1 answer
Tkinter file dialog multiple file types
Python
0 vote193 views1 answer
Fibonacci sequence generator python
Python
0 vote170 views1 answer
Pandas insert a list into cell
Python
1 vote181 views1 answer
ModuleNotFoundError: No module named 'transforms3d'
Python
1 vote169 views3 answers
Typeerror:
Python
0 vote175 views1 answer
Raspberry pi push button function control python
Python
0 vote196 views1 answer
Programme phyton pour realiser un programme qui transforme une image en niveau de gris
Python
0 vote191 views1 answer
Pathlib path of current file
Python
0 vote184 views1 answer
Converting 4hr 20min to minutes
Python