class Solution:
def checkPossibility(self, nums):
"""
:type nums: List[int]
:rtype: bool
"""
cnt=1
n=len(nums)
for i in range(1,n):
if nums[i]<nums[i-1]:
if cnt is 0:return False
if i==1 or nums[i]>=nums[i-2]:nums[i-1]=nums[i]
else:nums[i]=nums[i-1]
cnt-=1
return True
LeetCode-665.非递减数列
最新推荐文章于 2022-06-15 13:52:02 发布