334.递增的三元子序列

递增的三元子序列

给你一个整数数组 nums，判断这个数组中是否存在长度为 3 的递增子序列。

解析

var increasingTriplet = function (nums) {
  let first = Infinity, second = Infinity;
  for (const num of nums) {
    if (num <= first) first = num;
    else if (num <= second) second = num;
    else return true;
  }
  return false;
};