> For the complete documentation index, see [llms.txt](https://protegejj.gitbook.io/oj-practices/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://protegejj.gitbook.io/oj-practices/chapter1/dynamic-programming/lis/646-maximum-length-of-pair-chain.md).

# 646 Maximum Length of Pair Chain

## 646. [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/description/)

## 1. Question

You are given`n`pairs of numbers. In every pair, the first number is always smaller than the second number.

Now, we define a pair`(c, d)`can follow another pair`(a, b)`if and only if`b < c`. Chain of pairs can be formed in this fashion.

Given a set of pairs, find the length longest chain which can be formed. You needn't use up all the given pairs. You can select pairs in any order.

**Example 1:**

```
Input: [[1,2], [2,3], [3,4]]

Output: 2

Explanation:
The longest chain is [1,2] -> [3,4]
```

**Note:**

1. The number of given pairs will be in the range \[1, 1000].

## 2. Implementation

**(1) Sorting + DP**

```java
class Solution {
    public int findLongestChain(int[][] pairs) {
        Arrays.sort(pairs, (a, b)->(a[0] - b[0]));

        int n = pairs.length;
        int[] LIS = new int[n];
        Arrays.fill(LIS, 1);

        for (int i = 1; i < n; i++) {
            for (int j = 0; j < i; j++) {
                if (pairs[j][1] < pairs[i][0] && (LIS[j] + 1 > LIS[i])) {
                    LIS[i] = LIS[j] + 1;
                }
            }
        }

        int res = 1;
        for (int len : LIS) {
            res = Math.max(res, len);
        }
        return res;
    }
}
```

## 3. Time & Space Complexity

**Sorting + DP:**&#x65F6;间复杂度O(nlogn + n^2), n为pairs的个数, 空间复杂度O(n)


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## 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://protegejj.gitbook.io/oj-practices/chapter1/dynamic-programming/lis/646-maximum-length-of-pair-chain.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.