feat: add solutions to lc problem: No.1876. Substrings of Size Three with Distinct Characters

Author: yanglbme

solution/1800-1899/1876.Substrings of Size Three with Distinct Characters/README.md

@@ -43,7 +43,6 @@
 	<li><code>s</code>​​​​​​ 只包含小写英文字母。</li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -55,15 +54,31 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def countGoodSubstrings(self, s: str) -> int:
+        count, n = 0, len(s)
+        for i in range(n - 2):
+            count += (s[i] != s[i + 1] and s[i] != s[i + 2] and s[i + 1] != s[i + 2])
+        return count
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int countGoodSubstrings(String s) {
+        int count = 0, n = s.length();
+        for (int i = 0; i < n - 2; ++i) {
+            char a = s.charAt(i), b = s.charAt(i + 1), c = s.charAt(i + 2);
+            if (a != b && a != c && b != c) {
+                ++count;
+            }
+        }
+        return count;
+    }
+}
 ```
 
 ### **...**

solution/1800-1899/1876.Substrings of Size Three with Distinct Characters/README_EN.md

@@ -39,21 +39,36 @@ The good substrings are "abc", "bca", "cab", and &
 	<li><code>s</code>​​​​​​ consists of lowercase English letters.</li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def countGoodSubstrings(self, s: str) -> int:
+        count, n = 0, len(s)
+        for i in range(n - 2):
+            count += (s[i] != s[i + 1] and s[i] != s[i + 2] and s[i + 1] != s[i + 2])
+        return count
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int countGoodSubstrings(String s) {
+        int count = 0, n = s.length();
+        for (int i = 0; i < n - 2; ++i) {
+            char a = s.charAt(i), b = s.charAt(i + 1), c = s.charAt(i + 2);
+            if (a != b && a != c && b != c) {
+                ++count;
+            }
+        }
+        return count;
+    }
+}
 ```
 
 ### **...**

solution/1800-1899/1876.Substrings of Size Three with Distinct Characters/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public int countGoodSubstrings(String s) {
+        int count = 0, n = s.length();
+        for (int i = 0; i < n - 2; ++i) {
+            char a = s.charAt(i), b = s.charAt(i + 1), c = s.charAt(i + 2);
+            if (a != b && a != c && b != c) {
+                ++count;
+            }
+        }
+        return count;
+    }
+}

solution/1800-1899/1876.Substrings of Size Three with Distinct Characters/Solution.py

@@ -0,0 +1,6 @@
+class Solution:
+    def countGoodSubstrings(self, s: str) -> int:
+        count, n = 0, len(s)
+        for i in range(n - 2):
+            count += (s[i] != s[i + 1] and s[i] != s[i + 2] and s[i + 1] != s[i + 2])
+        return count