Merge pull request neetcode-gh#2292 from a93a/main

Delete newer duplicate of Problem 665 in C++ and rename older contribution
nick322 · Mar 5, 2023 · 9a5a0f3 · 9a5a0f3
2 parents 303ea5b + a375e41
commit 9a5a0f3
Show file tree

Hide file tree

Showing 3 changed files with 18 additions and 54 deletions.
diff --git a/cpp/0665-Non-Decreasing-Array.cpp b/cpp/0665-Non-Decreasing-Array.cpp
diff --git a/cpp/0665-non-decreasing-array.cpp b/cpp/0665-non-decreasing-array.cpp
@@ -1,18 +1,25 @@
 class Solution {
 public:
  bool checkPossibility(vector<int>& nums) {
- int count = 0;
- for(int i=1;i<nums.size();i++){
- if(nums[i-1]>nums[i]){
- count++;
- if(i>=2&&nums[i-2]>nums[i]){
- nums[i]=nums[i-1];
- }
- else{
- nums[i-1]=nums[i];
- }
+ bool changed = false;
+
+ for(int i = 0; i < nums.size() - 1; i++){
+ if(nums[i] <= nums[i+1]){
+ continue;
  }
+ if(changed){
+ return false;
+ }
+
+ if(i == 0 || nums[i+1] >= nums[i-1]){
+ nums[i] = nums[i+1];
+ }
+ else{
+ nums[i+1] = nums[i];
+ }
+ changed = true;
  }
- return count<=1;
+
+ return true;
  }
 };
diff --git a/cpp/665-Non-decreasing-Array.cpp b/cpp/665-Non-decreasing-Array.cpp