Merge pull request #2292 from a93a/main

Delete newer duplicate of Problem 665 in C++ and rename older contribution

Author: a93a

Diff for: 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;
     }
 };