mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-10 09:51:42 +08:00
存量题库数据更新
This commit is contained in:
@@ -5,7 +5,7 @@
|
||||
<p>Return <em>the final string after the deletion</em>. It can be shown that the answer will always be <strong>unique</strong>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "le<u>e</u>etcode"
|
||||
@@ -15,7 +15,7 @@ Remove an 'e' from the first group of 'e's to create "leetc
|
||||
No three consecutive characters are equal, so return "leetcode".
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "<u>a</u>aab<u>aa</u>aa"
|
||||
@@ -26,7 +26,7 @@ Remove two 'a's from the second group of 'a's to create "aa
|
||||
No three consecutive characters are equal, so return "aabaa".
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 3:</strong></p>
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "aab"
|
||||
|
Reference in New Issue
Block a user