存量题库数据更新

leetcode/problem/determine-if-two-strings-are-close.html

@@ -19,7 +19,7 @@
 <p>Given two strings, <code>word1</code> and <code>word2</code>, return <code>true</code><em> if </em><code>word1</code><em> and </em><code>word2</code><em> are <strong>close</strong>, and </em><code>false</code><em> otherwise.</em></p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> word1 = &quot;abc&quot;, word2 = &quot;bca&quot;
@@ -29,7 +29,7 @@ Apply Operation 1: &quot;a<u>bc</u>&quot; -&gt; &quot;a<u>cb</u>&quot;
 Apply Operation 1: &quot;<u>a</u>c<u>b</u>&quot; -&gt; &quot;<u>b</u>c<u>a</u>&quot;
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> word1 = &quot;a&quot;, word2 = &quot;aa&quot;
@@ -37,7 +37,7 @@ Apply Operation 1: &quot;<u>a</u>c<u>b</u>&quot; -&gt; &quot;<u>b</u>c<u>a</u>&q
 <strong>Explanation: </strong>It is impossible to attain word2 from word1, or vice versa, in any number of operations.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> word1 = &quot;cabbba&quot;, word2 = &quot;abbccc&quot;
@@ -53,5 +53,5 @@ Apply Operation 2: &quot;<u>baa</u>ccc&quot; -&gt; &quot;<u>abb</u>ccc&quot;
 
 <ul>
 	<li><code>1 &lt;= word1.length, word2.length &lt;= 10<sup>5</sup></code></li>
-	<li><code>word1</code> and <code>word2</code> contain&nbsp;only lowercase English letters.</li>
+	<li><code>word1</code> and <code>word2</code> contain only lowercase English letters.</li>
 </ul>