Package g0301_0400.s0334_increasing_triplet_subsequence

Class Solution

java.lang.Object

g0301_0400.s0334_increasing_triplet_subsequence.Solution

public class Solution
extends Object

334 - Increasing Triplet Subsequence\. Medium Given an integer array `nums`, return `true` _if there exists a triple of indices_ `(i, j, k)` _such that_ `i < j < k` _and_ `nums[i] < nums[j] < 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 < j < 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:** The triplet (3, 4, 5) is valid because nums[3] == 0 < nums[4] == 4 < nums[5] == 6. **Constraints:** * 1 <= nums.length <= 5 * 105 * -231 <= nums[i] <= 231 - 1 **Follow up:** Could you implement a solution that runs in `O(n)` time complexity and `O(1)` space complexity?

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	increasingTriplet(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

increasingTriplet

public boolean increasingTriplet(int[] nums)