Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- bool checkPossibility(vector<int>& nums) {
- int sz = nums.size();
- bool modified = false;
- for(int i=1; i<sz; i++){
- if(nums[i-1] > nums[i]){
- if(modified)
- return false;
- modified = true;
- if(i < 2 || nums[i-2] <= nums[i]){
- nums[i-1] = nums[i];
- }
- else{
- nums[i] = nums[i-1];
- }
- }
- }
- return true;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement