1189 added

Author: aQuaYi

.vscode/settings.json

@@ -196,6 +196,7 @@
         "lexicographicaly",
         "lleeelee",
         "longest",
+        "loonbalxballpoon",
         "lpnpelpwy",
         "make",
         "map",
@@ -208,6 +209,7 @@
         "n",
         "nbsp",
         "next",
+        "nlaebolko",
         "ntse",
         "num",
         "numberify",

Algorithms/1189.maximum-number-of-balloons/1.jpeg

@@ -0,0 +1,35 @@
+# [1189. Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/)
+
+Given a string text, you want to use the characters of text to form as many instances of the word "balloon" as possible.
+
+You can use each character in text at most once. Return the maximum number of instances that can be formed.
+
+Example 1:
+
+![1](1.jpeg)
+
+```text
+Input: text = "nlaebolko"
+Output: 1
+```
+
+Example 2:
+
+![2](2.jpeg)
+
+```text
+Input: text = "loonbalxballpoon"
+Output: 2
+```
+
+Example 3:
+
+```text
+Input: text = "leetcode"
+Output: 0
+```
+
+Constraints:
+
+- `1 <= text.length <= 10^4`
+- `text consists of lower case English letters only.`

Algorithms/1189.maximum-number-of-balloons/2.jpeg

@@ -0,0 +1,5 @@
+package problem1189
+
+func maxNumberOfBalloons(text string) int {
+	return 0
+}

Algorithms/1189.maximum-number-of-balloons/README.md

@@ -0,0 +1,47 @@
+package problem1189
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	text string
+	ans  int
+}{
+
+	{
+		"nlaebolko",
+		1,
+	},
+
+	{
+		"loonbalxballpoon",
+		2,
+	},
+
+	{
+		"leetcode",
+		0,
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_maxNumberOfBalloons(t *testing.T) {
+	a := assert.New(t)
+
+	for _, tc := range tcs {
+		a.Equal(tc.ans, maxNumberOfBalloons(tc.text), "输入:%v", tc)
+	}
+}
+
+func Benchmark_maxNumberOfBalloons(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			maxNumberOfBalloons(tc.text)
+		}
+	}
+}