Package g0301_0400.s0334_increasing_triplet_subsequence

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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 nums3 == 0 < nums4 == 4 < nums5 == 6.

    Constraints:

    • <code>1 <= nums.length <= 5 * 10<sup>5</sup></code>

    • <code>-2<sup>31</sup><= numsi<= 2<sup>31</sup> - 1</code>

    Follow up: Could you implement a solution that runs in O(n) time complexity and O(1) space complexity?

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean increasingTriplet(IntArray nums)

      • Methods inherited from class java.lang.Object

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