From ec67005b7d61bf17bbeca05c7e415c69939ae969 Mon Sep 17 00:00:00 2001 From: huangge1199 Date: Thu, 12 Aug 2021 16:17:24 +0800 Subject: [PATCH] =?UTF-8?q?986:=E5=8C=BA=E9=97=B4=E5=88=97=E8=A1=A8?= =?UTF-8?q?=E7=9A=84=E4=BA=A4=E9=9B=86?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../editor/cn/IntervalListIntersections.java | 92 +++++++++++++++++++ .../editor/cn/IntervalListIntersections.md | 51 ++++++++++ 2 files changed, 143 insertions(+) create mode 100644 src/main/java/leetcode/editor/cn/IntervalListIntersections.java create mode 100644 src/main/java/leetcode/editor/cn/IntervalListIntersections.md diff --git a/src/main/java/leetcode/editor/cn/IntervalListIntersections.java b/src/main/java/leetcode/editor/cn/IntervalListIntersections.java new file mode 100644 index 0000000..1c3e9d1 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/IntervalListIntersections.java @@ -0,0 +1,92 @@ +//给定两个由一些 闭区间 组成的列表，firstList 和 secondList ，其中 firstList[i] = [starti, endi] 而 s +//econdList[j] = [startj, endj] 。每个区间列表都是成对 不相交 的，并且 已经排序 。 +// +// 返回这 两个区间列表的交集 。 +// +// 形式上，闭区间 [a, b]（其中 a <= b）表示实数 x 的集合，而 a <= x <= b 。 +// +// 两个闭区间的 交集 是一组实数，要么为空集，要么为闭区间。例如，[1, 3] 和 [2, 4] 的交集为 [2, 3] 。 +// +// +// +// 示例 1： +// +// +//输入：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]] +// +// +// 示例 2： +// +// +//输入：firstList = [[1,3],[5,9]], secondList = [] +//输出：[] +// +// +// 示例 3： +// +// +//输入：firstList = [], secondList = [[4,8],[10,12]] +//输出：[] +// +// +// 示例 4： +// +// +//输入：firstList = [[1,7]], secondList = [[3,10]] +//输出：[[3,7]] +// +// +// +// +// 提示： +// +// +// 0 <= firstList.length, secondList.length <= 1000 +// firstList.length + secondList.length >= 1 +// 0 <= starti < endi <= 109 +// endi < starti+1 +// 0 <= startj < endj <= 109 +// endj < startj+1 +// +// Related Topics 数组 双指针 +// 👍 175 👎 0 + +package leetcode.editor.cn; + +import java.util.ArrayList; +import java.util.List; + +//986:区间列表的交集 +class IntervalListIntersections { + public static void main(String[] args) { + //测试代码 + Solution solution = new IntervalListIntersections().new Solution(); + } + + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + class Solution { + public int[][] intervalIntersection(int[][] firstList, int[][] secondList) { + int firstIndex = 0; + int secondIndex = 0; + List list = new ArrayList<>(); + while (firstIndex < firstList.length && secondIndex < secondList.length) { + int start = Math.max(firstList[firstIndex][0], secondList[secondIndex][0]); + int end = Math.min(firstList[firstIndex][1], secondList[secondIndex][1]); + if (start <= end) { + list.add(new int[]{start, end}); + } + if (firstList[firstIndex][1] < secondList[secondIndex][1]) { + firstIndex++; + } else { + secondIndex++; + } + } + return list.toArray(new int[list.size()][]); + } + } +//leetcode submit region end(Prohibit modification and deletion) + +} \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/IntervalListIntersections.md b/src/main/java/leetcode/editor/cn/IntervalListIntersections.md new file mode 100644 index 0000000..3d45195 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/IntervalListIntersections.md @@ -0,0 +1,51 @@ +

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

+ +

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

+ +

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

+ +

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

+ +

 

+ +

示例 1：

+ +
+输入：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]]
+
+ +

示例 2：

+ +
+输入：firstList = [[1,3],[5,9]], secondList = []
+输出：[]
+
+ +

示例 3：

+ +
+输入：firstList = [], secondList = [[4,8],[10,12]]
+输出：[]
+
+ +

示例 4：

+ +
+输入：firstList = [[1,7]], secondList = [[3,10]]
+输出：[[3,7]]
+
+ +

 

+ +

提示：

+ + +
Related Topics
  • 数组
  • 双指针
    • \n
  • 👍 175
  • 👎 0
    • \ No newline at end of file