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
SOLUTION:
class Solution:
def biggestChain(self, pairs, i, n):
if i == n - 1:
return 1
if i in self.cache:
return self.cache[i]
mlen = 1
for j in range(i+1, n):
if pairs[j][0] > pairs[i][1]:
curr = self.biggestChain(pairs, j, n)
mlen = max(mlen, 1 + curr)
self.cache[i] = mlen
return mlen
def findLongestChain(self, pairs: List[List[int]]) -> int:
pairs.sort(key = lambda x: x[0])
self.cache = {}
n = len(pairs)
mlen = 1
for i in range(n):
curr = self.biggestChain(pairs, i, n)
mlen = max(mlen, curr)
return mlen
Top comments (0)