class Solution:
def isIdealPermutation(self, nums: List[int]) -> bool:
min_A = [0] * len(nums)
min_A[-1] = nums[-1]
for i in range(len(nums)-2, -1, -1):
min_A[i] = min(min_A[i+1], nums[i])
for i in range(len(nums)-3, -1, -1):
if nums[i] > min_A[i+2]:
return False
return True
775. 全局倒置与局部倒置
最新推荐文章于 2024-06-29 23:38:16 发布