Leetcode之Non-decreasing Array 问题

最新推荐文章于 2021-07-01 13:49:53 发布

xu2645318400

最新推荐文章于 2021-07-01 13:49:53 发布

阅读量1.1k

点赞数

分类专栏： leetcode 文章标签： java leetcode 算法面试

本文链接：https://blog.csdn.net/xu2645318400/article/details/78064755

版权

本文探讨LeetCode上的Non-decreasing Array问题，解释如何通过最多修改一个元素使数组变得非递减。文章分析了两种情况：一是前一个元素大于当前元素，但前两个元素小于等于当前元素；二是前两个元素都大于当前元素。文章提供了一种贪心策略，并给出了Java实现代码。

摘要由CSDN通过智能技术生成

问题描述：

Given an array with n integers, your task is to check if it could become non-decreasing bymodifying at most 1 element.

We define an array is non-decreasing if array[i] <= array[i + 1] holds for everyi (1 <= i < n).

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

示例一：

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

示例二：

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

问题来源：

最低0.47元/天解锁文章

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

xu2645318400

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
复制链接

分享到 QQ

分享到新浪微博

扫一扫

专栏目录

LeetCode --- 665. Non-decreasing Array 解题报告

杨鑫newlife的专栏

05-13

276

Given an arraynumswithnintegers, your task is to check if it could become non-decreasing by modifyingat most1element. We define an array is non-decreasing ifnums[i] <= nums[i + 1]holds for everyi(0-based) such that(0<= i <= n - 2). ...

LeetCode-665：Non-decreasing Array (判断是否为非递减数组)

大树先生的博客

10-25

2211

给定数组，判断是否能够只修改一个元素，就可以使得数组是非递减数组

参与评论您还未登录，请先登录后发表或查看评论

【数论】Non-Decreasing Digit

Ted's 游乐园

04-02

1168

Description A number is said to be made up of non-decreasing digits if all the digits to the left of any digit is less than or equal to that digit. For example, the four-digit number 1234 is compo

leetcode 665. Non-decreasing Array（非下降数组）

蓝羽飞鸟的博客

11-14

134

Given an array nums 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 nums[i] <= nums[i + 1] holds for every i (0-based) such that (0 <= i <= n - 2). Ex

C#LeetCode刷题之#665-非递减数列（ Non-decreasing Array）

热门推荐

比特飞

09-05

1万+

问题给定一个长度为 n 的整数数组，你的任务是判断在最多改变 1 个元素的情况下，该数组能否变成一个非递减数列。我们是这样定义一个非递减数列的：对于数组中所有的 i (1 <= i < n)，满足 array[i] <= array[i + 1]。输入: [4,2,3] 输出: True 解释: 你可以通过把第一个4变成1来使得它成为一个非递减数列。输...

Leetcode 665. Non-decreasing Array

SnailTyan

07-01

121

文章作者：Tyan 博客：noahsnail.com | CSDN | 简书 1. Description 2. Solution **解析：**Version 1首先对前后相邻的两个值进行比较，统计当前值nums[i]大于后值num[i+1]的次数，并保存当前值的索引index，如果一次没出现，说明当前数组为非递减数组，如果大于两次，只修改一个值的情况下不可能变为非递减数组。当只出现一次时，需要具体分析相关情况。当nums[index]位于数组第一个(0)

Leetcode.665 Non-decreasing Array(替换一个数成为非降序数组)

侠客小虎的博客

08-09

274

1.题目 Given an array nums 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 nums[i] <= nums[i + 1] holds for every i (0-based) such that (0 <= i <= n - 2

LeetCode 665：非递减数列（Non-decreasing Array）解法汇总

Utopiabuntu的博客

04-08

340

文章目录我的解法思路暴力解法（超时）官方的解法2/3从评论中看到一个讲的比较清楚的做法我的解法思路可以很容易想到，输出True的序列一定是在一个原来有序的序列中插入了一个元素导致整个序列出现了一个逆序对，而逆序对无非两种情况。如下图：删除逆序对的第一个元素，则序列有序删除逆序对的第二个元素，则序列有序因此，只要找到这个逆序对，删除第一个或第二个元素，如果删除某个元素之后序列有序则...

LeetCode——665. 非递减数列(Non-decreasing Array)——分析及代码（Java）

江南土豆的博客

02-16

205

LeetCode——665. 非递减数列[Non-decreasing Array]——分析及代码[Java]一、题目二、分析及代码1. 直接修改（1）思路（2）代码（3）结果三、其他一、题目给你一个长度为 n 的整数数组，请你判断在最多改变 1 个元素的情况下，该数组能否变成一个非递减数列。我们是这样定义一个非递减数列的：对于数组中所有的 i (0 <= i <= n-2)，总满足 nums[i] <= nums[i + 1]

[ARC086]D - Non-decreasing 构造

DOFYPXY的博客

12-14

408

题面考虑这么一种构造方案：先找到绝对值最大的那个数a[max]；若a[max]为正：我们把做两次add a[max] a[n]，这时a[n]显然是最大的正数，接下来从1~n-1，分别做 add a[n] a[i]，add a[n] a[n]。若a[max]为负：我们把做两次add a[max] a[1]，这时a[1]显然是最小的负数，接下来从n~2，分别做 add a[1] a[i]

非降序数列（思维题）

goto_1600的博客

01-28

493

During the lesson small girl Alyona works with one famous spreadsheet computer program and learns how to edit tables. Now she has a table filled with integers. The table consists of n rows and m colum...

665. Non-decreasing Array

不积跬步无以至千里

07-03

199

给定一个数组，能否仅仅更改不超过一个数字，让整个数组称为非递减的顺序。

[leetcode]665. Non-decreasing Array @ python

闲庭信步

04-01

177

原题 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...

665. Non-decreasing Array -- Python

Chris_zhangrx的博客

01-15

911

665. 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] E

665. Non-decreasing Array Python代码

sinat_34538469的博客

05-16

198

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] <= ar...

32：C·Non-Decreasing Digits

AcherLX的专栏

04-14

764

C ·Non-Decreasing Digits A number is said to be made up of non-decreasing digits if all the digits to the left of any digit is less than or equal to that digit. For example, the four-digit number 1

【LeetCode】665. 非递减数列 Non-decreasing Array（Python & C++）

负雪明烛

02-05

1844

【LeetCode】665. Non-decreasing Array 解题报告标签： LeetCode 题目地址：https://leetcode.com/problems/non-decreasing-array/description/ 题目描述： Given an array with n integers, your task is to check if it cou

665. Non-decreasing Array（python+cpp）

小湉湉的博客

11-08

189

题目： 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 f...