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 vote236 views1 answer
Does np.random.randint have a seed
Python
3 votes223 views1 answer
Python remove non letters from string
Python
3 votes243 views1 answer
Python cmd to remove file
Python
11 votes291 views6 answers
Django create user
Python Django
15 votes262 views2 answers
Read excel into dataframe python
Python
0 vote242 views1 answer
Withdraw() opposite tjinter
Python
1 vote256 views2 answers
Python regex find first
Python
0 vote233 views1 answer
Pytorch reduce dataset dataloader
Python
0 vote253 views1 answer
Combine column in csv python pandas
Python
0 vote225 views1 answer
Tkinter responsive gui
Python