Non-decreasing Array

最新推荐文章于 2024-09-21 10:02:17 发布

Goofiness

最新推荐文章于 2024-09-21 10:02:17 发布

阅读量67

点赞数

分类专栏： leetcode 文章标签： leetcode python

本文链接：https://blog.csdn.net/byr_wy/article/details/88700654

版权

leetcode 专栏收录该内容

232 篇文章 0 订阅

订阅专栏

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).

Example

Input: [4,2,3]
Output: True
Explanation: You could modify the first 4 to 1 to get a non-decreasing array.

Solution

class Solution:
    def checkPossibility(self, nums: List[int]) -> bool:
        count = 0
        if len(nums)==1:
            return True
        for i in range(len(nums)-1):
            if nums[i]>nums[i+1]:
                count += 1
                if i == 0:
                    nums[i] = nums[i+1]
                elif nums[i-1]<=nums[i+1]:
                    nums[i] = nums[i-1]
                else:
                    nums[i+1] = nums[i]
            if count>1:
                return False
        return True