给定包含n个整数的数组,至多改变其中一个数字,判断数组是否可以变为非递减有序
发现nums[i]>nums[i-1]时,对数组的调整只用考虑两种情况,1.将nums[i]置换为nums[i-1] ,2.将nums[i-1]置换为nums[i]
break提前结束了整个循环,continue结束了本轮循环,并开始下一轮循环。
class Solution(object):
def checkPossibility(self, nums):
"""
:type nums: List[int]
:rtype: bool
"""
onenums = nums[:]
twonums = nums[:]
for i in range(1,len(nums)):
if nums[i-1] > nums[i]:
onenums[i-1] = onenums[i]
twonums[i] = twonums[i-1]
break
return sorted(onenums) == onenums or sorted(twonums) == twonums