comefrom: <qiyuangong>665_Non-decreasing_Array_1.java
code: public boolean checkPossibility(int[] nums) {
          int brokenPoint = 0;
          for (int i = 0; i < nums.length - 1; i++) {
              if (nums[i] > nums[i + 1]) {
                  brokenPoint++;
                  if (brokenPoint >= 2) return false;
                  if (i - 1 < 0 || nums[i - 1] <= nums[i + 1]) nums[i] = nums[i + 1];
                  else nums[i + 1] = nums[i];
              }
          }
          return true;
      }
masked: public boolean var_0 ( int [ ] var_1 ) {
    int var_3 = 0 ;
    for ( int var_4 = 0 ;
    var_4 < var_1 . length - 1 ;
    var_4 ++ ) {
      if ( var_1 [ var_4 ] > var_1 [ var_4 + 1 ] ) {
        var_3 ++ ;
        if ( var_3 >= 2 ) return false ;
        if ( var_4 - 1 < 0 || var_1 [ var_4 - 1 ] <= var_1 [ var_4 + 1 ] ) var_1 [ var_4 ] = var_1 [ var_4 + 1 ] ;
        else var_1 [ var_4 + 1 ] = var_1 [ var_4 ] ;
      }
    }
    return true ;
  }
  