add 1684

fishercoder1534 · fishercoder1534 · commit ecda9e4cb940 · 2020-12-12T09:34:24.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1684|[Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1684.java) ||Easy|String|
 |1679|[Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1679.java) ||Medium|HashTable|
 |1678|[Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1678.java) ||Easy|String|
 |1673|[Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1673.java) ||Medium|Stack, Greedy|
diff --git a/src/main/java/com/fishercoder/solutions/_1684.java b/src/main/java/com/fishercoder/solutions/_1684.java
@@ -0,0 +1,29 @@
+package com.fishercoder.solutions;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class _1684 {
+    public static class Solution1 {
+        public int countConsistentStrings(String allowed, String[] words) {
+            Set<Character> set = new HashSet<>();
+            for (char c : allowed.toCharArray()) {
+                set.add(c);
+            }
+            int count = 0;
+            for (String word : words) {
+                boolean isConsistent = true;
+                for (char c : word.toCharArray()) {
+                    if (!set.contains(c)) {
+                        isConsistent = false;
+                        break;
+                    }
+                }
+                if (isConsistent) {
+                    count++;
+                }
+            }
+            return count;
+        }
+    }
+}
