Increasing Triplet Subsequence скачать в хорошем качестве

Increasing Triplet Subsequence

Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i less than j less than k and nums[i] less than nums[j] less than nums[k]. If no such indices exists, return false. Example 1: Input: nums = [1,2,3,4,5] Output: true Explanation: Any triplet where i less than j less than k is valid. Example 2: Input: nums = [5,4,3,2,1] Output: false Explanation: No triplet exists. Example 3: Input: nums = [2,1,5,0,4,6] Output: true Explanation: One of the valid triplet is (1, 4, 5), because nums[1] == 1 less than nums[4] == 4 less than nums[5] == 6.