coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 00:41:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

移除零宽空格

Browse Source
This commit is contained in:
小墨
2025-05-25 15:06:02 +08:00
parent 59597532bc
commit 3070bed723
272 changed files with 1031 additions and 749 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/problem/substrings-of-size-three-with-distinct-characters.html
View File

@@ -1,6 +1,6 @@
<p>A string is <strong>good</strong> if there are no repeated characters.</p>
<p>Given a string <code>s</code>​​​​​, return <em>the number of <strong>good substrings</strong> of length <strong>three </strong>in </em><code>s</code>​​​​​​.</p>
<p>Given a string <code>s</code>, return <em>the number of <strong>good substrings</strong> of length <strong>three </strong>in </em><code>s</code>.</p>
<p>Note that if there are multiple occurrences of the same substring, every occurrence should be counted.</p>
@@ -12,7 +12,7 @@
<pre>
<strong>Input:</strong> s = &quot;xyzzaz&quot;
<strong>Output:</strong> 1
<strong>Explanation:</strong> There are 4 substrings of size 3: &quot;xyz&quot;, &quot;yzz&quot;, &quot;zza&quot;, and &quot;zaz&quot;.
<strong>Explanation:</strong> There are 4 substrings of size 3: &quot;xyz&quot;, &quot;yzz&quot;, &quot;zza&quot;, and &quot;zaz&quot;.
The only good substring of length 3 is &quot;xyz&quot;.
</pre>
@@ -30,5 +30,5 @@ The good substrings are &quot;abc&quot;, &quot;bca&quot;, &quot;cab&quot;, and &
<ul>
<li><code>1 &lt;= s.length &lt;= 100</code></li>
<li><code>s</code>​​​​​​ consists of lowercase English letters.</li>
<li><code>s</code> consists of lowercase English letters.</li>
</ul>