diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/non_decreasing_array.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/non_decreasing_array.cpp')
-rw-r--r-- | other/non_decreasing_array.cpp | 27 |
1 files changed, 27 insertions, 0 deletions
diff --git a/other/non_decreasing_array.cpp b/other/non_decreasing_array.cpp new file mode 100644 index 0000000..6ea4280 --- /dev/null +++ b/other/non_decreasing_array.cpp @@ -0,0 +1,27 @@ +#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); +} |