#3738

Longest Non-Decreasing Subarray After Replacing at Most One Element

expert · 1185 · lc medium +32 · 21.6% accepted · 93 likes · top 2%

Description

Given an integer array nums with permission to replace at most one element with any integer of your choice, return the length of the longest non-decreasing subarray achievable.

Code

1

2

3

class Solution:
    def longestSubarray(self, nums: List[int]) -> int:

class Solution:
    def longestSubarray(self, nums: List[int]) -> int: