用递归试了下 from typing import List def solve(l: List[List[int]]): n = len(l) def dfs(i): if i >= n - 1: return 1 curr_start, curr_end = l[i] ans = -1 for j in range(i + 1, n): next_start, next_end = l[j] if next_start >= curr_end: ans = max(ans, dfs(j) + 1) return ans return dfs(0)
点赞 评论

相关推荐

牛客网
牛客企业服务