add 1358

fishercoder1534 · fishercoder1534 · commit 56cffba34837 · 2020-02-22T09:18:38.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                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1358|[Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1358.java) | |Medium|String|
 |1357|[Apply Discount Every n Orders](https://leetcode.com/problems/apply-discount-every-n-orders/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1357.java) | |Medium|Design|
 |1356|[Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1356.java) | |Easy|Sort, Bit Manipulation|
 |1354|[Construct Target Array With Multiple Sums](https://leetcode.com/problems/construct-target-array-with-multiple-sums/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1354.java) | |Hard|Greedy|
diff --git a/src/main/java/com/fishercoder/solutions/_1358.java b/src/main/java/com/fishercoder/solutions/_1358.java
@@ -0,0 +1,34 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1358. Number of Substrings Containing All Three Characters
+ *
+ * Given a string s consisting only of characters a, b and c.
+ * Return the number of substrings containing at least one occurrence of all these characters a, b and c.
+ *
+ * Example 1:
+ * Input: s = "abcabc"
+ * Output: 10
+ * Explanation: The substrings containing at least one occurrence of the characters a, b and c are "abc", "abca", "abcab", "abcabc", "bca", "bcab", "bcabc", "cab", "cabc" and "abc" (again).
+ *
+ * Example 2:
+ * Input: s = "aaacb"
+ * Output: 3
+ * Explanation: The substrings containing at least one occurrence of the characters a, b and c are "aaacb", "aacb" and "acb".
+ *
+ * Example 3:
+ * Input: s = "abc"
+ * Output: 1
+ *
+ * Constraints:
+ * 3 <= s.length <= 5 x 10^4
+ * s only consists of a, b or c characters.
+ * */
+public class _1358 {
+    public static class Solution1 {
+        public int numberOfSubstrings(String s) {
+            //TODO: implement it
+            return -1;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1358Test.java b/src/test/java/com/fishercoder/_1358Test.java
@@ -0,0 +1,34 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1358;
+import org.junit.BeforeClass;
+import org.junit.Ignore;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+@Ignore
+public class _1358Test {
+    private static _1358.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1358.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(10, solution1.numberOfSubstrings("abcabc"));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(3, solution1.numberOfSubstrings("aaacb"));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(1, solution1.numberOfSubstrings("abc"));
+    }
+
+}
