leetcode 665 Non-decreasing Array

class Solution {
public boolean checkPossibility(int[] nums) {
int t=0;
for(int i=0;i<nums.length-1 && t<=1;i++){
if(nums[i]>nums[i+1]) {
t++;
if(i<1||nums[i-1]<nums[i+1]) nums[i]=nums[i+1];
else nums[i+1]=nums[i];
}
}
return t<=1;
}
}