every blog every motto: You will never know unless you try
0. 前言
无
1. 正文
1.1 题目
1.2 题解
python:
class Solution:
def checkPossibility(self, nums: List[int]) -> bool:
N = len(nums)
count = 0 # 计数
for i in range(1,N):
if nums[i]< nums[i-1]:
count+=1
# 当前为第二个数或，当前数大于前面的第二个数
# 修改 nums[i-1]
if i==1 or nums[i]>=nums[i-2]:
nums[i-1] = nums[i]
else:
nums[i]=nums[i-1]
return count<=1
1.3 结果
