[pull] main from doocs:main

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md

@@ -26,7 +26,7 @@ tags:
 <pre>
 <strong>Input:</strong> s = &quot;abcabcbb&quot;
 <strong>Output:</strong> 3
-<strong>Explanation:</strong> The answer is &quot;abc&quot;, with the length of 3.
+<strong>Explanation:</strong> The answer is &quot;abc&quot;, with the length of 3. Note that <code>&quot;bca&quot;</code> and <code>&quot;cab&quot;</code> are also correct answers.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>

solution/0000-0099/0039.Combination Sum/README.md

@@ -28,7 +28,7 @@ tags:
 <p><strong>示例&nbsp;1：</strong></p>
 
 <pre>
-<strong>输入：</strong>candidates = <code>[2,3,6,7]</code>, target = <code>7</code>
+<strong>输入：</strong>candidates = [2,3,6,7], target = 7
 <strong>输出：</strong>[[2,2,3],[7]]
 <strong>解释：</strong>
 2 和 3 可以形成一组候选，2 + 2 + 3 = 7 。注意 2 可以使用多次。
@@ -38,13 +38,13 @@ tags:
 <p><strong>示例&nbsp;2：</strong></p>
 
 <pre>
-<strong>输入: </strong>candidates = [2,3,5]<code>, </code>target = 8
+<strong>输入: </strong>candidates = [2,3,5], target = 8
 <strong>输出: </strong>[[2,2,2,2],[2,3,3],[3,5]]</pre>
 
 <p><strong>示例 3：</strong></p>
 
 <pre>
-<strong>输入: </strong>candidates = <code>[2], </code>target = 1
+<strong>输入: </strong>candidates = [2], target = 1
 <strong>输出: </strong>[]
 </pre>
 

solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README.md

@@ -20,7 +20,7 @@ tags:
 
 <p>给你一个整数数组 <code>prices</code> ，其中&nbsp;<code>prices[i]</code> 表示某支股票第 <code>i</code> 天的价格。</p>
 
-<p>在每一天，你可以决定是否购买和/或出售股票。你在任何时候&nbsp;<strong>最多</strong>&nbsp;只能持有 <strong>一股</strong> 股票。你也可以先购买，然后在 <strong>同一天</strong> 出售。</p>
+<p>在每一天，你可以决定是否购买和/或出售股票。你在任何时候&nbsp;<strong>最多</strong>&nbsp;只能持有 <strong>一股</strong> 股票。然而，你可以在 <strong>同一天</strong> 多次买卖该股票，但要确保你持有的股票不超过一股。</p>
 
 <p>返回 <em>你能获得的 <strong>最大</strong> 利润</em>&nbsp;。</p>
 

solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README_EN.md

@@ -20,7 +20,7 @@ tags:
 
 <p>You are given an integer array <code>prices</code> where <code>prices[i]</code> is the price of a given stock on the <code>i<sup>th</sup></code> day.</p>
 
-<p>On each day, you may decide to buy and/or sell the stock. You can only hold <strong>at most one</strong> share of the stock at any time. However, you can buy it then immediately sell it on the <strong>same day</strong>.</p>
+<p>On each day, you may decide to buy and/or sell the stock. You can only hold <strong>at most one</strong> share of the stock at any time. However, you can sell and buy the stock multiple times on the <strong>same day</strong>, ensuring you never hold than one share of the stock.</p>
 
 <p>Find and return <em>the <strong>maximum</strong> profit you can achieve</em>.</p>
 

solution/0100-0199/0166.Fraction to Recurring Decimal/README_EN.md

@@ -20,12 +20,14 @@ tags:
 
 <p>Given two integers representing the <code>numerator</code> and <code>denominator</code> of a fraction, return <em>the fraction in string format</em>.</p>
 
-<p>If the fractional part is repeating, enclose the repeating part in parentheses.</p>
+<p>If the fractional part is repeating, enclose the repeating part in parentheses</p>
 
 <p>If multiple answers are possible, return <strong>any of them</strong>.</p>
 
 <p>It is <strong>guaranteed</strong> that the length of the answer string is less than <code>10<sup>4</sup></code> for all the given inputs.</p>
 
+<p><strong>Note</strong> that if the fraction can be represented as a <em>finite length string</em>, you <strong>must</strong> return it.</p>
+
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 

solution/0100-0199/0190.Reverse Bits/README.md

@@ -17,7 +17,7 @@ tags:
 
 <!-- description:start -->
 
-<p>颠倒给定的 32 位无符号整数的二进制位。</p>
+<p>颠倒给定的 32 位有符号整数的二进制位。</p>
 
 <p>&nbsp;</p>
 

solution/0200-0299/0290.Word Pattern/README.md

@@ -19,7 +19,13 @@ tags:
 
 <p>给定一种规律 <code>pattern</code>&nbsp;和一个字符串&nbsp;<code>s</code>&nbsp;，判断 <code>s</code>&nbsp;是否遵循相同的规律。</p>
 
-<p>这里的&nbsp;<strong>遵循&nbsp;</strong>指完全匹配，例如，&nbsp;<code>pattern</code>&nbsp;里的每个字母和字符串&nbsp;<code>s</code><strong>&nbsp;</strong>中的每个非空单词之间存在着双向连接的对应规律。</p>
+<p>这里的&nbsp;<strong>遵循&nbsp;</strong>指完全匹配，例如，&nbsp;<code>pattern</code>&nbsp;里的每个字母和字符串&nbsp;<code>s</code><strong>&nbsp;</strong>中的每个非空单词之间存在着双向连接的对应规律。具体来说：</p>
+
+<ul>
+	<li><code>pattern</code>&nbsp;中的每个字母都 <strong>恰好</strong> 映射到 <code>s</code> 中的一个唯一单词。</li>
+	<li><code>s</code> 中的每个唯一单词都 <strong>恰好</strong> 映射到&nbsp;<code>pattern</code> 中的一个字母。</li>
+	<li>没有两个字母映射到同一个单词，也没有两个单词映射到同一个字母。</li>
+</ul>
 
 <p>&nbsp;</p>