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.
We define an array is non-decreasing if array[i] <= array[i + 1] holds for every i (1 <= i < n).
问题可视化
让问题可视化,从上图可以看出来,如果删除
原创
2020-09-22 14:46:48 ·
171 阅读 ·
0 评论