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 vote211 views3 answers
OpenCV(3.4.11) Error: Assertion failed (_img.rows * _img.cols == vecSize) in CvCascadeImageReader::PosReader::get
Python
0 vote210 views1 answer
Keras unbalanced data
Python
0 vote205 views1 answer
Add one to a column pands
Python
0 vote239 views1 answer
How do i re-restablish the third reich
Python
0 vote205 views1 answer
HTTPSConnectionPool(host='files.pythonhosted.org', port=443): Read timed out
Python
4 votes221 views3 answers
How to change text in a canvas tkinter
Python
0 vote219 views1 answer
Webview_flutter
Python
0 vote198 views1 answer
Primary key auto increment python django
Python
36 votes192 views4 answers
Python sum
Python
0 vote190 views1 answer
Encoding read_csv
Python