LeetCode : 665. Non-decreasing Array 修改一個位置使得數組非遞減

試題 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

>>阅读原文<<