feat: add solutions to lc problem: No.1358

No.1358.Number of Substrings Containing All Three Characters

Author: yanglbme

solution/1300-1399/1358.Number of Substrings Containing All Three Characters/README.md

@@ -45,22 +45,85 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：一次遍历**
+
+我们用一个长度为 $3$ 的数组 $d$ 记录三种字符最近一次出现的位置，初始时均为 $-1$。
+
+遍历字符串 $s$，对于当前位置 $i$，我们先更新 $d[s[i]=i$，然后合法的字符串个数为 $min(d[0], d[1], d[2]) + 1$，累加到答案中。
+
+时间复杂度 $O(n)$，空间复杂度 $O(1)$。其中 $n$ 为字符串 $s$ 的长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def numberOfSubstrings(self, s: str) -> int:
+        d = {"a": -1, "b": -1, "c": -1}
+        ans = 0
+        for i, c in enumerate(s):
+            d[c] = i
+            ans += min(d["a"], d["b"], d["c"]) + 1
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int numberOfSubstrings(String s) {
+        int[] d = new int[] {-1, -1, -1};
+        int ans = 0;
+        for (int i = 0; i < s.length(); ++i) {
+            char c = s.charAt(i);
+            d[c - 'a'] = i;
+            ans += Math.min(d[0], Math.min(d[1], d[2])) + 1;
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int numberOfSubstrings(string s) {
+        int d[3] = {-1, -1, -1};
+        int ans = 0;
+        for (int i = 0; i < s.size(); ++i) {
+            d[s[i] - 'a'] = i;
+            ans += min(d[0], min(d[1], d[2])) + 1;
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func numberOfSubstrings(s string) (ans int) {
+	d := [3]int{-1, -1, -1}
+	for i, c := range s {
+		d[c-'a'] = i
+		ans += min(d[0], min(d[1], d[2])) + 1
+	}
+	return
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/1300-1399/1358.Number of Substrings Containing All Three Characters/README_EN.md

@@ -47,13 +47,68 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def numberOfSubstrings(self, s: str) -> int:
+        d = {"a": -1, "b": -1, "c": -1}
+        ans = 0
+        for i, c in enumerate(s):
+            d[c] = i
+            ans += min(d["a"], d["b"], d["c"]) + 1
+        return ans
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int numberOfSubstrings(String s) {
+        int[] d = new int[] {-1, -1, -1};
+        int ans = 0;
+        for (int i = 0; i < s.length(); ++i) {
+            char c = s.charAt(i);
+            d[c - 'a'] = i;
+            ans += Math.min(d[0], Math.min(d[1], d[2])) + 1;
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int numberOfSubstrings(string s) {
+        int d[3] = {-1, -1, -1};
+        int ans = 0;
+        for (int i = 0; i < s.size(); ++i) {
+            d[s[i] - 'a'] = i;
+            ans += min(d[0], min(d[1], d[2])) + 1;
+        }
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func numberOfSubstrings(s string) (ans int) {
+	d := [3]int{-1, -1, -1}
+	for i, c := range s {
+		d[c-'a'] = i
+		ans += min(d[0], min(d[1], d[2])) + 1
+	}
+	return
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/1300-1399/1358.Number of Substrings Containing All Three Characters/Solution.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int numberOfSubstrings(string s) {
+        int d[3] = {-1, -1, -1};
+        int ans = 0;
+        for (int i = 0; i < s.size(); ++i) {
+            d[s[i] - 'a'] = i;
+            ans += min(d[0], min(d[1], d[2])) + 1;
+        }
+        return ans;
+    }
+};

solution/1300-1399/1358.Number of Substrings Containing All Three Characters/Solution.go

@@ -0,0 +1,15 @@
+func numberOfSubstrings(s string) (ans int) {
+	d := [3]int{-1, -1, -1}
+	for i, c := range s {
+		d[c-'a'] = i
+		ans += min(d[0], min(d[1], d[2])) + 1
+	}
+	return
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}

solution/1300-1399/1358.Number of Substrings Containing All Three Characters/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public int numberOfSubstrings(String s) {
+        int[] d = new int[] {-1, -1, -1};
+        int ans = 0;
+        for (int i = 0; i < s.length(); ++i) {
+            char c = s.charAt(i);
+            d[c - 'a'] = i;
+            ans += Math.min(d[0], Math.min(d[1], d[2])) + 1;
+        }
+        return ans;
+    }
+}

solution/1300-1399/1358.Number of Substrings Containing All Three Characters/Solution.py

@@ -0,0 +1,8 @@
+class Solution:
+    def numberOfSubstrings(self, s: str) -> int:
+        d = {"a": -1, "b": -1, "c": -1}
+        ans = 0
+        for i, c in enumerate(s):
+            d[c] = i
+            ans += min(d["a"], d["b"], d["c"]) + 1
+        return ans