109 added

Author: aQuaYi

Algorithms/1109.corporate-flight-bookings/README.md

@@ -0,0 +1,20 @@
+# [1109. Corporate Flight Bookings](https://leetcode.com/problems/corporate-flight-bookings/)
+
+There are n flights, and they are labeled from 1 to n.
+
+We have a list of flight bookings.  The i-th booking bookings[i] = [i, j, k] means that we booked k seats from flights labeled i to j inclusive.
+
+Return an array answer of length n, representing the number of seats booked on each flight in order of their label.
+
+Example 1:
+
+```text
+Input: bookings = [[1,2,10],[2,3,20],[2,5,25]], n = 5
+Output: [10,55,45,25,25]
+```
+
+Constraints:
+
+- `1 <= bookings.length <= 20000`
+- `1 <= bookings[i][0] <= bookings[i][1] <= n <= 20000`
+- `1 <= bookings[i][2] <= 10000`

Algorithms/1109.corporate-flight-bookings/corporate-flight-bookings.go

@@ -0,0 +1,6 @@
+package problem1109
+
+func corpFlightBookings(bookings [][]int, n int) []int {
+
+	return nil
+}

Algorithms/1109.corporate-flight-bookings/corporate-flight-bookings_test.go

@@ -0,0 +1,39 @@
+package problem1109
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	bookings [][]int
+	n        int
+	ans      []int
+}{
+
+	{
+		[][]int{{1, 2, 10}, {2, 3, 20}, {2, 5, 25}},
+		5,
+		[]int{10, 55, 45, 25, 25},
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_corpFlightBookings(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, corpFlightBookings(tc.bookings, tc.n), "输入:%v", tc)
+	}
+}
+
+func Benchmark_corpFlightBookings(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			corpFlightBookings(tc.bookings, tc.n)
+		}
+	}
+}