Merge pull request #982 from 0xff-dev/1684

Add solution and test-cases for problem 1684

Author: 6boris

leetcode/1601-1700/1684.Count-the-Number-of-Consistent-Strings/README.md

@@ -1,28 +1,33 @@
 # [1684.Count the Number of Consistent Strings][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
+You are given a string `allowed` consisting of **distinct** characters and an array of strings `words`. A string is **consistent** if all characters in the string appear in the string `allowed`.
+
+Return the number of **consistent** strings in the array words.
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: allowed = "ab", words = ["ad","bd","aaab","baa","badab"]
+Output: 2
+Explanation: Strings "aaab" and "baa" are consistent since they only contain characters 'a' and 'b'.
 ```
 
-## 题意
-> ...
+**Example 2:**
 
-## 题解
-
-### 思路1
-> ...
-Count the Number of Consistent Strings
-```go
+```
+Input: allowed = "abc", words = ["a","b","c","ab","ac","bc","abc"]
+Output: 7
+Explanation: All strings are consistent.
 ```
 
+**Example 3:**
+
+```
+Input: allowed = "cad", words = ["cc","acd","b","ba","bac","bad","ac","d"]
+Output: 4
+Explanation: Strings "cc", "acd", "ac", and "d" are consistent.
+```
 
 ## 结语
 

leetcode/1601-1700/1684.Count-the-Number-of-Consistent-Strings/Solution.go

@@ -1,5 +1,22 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(allowed string, words []string) int {
+	in := [26]bool{}
+	for _, b := range allowed {
+		in[b-'a'] = true
+	}
+	ans := 0
+	for _, word := range words {
+		ok := true
+		for _, b := range word {
+			if !in[b-'a'] {
+				ok = false
+				break
+			}
+		}
+		if ok {
+			ans++
+		}
+	}
+	return ans
 }

leetcode/1601-1700/1684.Count-the-Number-of-Consistent-Strings/Solution_test.go

@@ -9,31 +9,32 @@ import (
 func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
-		name   string
-		inputs bool
-		expect bool
+		name    string
+		allowed string
+		words   []string
+		expect  int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", "ab", []string{"ad", "bd", "aaab", "baa", "badab"}, 2},
+		{"TestCase2", "abc", []string{"a", "b", "c", "ab", "ac", "bc", "abc"}, 7},
+		{"TestCase3", "cad", []string{"cc", "acd", "b", "ba", "bac", "bad", "ac", "d"}, 4},
 	}
 
 	//	开始测试
 	for i, c := range cases {
 		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-			got := Solution(c.inputs)
+			got := Solution(c.allowed, c.words)
 			if !reflect.DeepEqual(got, c.expect) {
-				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
-					c.expect, got, c.inputs)
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v %v",
+					c.expect, got, c.allowed, c.words)
 			}
 		})
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }