• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g2801_2900.s2848_points_that_intersect_with_cars.readme.md Maven / Gradle / Ivy

2848\. Points That Intersect With Cars

Easy

You are given a **0-indexed** 2D integer array `nums` representing the coordinates of the cars parking on a number line. For any index `i`, nums[i] = [starti, endi] where starti is the starting point of the ith car and endi is the ending point of the ith car.

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

**Example 1:**

**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.

**Example 2:**

**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.

**Constraints:**

*   `1 <= nums.length <= 100`
*   `nums[i].length == 2`
*   1 <= starti <= endi <= 100