g0601_0700.s0646_maximum_length_of_pair_chain.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation
Show all versions of leetcode-in-kotlin Show documentation
Kotlin-based LeetCode algorithm problem solutions, regularly updated
646\. Maximum Length of Pair Chain
Medium
You are given an array of `n` pairs `pairs` where pairs[i] = [lefti, righti] and lefti < righti.
A pair `p2 = [c, d]` **follows** a pair `p1 = [a, b]` if `b < c`. A **chain** of pairs can be formed in this fashion.
Return _the length longest chain which can be formed_.
You do not need to use up all the given intervals. You can select pairs in any order.
**Example 1:**
**Input:** pairs = [[1,2],[2,3],[3,4]]
**Output:** 2
**Explanation:** The longest chain is [1,2] -> [3,4].
**Example 2:**
**Input:** pairs = [[1,2],[7,8],[4,5]]
**Output:** 3
**Explanation:** The longest chain is [1,2] -> [4,5] -> [7,8].
**Constraints:**
* `n == pairs.length`
* `1 <= n <= 1000`
* -1000 <= lefti < righti <= 1000