Leetcode - Maximum Length of Pair Chain
https://leetcode.com/problems/maximum-length-of-pair-chain/
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]
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 | func findLongestChain(pairs [][]int) int { sort.Slice(pairs, func(i, j int) bool { return pairs[i][0] < pairs[j][0] }) if len(pairs) <= 1 { return len(pairs) } dp := make([]int, len(pairs)) dp[0] = 1 for i := 1; i < len(pairs); i++ { max := 1 for j := 0; j < i; j++ { if pairs[j][1] < pairs[i][0] { tmp := dp[j] + 1 if tmp > max { max = tmp } } } dp[i] = max } max := math.MinInt32 for _, n := range dp { if max < n { max = n } } return max} |
2 年前
Leetcode's "Maximum Length of Pair Chain" is a really tough problem. I spent hours on it and I'm still not sure if I have the right answer. The problem is to find the longest chain of pairs such that each pair is compatible. A pair (a, b) is compatible if a < b. So, for example, if you have the pairs (1, 2), (2, 3), (3, 4), then the longest chain is (1, 2), (2, 3), (3, 4), for a total length of 3. Right CBD Dosage for dog But if you have the pairs (1, 2), (2, 3), (4, 5), then the longest chain is just (1,