From 7b792abb12c9dd2f9dc3c4ddd9dc6e471a2a29ed Mon Sep 17 00:00:00 2001
From: 0xff-dev <stevenshuang521@gmail.com>
Date: Wed, 16 Oct 2024 09:31:42 +0800
Subject: [PATCH] Add solution and test-cases for problem 2848

---
 .../README.md                                 | 29 ++++++++++++++
 .../Solution.go                               | 40 +++++++++++++++++++
 .../Solution_test.go                          | 38 ++++++++++++++++++
 3 files changed, 107 insertions(+)
 create mode 100644 leetcode/2801-2900/2848.Points-That-Intersect-With-Cars/README.md
 create mode 100755 leetcode/2801-2900/2848.Points-That-Intersect-With-Cars/Solution.go
 create mode 100755 leetcode/2801-2900/2848.Points-That-Intersect-With-Cars/Solution_test.go

diff --git a/leetcode/2801-2900/2848.Points-That-Intersect-With-Cars/README.md b/leetcode/2801-2900/2848.Points-That-Intersect-With-Cars/README.md
new file mode 100644
index 00000000..f3cadfa5
--- /dev/null
+++ b/leetcode/2801-2900/2848.Points-That-Intersect-With-Cars/README.md
@@ -0,0 +1,29 @@
+# [2848.Points That Intersect With Cars][title]
+
+## Description
+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.
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-algorithm][me]
+
+[title]: https://leetcode.com/problems/points-that-intersect-with-cars/
+[me]: https://github.com/kylesliu/awesome-golang-algorithm
diff --git a/leetcode/2801-2900/2848.Points-That-Intersect-With-Cars/Solution.go b/leetcode/2801-2900/2848.Points-That-Intersect-With-Cars/Solution.go
new file mode 100755
index 00000000..fca0ff4d
--- /dev/null
+++ b/leetcode/2801-2900/2848.Points-That-Intersect-With-Cars/Solution.go
@@ -0,0 +1,40 @@
+package Solution
+
+import "sort"
+
+func Solution(nums [][]int) int {
+	sort.Slice(nums, func(i, j int) bool {
+		a, b := nums[i], nums[j]
+		if a[0] == b[0] {
+			return a[1] < b[1]
+		}
+		return a[0] < b[0]
+	})
+
+	points := 0
+	var (
+		left, right int
+		first       = true
+	)
+	for _, car := range nums {
+		if first {
+			left, right = car[0], car[1]
+			points += right - left + 1
+			first = false
+			continue
+		}
+		if car[0] >= right {
+			points += car[1] - car[0]
+			if car[0] > right {
+				points++
+			}
+			left, right = car[0], car[1]
+			continue
+		}
+		if car[1] > right {
+			points += car[1] - right
+			right = car[1]
+		}
+	}
+	return points
+}
diff --git a/leetcode/2801-2900/2848.Points-That-Intersect-With-Cars/Solution_test.go b/leetcode/2801-2900/2848.Points-That-Intersect-With-Cars/Solution_test.go
new file mode 100755
index 00000000..b713c8b3
--- /dev/null
+++ b/leetcode/2801-2900/2848.Points-That-Intersect-With-Cars/Solution_test.go
@@ -0,0 +1,38 @@
+package Solution
+
+import (
+	"reflect"
+	"strconv"
+	"testing"
+)
+
+func TestSolution(t *testing.T) {
+	//	测试用例
+	cases := []struct {
+		name   string
+		inputs [][]int
+		expect int
+	}{
+		{"TestCase1", [][]int{{3, 6}, {1, 5}, {4, 7}}, 7},
+		{"TestCase2", [][]int{{1, 3}, {5, 8}}, 7},
+	}
+
+	//	开始测试
+	for i, c := range cases {
+		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
+			got := Solution(c.inputs)
+			if !reflect.DeepEqual(got, c.expect) {
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+					c.expect, got, c.inputs)
+			}
+		})
+	}
+}
+
+// 压力测试
+func BenchmarkSolution(b *testing.B) {
+}
+
+// 使用案列
+func ExampleSolution() {
+}