• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0601_0700.s0646_maximum_length_of_pair_chain.readme.md Maven / Gradle / Ivy

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