class Solution {
public:
vector<vector<int>> intervalIntersection(vector<vector<int>>& A, vector<vector<int>>& B) {
int i=0, j=0;
vector<vector<int>> res;
while(i<A.size() && j<B.size()){
int a1 = A[i][0], a2 = A[i][1];
int b1 = B[j][0], b2 = B[j][1];
if(b2>=a1 && b1<=a2){
res.push_back({max(a1,b1), min(a2, b2)});
}
if(b2>a2) i++;
else j++;
}
return res;
}
};
Leetcode 986. Interval List Intersections 区间交集 双指针
最新推荐文章于 2022-02-15 23:41:00 发布