登录社区云，与社区用户共同成长
邀请您加入社区
题目https://leetcode.com/problems/interval-list-intersections/题解本题用双指针。（想了下，也可以用线段树，和天际线那道题类似）class Solution {public int[][] intervalIntersection(int[][] firstList, int[][] secondList) {int i = 0;int j
Range Module is a data structure for tracking numeric ranges, supporting add, query, and delete operations for half-open intervals [left, right). The core idea of the implementation is to manage int
