LeetCode 665. Non-decreasing Array(LCS思想)

Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element.web We define an array is non-decreasing if array[i] <= array[i + 1] holds for ev
相关文章
相关标签/搜索