Package g0601_0700.s0646_maximum_length_of_pair_chain

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    646 - Maximum Length of Pair Chain\.

    Medium

    You are given an array of n pairs pairs where <code>pairsi = left<sub>i</sub>, right<sub>i</sub></code> and <code>left<sub>i</sub>< right<sub>i</sub></code>.

    A pair p2 = [c, d] follows a pair p1 = [a, b] if b &lt; 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 &lt;= n &lt;= 1000

    • <code>-1000 <= left<sub>i</sub>< right<sub>i</sub><= 1000</code>

    • 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 Integer findLongestChain(Array<IntArray> pairs)

      • Methods inherited from class java.lang.Object

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