diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/non_decreasing_array.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/non_decreasing_array.cpp')
-rw-r--r-- | other/non_decreasing_array.cpp | 27 |
1 files changed, 0 insertions, 27 deletions
diff --git a/other/non_decreasing_array.cpp b/other/non_decreasing_array.cpp deleted file mode 100644 index 6ea4280..0000000 --- a/other/non_decreasing_array.cpp +++ /dev/null @@ -1,27 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - bool checkPossibility(vector<int> &nums) { - for (int i = 0; i < nums.size() - 1; i++) { - if (nums[i] > nums[i + 1]) { - if (i - 1 >= 0 && nums[i - 1] > nums[i + 1]) - nums[i + 1] = nums[i]; - else - nums[i] = nums[i + 1]; - break; - } - } - for (int i = 0; i < nums.size() - 1; i++) { - if (nums[i] > nums[i + 1]) - return false; - } - return true; - } -}; - -int main() { - Solution obj; - vector<int> nums = {4, 2, 3}; - cout << obj.checkPossibility(nums); -} |