feat: update lc problems (#3542)

Author: yanglbme

solution/0000-0099/0046.Permutations/README_EN.md

@@ -17,7 +17,7 @@ tags:
 
 <!-- description:start -->
 
-<p>Given an array <code>nums</code> of distinct integers, return <em>all the possible permutations</em>. You can return the answer in <strong>any order</strong>.</p>
+<p>Given an array <code>nums</code> of distinct integers, return all the possible <span data-keyword="permutation-array">permutations</span>. You can return the answer in <strong>any order</strong>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0200-0299/0241.Different Ways to Add Parentheses/README.md

@@ -57,6 +57,7 @@ tags:
 	<li><code>1 &lt;= expression.length &lt;= 20</code></li>
 	<li><code>expression</code> 由数字和算符 <code>'+'</code>、<code>'-'</code> 和 <code>'*'</code> 组成。</li>
 	<li>输入表达式中的所有整数值在范围 <code>[0, 99]</code>&nbsp;</li>
+	<li>输入表达式中的所有整数都没有前导&nbsp;<code>'-'</code>&nbsp;或&nbsp;<code>'+'</code> 表示符号。</li>
 </ul>
 
 <!-- description:end -->

solution/0200-0299/0241.Different Ways to Add Parentheses/README_EN.md

@@ -55,6 +55,7 @@ tags:
 	<li><code>1 &lt;= expression.length &lt;= 20</code></li>
 	<li><code>expression</code> consists of digits and the operator <code>&#39;+&#39;</code>, <code>&#39;-&#39;</code>, and <code>&#39;*&#39;</code>.</li>
 	<li>All the integer values in the input expression are in the range <code>[0, 99]</code>.</li>
+	<li>The integer values in the input expression do not have a leading <code>&#39;-&#39;</code> or <code>&#39;+&#39;</code> denoting the sign.</li>
 </ul>
 
 <!-- description:end -->

solution/0200-0299/0287.Find the Duplicate Number/README_EN.md

@@ -23,7 +23,7 @@ tags:
 
 <p>There is only <strong>one repeated number</strong> in <code>nums</code>, return <em>this&nbsp;repeated&nbsp;number</em>.</p>
 
-<p>You must solve the problem <strong>without</strong> modifying the array <code>nums</code>&nbsp;and uses only constant extra space.</p>
+<p>You must solve the problem <strong>without</strong> modifying the array <code>nums</code>&nbsp;and using only constant extra space.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0300-0399/0357.Count Numbers with Unique Digits/README.md

@@ -29,7 +29,7 @@ tags:
 <pre>
 <strong>输入：</strong>n = 2
 <strong>输出：</strong>91
-<strong>解释：</strong>答案应为除去 <code>11、22、33、44、55、66、77、88、99 </code>外，在 0 ≤ x &lt; 100 范围内的所有数字。
+<strong>解释：</strong>答案应为除去 <code>11、22、33、44、55、66、77、88、99 </code>外，在 0 ≤ x &lt; 100 范围内的所有数字。 
 </pre>
 
 <p><strong>示例 2：</strong></p>

solution/0400-0499/0438.Find All Anagrams in a String/README.md

@@ -18,9 +18,7 @@ tags:
 
 <!-- description:start -->
 
-<p>给定两个字符串&nbsp;<code>s</code>&nbsp;和 <code>p</code>，找到&nbsp;<code>s</code><strong>&nbsp;</strong>中所有&nbsp;<code>p</code><strong>&nbsp;</strong>的&nbsp;<strong>异位词&nbsp;</strong>的子串，返回这些子串的起始索引。不考虑答案输出的顺序。</p>
-
-<p><strong>异位词 </strong>指由相同字母重排列形成的字符串（包括相同的字符串）。</p>
+<p>给定两个字符串&nbsp;<code>s</code>&nbsp;和 <code>p</code>，找到&nbsp;<code>s</code><strong>&nbsp;</strong>中所有&nbsp;<code>p</code><strong>&nbsp;</strong>的&nbsp;<strong><span data-keyword="anagram">异位词</span>&nbsp;</strong>的子串，返回这些子串的起始索引。不考虑答案输出的顺序。</p>
 
 <p>&nbsp;</p>
 

solution/0400-0499/0438.Find All Anagrams in a String/README_EN.md

@@ -18,9 +18,7 @@ tags:
 
 <!-- description:start -->
 
-<p>Given two strings <code>s</code> and <code>p</code>, return <em>an array of all the start indices of </em><code>p</code><em>&#39;s anagrams in </em><code>s</code>. You may return the answer in <strong>any order</strong>.</p>
-
-<p>An <strong>Anagram</strong> is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.</p>
+<p>Given two strings <code>s</code> and <code>p</code>, return an array of all the start indices of <code>p</code>&#39;s <span data-keyword="anagram">anagrams</span> in <code>s</code>. You may return the answer in <strong>any order</strong>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0500-0599/0567.Permutation in String/README.md

@@ -19,7 +19,7 @@ tags:
 
 <!-- description:start -->
 
-<p>给你两个字符串&nbsp;<code>s1</code>&nbsp;和&nbsp;<code>s2</code> ，写一个函数来判断 <code>s2</code> 是否包含 <code>s1</code><strong>&nbsp;</strong>的排列。如果是，返回 <code>true</code> ；否则，返回 <code>false</code> 。</p>
+<p>给你两个字符串&nbsp;<code>s1</code>&nbsp;和&nbsp;<code>s2</code> ，写一个函数来判断 <code>s2</code> 是否包含 <code>s1</code><strong>&nbsp;</strong>的 <span data-keyword="permutation-string">排列</span>。如果是，返回 <code>true</code> ；否则，返回 <code>false</code> 。</p>
 
 <p>换句话说，<code>s1</code> 的排列之一是 <code>s2</code> 的 <strong>子串</strong> 。</p>
 

solution/0500-0599/0567.Permutation in String/README_EN.md

@@ -19,7 +19,7 @@ tags:
 
 <!-- description:start -->
 
-<p>Given two strings <code>s1</code> and <code>s2</code>, return <code>true</code><em> if </em><code>s2</code><em> contains a permutation of </em><code>s1</code><em>, or </em><code>false</code><em> otherwise</em>.</p>
+<p>Given two strings <code>s1</code> and <code>s2</code>, return <code>true</code> if <code>s2</code> contains a <span data-keyword="permutation-string">permutation</span> of <code>s1</code>, or <code>false</code> otherwise.</p>
 
 <p>In other words, return <code>true</code> if one of <code>s1</code>&#39;s permutations is the substring of <code>s2</code>.</p>
 

solution/0600-0699/0600.Non-negative Integers without Consecutive Ones/README.md

@@ -25,7 +25,7 @@ tags:
 <pre>
 <strong>输入:</strong> n = 5
 <strong>输出:</strong> 5
-<strong>解释:</strong>
+<strong>解释:</strong> 
 下面列出范围在 [0, 5] 的非负整数与其对应的二进制表示：
 0 : 0
 1 : 1