NeetCode #129LC-665MediumArrays & Hashing
← Back to All Problems#129 · #665 · Non-decreasing Array(非递减数列)
📌 Problem Statement & Constraints
Given an array
nums, return true if it can become non-decreasing by modifying at most one element. Constraints: 1 <= nums.length <= 10^4, -10^5 <= nums[i] <= 10^5.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!