Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

修正 665. 修改一个数成为非递减数组（Non-decreasing Array）难度提示

Browse Source 
665. 修改一个数成为非递减数组（Non-decreasing Array）

国际区和中国区都显示 Medium 难度

参见：
[Leetcode](https://leetcode.com/problems/non-decreasing-array/description/)
[力扣](https://leetcode-cn.com/problems/non-decreasing-array/description/)
This commit is contained in:
Wang Qin 2021-06-13 22:21:02 +08:00 committed by GitHub
parent a8c5a57065
commit 452e702246
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
notes/Leetcode 题解 - 贪心思想.md
View File

@ -293,7 +293,7 @@ public boolean isSubsequence(String s, String t) {
## 9. 修改一个数成为非递减数组 ## 9. 修改一个数成为非递减数组
665\. Non-decreasing Array (Easy) 665\. Non-decreasing Array (Medium)
[Leetcode](https://leetcode.com/problems/non-decreasing-array/description/) / [力扣](https://leetcode-cn.com/problems/non-decreasing-array/description/) [Leetcode](https://leetcode.com/problems/non-decreasing-array/description/) / [力扣](https://leetcode-cn.com/problems/non-decreasing-array/description/)