Leetcode 665 Non-decreasing Array 非递减数列 Python 实现

最新推荐文章于 2023-02-20 08:15:00 发布

VIP文章 chelseajcole

最新推荐文章于 2023-02-20 08:15:00 发布

阅读量245

点赞数

文章标签： leetcode python Array

本文链接：https://blog.csdn.net/chelseajcole/article/details/89279327

版权

题目：

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 1:

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

Example 2:

Input: [4,2,1]
Output: False
Explanation: You can't get a non-decreasing array by modify at most one element.

Note: The n belongs to [1, 10,000].

题目很容易理解，就是只能动一个数字，将数列调整成非递减数列，非递减的定义也给出了，就是前一个不能大于后一个大，换句话说，后一个大于等于前一个。好了，题目理解完，来解题。

先来说一个暴利解法，暴力解法是就是数列

优惠劵

关注关注