g0601_0700.s0646_maximum_length_of_pair_chain.Solution.kt 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

Kotlin-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.30

package g0601_0700.s0646_maximum_length_of_pair_chain

// #Medium #Array #Dynamic_Programming #Sorting #Greedy
// #2023_02_11_Time_249_ms_(100.00%)_Space_38.2_MB_(100.00%)

class Solution {
    fun findLongestChain(pairs: Array): Int {
        if (pairs.size == 1) {
            return 1
        }
        pairs.sortWith { a: IntArray, b: IntArray ->
            a[1] - b[1]
        }
        var min = pairs[0][1]
        var max = 1
        for (i in 1 until pairs.size) {
            if (pairs[i][0] > min) {
                max++
                min = pairs[i][1]
            }
        }
        return max
    }
}