0
回答
【算法题】给定int数组,移除不超过一个元素后,判断是否存在自增序列
利用AWS快速构建适用于生产的无服务器应用程序,免费试用12个月>>>   

没什么思路啊,题目如下(这个网站挺好玩的,可以在线做题,点我注册)。

Given a sequence of integers as an array, determine whether it is possible to obtain a strictly increasing sequence by removing no more than one element from the array.

Example

  • For sequence = [1, 3, 2, 1], the output should be
    almostIncreasingSequence(sequence) = false;

    There is no one element in this array that can be removed in order to get a strictly increasing sequence.

  • For sequence = [1, 3, 2], the output should be
    almostIncreasingSequence(sequence) = true.

    You can remove 3 from the array to get the strictly increasing sequence [1, 2]. Alternately, you can remove 2 to get the strictly increasing sequence [1, 3].

Input/Output

  • [time limit] 3000ms (java)
  • [input] array.integer sequence

    Guaranteed constraints:
    2 ≤ sequence.length ≤ 105,
    -105 ≤ sequence[i] ≤ 105.

  • [output] boolean

    Return true if it is possible to remove one element from the array in order to get a strictly increasing sequence, otherwise return false.

举报
Twocold
发帖于9个月前 0回/52阅
顶部