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 vote113 views1 answer
How to open dialog box to select files in python
Python
0 vote128 views1 answer
Login views django template passing
Python
0 vote72 views1 answer
Onehotencoder example
Python
0 vote128 views1 answer
Python Tkinter timer animation
Python
4 votes135 views2 answers
Pil python image
Python
2 votes115 views1 answer
Frequency count of values in pandas dataframe
Python
5 votes111 views2 answers
Python check if a file is empty
Python
11 votes121 views6 answers
Dataframe delete duplicate rows with same column value
Python
1 vote107 views2 answers
Use Python to calculate (((1+2)*3)/4)^5
Python
1 vote118 views1 answer
Flask define template folder
Python