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

13 votes223 views6 answers
Range parameters python
Python
0 vote231 views1 answer
Python logging to syslog linux
Python
0 vote220 views1 answer
Unique_together what is used of it in django
Python Django
0 vote224 views1 answer
Drop colums whoose value are object type in python
Python
0 vote220 views1 answer
How to install gym
Python
0 vote229 views1 answer
Can't use "pyimage2" as iconphoto
Python
0 vote233 views1 answer
Apply strip() a column in pandas
Python
2 votes217 views1 answer
Tkinter execute function on enter
Python
0 vote174 views1 answer
A chef has a large container full of olive oil. In one night, after he used 252525 quarts of olive oil, 35.9\%35.9%35, point, 9, percent of the full container of olive oil remained. How many quarts of olive oil remained in the container?
Python
0 vote241 views1 answer
Python subprocess.run output
Python