如何求整数的几乎递增序列

Question

给定一个整数序列作为一个数组，我必须确定是否可以通过从数组中移除不超过一个元素来获得一个严格递增的序列。例

对于sequence=[1,3,2,1]，输出应该是

almostIncreasingSequence(sequence) = false

这个数组中没有一个元素可以为了得到严格的递增序列而被移除。

almostIncreasingSequence(sequence) = true

function almostIncreasingSequence(sequence) {
    for (var i = 0; i < sequence.length; i++) {
        if (sequence[i] > sequence[i + 1]) {
            sequence.splice(i, 1);
           return true;
        };
        return false;
    };
}

Answer 1

function almostIncreasingSequence(sequence) {
  var found = false;
  for (var i=0;i<sequence.length;i++) {
    if(sequence[i] <= sequence[i-1]) {
      if(found) {
        return false;
      }
      found = true;
      
      if(i === 1 || i + 1 === sequence.length) {
        continue;
      }
      else if (sequence[i] > sequence[i-2]) {
        sequence[i-1] = sequence[i-2];
      }
      else if(sequence[i-1] >= sequence[i+1]) {
        return false;
      }
    }
  }
  return true;
}