Longest Peak

refer to: https://www.algoexpert.io/questions/Longest%20Peak

---

Problem Statement

Sample

 

 

 Analysis

 

 Code

def longestPeak(array):
    # Write your code here.
    longestPeakLength = 0
    i = 1 # the first one(index 0) can not be the peak
    while i < len(array) - 1: #check peak element
        isPeak = array[i-1] < array[i] and array[i] > array[i+1]
        if not isPeak:
            i += 1
            continue
        leftIdx = i - 2 # expand the left side around peak
        while leftIdx >=0 and array[leftIdx] < array[leftIdx + 1]:
            leftIdx -= 1
        rightIdx = i + 2# expand the right side around peak
        while rightIdx < len(array) and array[rightIdx] < array[rightIdx - 1]:
            rightIdx += 1
        
        currentPeakLength = rightIdx - leftIdx - 1 # calculate the length of current peak
        longestPeakLength = max(longestPeakLength, currentPeakLength) # update the longest length of peak
        i = rightIdx # update i, inside the rightIdx will be the part of calculated peak, we don't need to recalculate
    return longestPeakLength
            

Time and Space complexity

Time: O(N)-> outer loop. iterate the array once, inner loop, every element will be checked at most two or three times.(2N + 3N) -> O(N)

Space: O(1)