Add solution and test-cases for problem 1094

Author: 0xff-dev

leetcode/1001-1100/1094.Car-Pooling/README.md

@@ -1,28 +1,25 @@
 # [1094.Car Pooling][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+There is a car with `capacity` empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west).
+
+You are given the integer `capacity` and an array `trips` where trip[i] = [numPassengers<sub>i</sub>, from<sub>i</sub>, to<sub>i</sub>] indicates that the i<sup>th</sup> trip has numPassengers<sub>i</sub> passengers and the locations to pick them up and drop them off are from<sub>i</sub> and to<sub>i</sub> respectively. The locations are given as the number of kilometers due east from the car's initial location.
+
+Return `true` if it is possible to pick up and drop off all passengers for all the given trips, or `false` otherwise. 
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: trips = [[2,1,5],[3,3,7]], capacity = 4
+Output: false
 ```
 
-## 题意
-> ...
+**Example 2:**
 
-## 题解
-
-### 思路1
-> ...
-Car Pooling
-```go
 ```
-
+Input: trips = [[2,1,5],[3,3,7]], capacity = 5
+Output: true
+```
 
 ## 结语
 

leetcode/1001-1100/1094.Car-Pooling/Solution.go

@@ -1,5 +1,21 @@
 package Solution
 
-func Solution(x bool) bool {
-return x
+func Solution(trips [][]int, capacity int) bool {
+maxDistance := 0
+for _, trip := range trips {
+if trip[2] > maxDistance {
+maxDistance = trip[2]
+}
+}
+
+distances := make([]int, maxDistance+1)
+for _, trip := range trips {
+for s := trip[1]; s < trip[2]; s++ {
+distances[s] += trip[0]
+if distances[s] > capacity {
+return false
+}
+}
+}
+return true
 }

leetcode/1001-1100/1094.Car-Pooling/Solution_test.go

@@ -10,18 +10,39 @@ func TestSolution(t *testing.T) {
 //	测试用例
 cases := []struct {
 name string
-inputs bool
+inputs [][]int
+cap int
 expect bool
 }{
-{"TestCase", true, true},
-{"TestCase", true, true},
-{"TestCase", false, false},
+{"TestCase1", [][]int{
+{2, 1, 5},
+{3, 3, 7},
+}, 4, false},
+{"TestCase2", [][]int{
+{2, 1, 5},
+{3, 3, 7},
+}, 5, true},
+{"TestCase3", [][]int{
+{1, 1, 8},
+{2, 2, 7},
+{3, 3, 6},
+}, 5, false},
+{"TestCase4", [][]int{
+{1, 1, 8},
+{2, 2, 7},
+{3, 3, 6},
+}, 6, true,
+},
+{"TestCase5", [][]int{
+{2, 1, 5},
+{3, 5, 7},
+}, 3, true},
 }
 
 //	开始测试
 for i, c := range cases {
 t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-got := Solution(c.inputs)
+got := Solution(c.inputs, c.cap)
 if !reflect.DeepEqual(got, c.expect) {
 t.Fatalf("expected: %v, but got: %v, with inputs: %v",
 c.expect, got, c.inputs)