# 334.Increasing-Triplet-Subsequence

## 334. Increasing Triplet Subsequence

## 题目地址

<https://leetcode.com/problems/increasing-triplet-subsequence/>

## 题目描述

```
Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.

Formally the function should:

Return true if there exists i, j, k
such that arr[i] < arr[j] < arr[k] given 0 ≤ i < j < k ≤ n-1 else return false.
Note: Your algorithm should run in O(n) time complexity and O(1) space complexity.

Example 1:
Input: [1,2,3,4,5]
Output: true

Example 2:
Input: [5,4,3,2,1]
Output: false
```

## 代码

### Approach #1

Time: O(N) && Space: O(1)

```java
class Solution {
  public boolean increasingTriplet(int[] nums) {
        int small = Integer.MAX_VALUE;
    int big = Integer.MAX_VALUE;
    for (int n: nums) {
      if (n <= small) {
        small = n;
      } else if (n <= big) {
        big = n;
      } else {
        return true;
      }
    }
    return false;
  }
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://wentao-shao.gitbook.io/leetcode/array/334.increasing-triplet-subsequence.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.