interval-list-intersections

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given two lists of closed intervals, <code>firstList</code> and <code>secondList</code>, where <code>firstList[i] = [starti, endi]</code> and <code>secondList[j] = [startj, endj]</code>. Each list of intervals is pairwise disjoint and in sorted order.

Return the intersection of these two interval lists.

A closed interval <code>[a, b]</code> (with <code>a &lt;= b</code>) denotes the set of real numbers <code>x</code> with <code>a &lt;= x &lt;= b</code>.

The intersection of two closed intervals is a set of real numbers that are either empty or represented as a closed interval. For example, the intersection of <code>[1, 3]</code> and <code>[2, 4]</code> is <code>[2, 3]</code>.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2019/01/30/interval1.png" style="width: 700px; height: 194px;" />
<pre>
Input: firstList = [[0,2],[5,10],[13,23],[24,25]], secondList = [[1,5],[8,12],[15,24],[25,26]]
Output: [[1,2],[5,5],[8,10],[15,23],[24,24],[25,25]]
</pre>

Example 2:

<pre>
Input: firstList = [[1,3],[5,9]], secondList = []
Output: []
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= firstList.length, secondList.length &lt;= 1000</code></li>
	<li><code>firstList.length + secondList.length &gt;= 1</code></li>
	<li><code>0 &lt;= starti &lt; endi &lt;= 109</code></li>
	<li><code>endi &lt; starti+1</code></li>
	<li><code>0 &lt;= startj &lt; endj &lt;= 109 </code></li>
	<li><code>endj &lt; startj+1</code></li>
</ul>

intervalIntersection

Interval List Intersections

Merge Intervals

merge-intervals

合并区间

Merge Sorted Array

merge-sorted-array

合并两个有序数组

Employee Free Time

employee-free-time

员工空闲时间

Maximum Matching of Players With Trainers

maximum-matching-of-players-with-trainers

运动员和训练师的最大匹配数

Array

Two Pointers

Line Sweep

给定两个由一些 闭区间 组成的列表，<code>firstList</code> 和 <code>secondList</code> ，其中 <code>firstList[i] = [starti, endi]</code> 而 <code>secondList[j] = [startj, endj]</code> 。每个区间列表都是成对 不相交 的，并且 已经排序 。

返回这 两个区间列表的交集 。

形式上，闭区间 <code>[a, b]</code>（其中 <code>a <= b</code>）表示实数 <code>x</code> 的集合，而 <code>a <= x <= b</code> 。

两个闭区间的 交集 是一组实数，要么为空集，要么为闭区间。例如，<code>[1, 3]</code> 和 <code>[2, 4]</code> 的交集为 <code>[2, 3]</code> 。

 

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2019/01/30/interval1.png" style="width: 700px; height: 194px;" />
<pre>
输入：firstList = [[0,2],[5,10],[13,23],[24,25]], secondList = [[1,5],[8,12],[15,24],[25,26]]
输出：[[1,2],[5,5],[8,10],[15,23],[24,24],[25,25]]
</pre>

示例 2：

<pre>
输入：firstList = [[1,3],[5,9]], secondList = []
输出：[]
</pre>

示例 3：

<pre>
输入：firstList = [], secondList = [[4,8],[10,12]]
输出：[]
</pre>

示例 4：

<pre>
输入：firstList = [[1,7]], secondList = [[3,10]]
输出：[[3,7]]
</pre>

 

提示：

<ul>
	<li><code>0 <= firstList.length, secondList.length <= 1000</code></li>
	<li><code>firstList.length + secondList.length >= 1</code></li>
	<li><code>0 <= starti < endi <= 109</code></li>
	<li><code>endi < starti+1</code></li>
	<li><code>0 <= startj < endj <= 109 </code></li>
	<li><code>endj < startj+1</code></li>
</ul>