points-that-intersect-with-cars

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 a 0-indexed 2D integer array <code>nums</code> representing the coordinates of the cars parking on a number line. For any index <code>i</code>, <code>nums[i] = [starti, endi]</code> where <code>starti</code> is the starting point of the <code>ith</code> car and <code>endi</code> is the ending point of the <code>ith</code> car.

Return the number of integer points on the line that are covered with any part of a car.

&nbsp;
Example 1:

<pre>
Input: nums = [[3,6],[1,5],[4,7]]
Output: 7
Explanation: All the points from 1 to 7 intersect at least one car, therefore the answer would be 7.
</pre>

Example 2:

<pre>
Input: nums = [[1,3],[5,8]]
Output: 7
Explanation: Points intersecting at least one car are 1, 2, 3, 5, 6, 7, 8. There are a total of 7 points, therefore the answer would be 7.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
	<li><code>nums[i].length == 2</code></li>
	<li><code>1 &lt;= starti&nbsp;&lt;= endi&nbsp;&lt;= 100</code></li>
</ul>

numberOfPoints

Points That Intersect With Cars

Merge Intervals

merge-intervals

合并区间

Meeting Rooms

meeting-rooms

会议室

Meeting Rooms II

meeting-rooms-ii

会议室 II

Array

Hash Table

Prefix Sum

给你一个下标从 0 开始的二维整数数组 <code>nums</code> 表示汽车停放在数轴上的坐标。对于任意下标 <code>i</code>，<code>nums[i] = [starti, endi]</code> ，其中 <code>starti</code> 是第 <code>i</code> 辆车的起点，<code>endi</code> 是第 <code>i</code> 辆车的终点。

返回数轴上被车 任意部分 覆盖的整数点的数目。

&nbsp;

示例 1：

<pre>
输入：nums = [[3,6],[1,5],[4,7]]
输出：7
解释：从 1 到 7 的所有点都至少与一辆车相交，因此答案为 7 。
</pre>

示例 2：

<pre>
输入：nums = [[1,3],[5,8]]
输出：7
解释：1、2、3、5、6、7、8 共计 7 个点满足至少与一辆车相交，因此答案为 7 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
	<li><code>nums[i].length == 2</code></li>
	<li><code>1 &lt;= starti&nbsp;&lt;= endi&nbsp;&lt;= 100</code></li>
</ul>