feat: add solutions to lc problem: No.1788

No.1788.Maximize the Beauty of the Garden

Author: yanglbme

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

@@ -7,23 +7,23 @@
 <p>Given a string <code>s</code>, find the length of the <strong>longest <span data-keyword="substring-nonempty">substring</span></strong> without repeating characters.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <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.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;bbbbb&quot;
 <strong>Output:</strong> 1
 <strong>Explanation:</strong> The answer is &quot;b&quot;, with the length of 1.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;pwwkew&quot;

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

@@ -11,7 +11,7 @@
 <p>The test cases are generated such that the number of unique combinations that sum up to <code>target</code> is less than <code>150</code> combinations for the given input.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> candidates = [2,3,6,7], target = 7
@@ -22,14 +22,14 @@
 These are the only two combinations.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> candidates = [2,3,5], target = 8
 <strong>Output:</strong> [[2,2,2,2],[2,3,3],[3,5]]
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> candidates = [2], target = 1

solution/0000-0099/0063.Unique Paths II/README_EN.md

@@ -4,7 +4,7 @@
 
 ## Description
 
-<p>You are given an <code>m x n</code> integer array <code>grid</code>. There is a robot initially located at the <b>top-left corner</b> (i.e., <code>grid[0][0]</code>). The robot tries to move to the <strong>bottom-right corner</strong> (i.e., <code>grid[m-1][n-1]</code>). The robot can only move either down or right at any point in time.</p>
+<p>You are given an <code>m x n</code> integer array <code>grid</code>. There is a robot initially located at the <b>top-left corner</b> (i.e., <code>grid[0][0]</code>). The robot tries to move to the <strong>bottom-right corner</strong> (i.e., <code>grid[m - 1][n - 1]</code>). The robot can only move either down or right at any point in time.</p>
 
 <p>An obstacle and space are marked as <code>1</code> or <code>0</code> respectively in <code>grid</code>. A path that the robot takes cannot include <strong>any</strong> square that is an obstacle.</p>
 

solution/0000-0099/0076.Minimum Window Substring/README_EN.md

@@ -42,7 +42,7 @@ Since the largest window of s only has one 'a', return empty string.
 <ul>
 	<li><code>m == s.length</code></li>
 	<li><code>n == t.length</code></li>
-	<li><code>1 &lt;= m, n&nbsp;&lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= m, n &lt;= 10<sup>5</sup></code></li>
 	<li><code>s</code> and <code>t</code> consist of uppercase and lowercase English letters.</li>
 </ul>
 

solution/0100-0199/0140.Word Break II/README_EN.md

@@ -9,22 +9,22 @@
 <p><strong>Note</strong> that the same word in the dictionary may be reused multiple times in the segmentation.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;catsanddog&quot;, wordDict = [&quot;cat&quot;,&quot;cats&quot;,&quot;and&quot;,&quot;sand&quot;,&quot;dog&quot;]
 <strong>Output:</strong> [&quot;cats and dog&quot;,&quot;cat sand dog&quot;]
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;pineapplepenapple&quot;, wordDict = [&quot;apple&quot;,&quot;pen&quot;,&quot;applepen&quot;,&quot;pine&quot;,&quot;pineapple&quot;]
 <strong>Output:</strong> [&quot;pine apple pen apple&quot;,&quot;pineapple pen apple&quot;,&quot;pine applepen apple&quot;]
 <strong>Explanation:</strong> Note that you are allowed to reuse a dictionary word.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> s = &quot;catsandog&quot;, wordDict = [&quot;cats&quot;,&quot;dog&quot;,&quot;sand&quot;,&quot;and&quot;,&quot;cat&quot;]

solution/0100-0199/0162.Find Peak Element/README_EN.md

@@ -13,14 +13,14 @@
 <p>You must write an algorithm that runs in <code>O(log n)</code> time.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [1,2,3,1]
 <strong>Output:</strong> 2
 <strong>Explanation:</strong> 3 is a peak element and your function should return the index number 2.</pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [1,2,1,3,5,6,4]

solution/0200-0299/0219.Contains Duplicate II/README_EN.md

@@ -4,24 +4,24 @@
 
 ## Description
 
-<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <code>true</code> if there are two <strong>distinct indices</strong> <code>i</code> and <code>j</code> in the array such that <code>nums[i] == nums[j]</code> and <code>abs(i - j) &lt;= k</code>.</p>
+<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <code>true</code> <em>if there are two <strong>distinct indices</strong> </em><code>i</code><em> and </em><code>j</code><em> in the array such that </em><code>nums[i] == nums[j]</code><em> and </em><code>abs(i - j) &lt;= k</code>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [1,2,3,1], k = 3
 <strong>Output:</strong> true
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [1,0,1,1], k = 1
 <strong>Output:</strong> true
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [1,2,3,1,2,3], k = 2

solution/0300-0399/0306.Additive Number/README_EN.md

@@ -13,7 +13,7 @@
 <p><strong>Note:</strong> Numbers in the additive sequence <strong>cannot</strong> have leading zeros, so sequence <code>1, 2, 03</code> or <code>1, 02, 3</code> is invalid.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> &quot;112358&quot;
@@ -23,7 +23,7 @@ The digits can form an additive sequence: 1, 1, 2, 3, 5, 8.
 1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5, 3 + 5 = 8
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> &quot;199100199&quot;

solution/0300-0399/0334.Increasing Triplet Subsequence/README_EN.md

@@ -7,23 +7,23 @@
 <p>Given an integer array <code>nums</code>, return <code>true</code><em> if there exists a triple of indices </em><code>(i, j, k)</code><em> such that </em><code>i &lt; j &lt; k</code><em> and </em><code>nums[i] &lt; nums[j] &lt; nums[k]</code>. If no such indices exists, return <code>false</code>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [1,2,3,4,5]
 <strong>Output:</strong> true
 <strong>Explanation:</strong> Any triplet where i &lt; j &lt; k is valid.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [5,4,3,2,1]
 <strong>Output:</strong> false
 <strong>Explanation:</strong> No triplet exists.
 </pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [2,1,5,0,4,6]

solution/0400-0499/0411.Minimum Unique Word Abbreviation/README_EN.md

@@ -21,7 +21,7 @@
 <p>Given a target string <code>target</code> and an array of strings <code>dictionary</code>, return <em>an <strong>abbreviation</strong> of </em><code>target</code><em> with the <strong>shortest possible length</strong> such that it is <strong>not an abbreviation</strong> of <strong>any</strong> string in </em><code>dictionary</code><em>. If there are multiple shortest abbreviations, return any of them</em>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> target = &quot;apple&quot;, dictionary = [&quot;blade&quot;]
@@ -31,7 +31,7 @@ The next shortest abbreviations are &quot;a4&quot; and &quot;4e&quot;. &quot;4e&
 Hence, return &quot;a4&quot;.
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> target = &quot;apple&quot;, dictionary = [&quot;blade&quot;,&quot;plain&quot;,&quot;amber&quot;]

solution/0500-0599/0523.Continuous Subarray Sum/README_EN.md

@@ -4,9 +4,21 @@
 
 ## Description
 
-<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <code>true</code> <em>if </em><code>nums</code><em> has a continuous subarray of size <strong>at least two</strong> whose elements sum up to a multiple of</em> <code>k</code><em>, or </em><code>false</code><em> otherwise</em>.</p>
+<p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
 
-<p>An integer <code>x</code> is a multiple of <code>k</code> if there exists an integer <code>n</code> such that <code>x = n * k</code>. <code>0</code> is <strong>always</strong> a multiple of <code>k</code>.</p>
+<p>A <strong>good subarray</strong> is a subarray where:</p>
+
+<ul>
+	<li>its length is <strong>at least two</strong>, and</li>
+	<li>the sum of the elements of the subarray is a multiple of <code>k</code>.</li>
+</ul>
+
+<p><strong>Note</strong> that:</p>
+
+<ul>
+	<li>A <strong>subarray</strong> is a contiguous part of the array.</li>
+	<li>An integer <code>x</code> is a multiple of <code>k</code> if there exists an integer <code>n</code> such that <code>x = n * k</code>. <code>0</code> is <strong>always</strong> a multiple of <code>k</code>.</li>
+</ul>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

solution/0700-0799/0724.Find Pivot Index/README_EN.md

@@ -13,7 +13,7 @@
 <p>Return <em>the <strong>leftmost pivot index</strong></em>. If no such index exists, return <code>-1</code>.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [1,7,3,6,5,6]
@@ -24,15 +24,15 @@ Left sum = nums[0] + nums[1] + nums[2] = 1 + 7 + 3 = 11
 Right sum = nums[4] + nums[5] = 5 + 6 = 11
 </pre>
 
-<p><strong>Example 2:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [1,2,3]
 <strong>Output:</strong> -1
 <strong>Explanation:</strong>
 There is no index that satisfies the conditions in the problem statement.</pre>
 
-<p><strong>Example 3:</strong></p>
+<p><strong class="example">Example 3:</strong></p>
 
 <pre>
 <strong>Input:</strong> nums = [2,1,-1]

solution/0700-0799/0739.Daily Temperatures/README_EN.md

@@ -7,13 +7,13 @@
 <p>Given an array of integers <code>temperatures</code> represents the daily temperatures, return <em>an array</em> <code>answer</code> <em>such that</em> <code>answer[i]</code> <em>is the number of days you have to wait after the</em> <code>i<sup>th</sup></code> <em>day to get a warmer temperature</em>. If there is no future day for which this is possible, keep <code>answer[i] == 0</code> instead.</p>
 
 <p>&nbsp;</p>
-<p><strong>Example 1:</strong></p>
+<p><strong class="example">Example 1:</strong></p>
 <pre><strong>Input:</strong> temperatures = [73,74,75,71,69,72,76,73]
 <strong>Output:</strong> [1,1,4,2,1,1,0,0]
-</pre><p><strong>Example 2:</strong></p>
+</pre><p><strong class="example">Example 2:</strong></p>
 <pre><strong>Input:</strong> temperatures = [30,40,50,60]
 <strong>Output:</strong> [1,1,1,0]
-</pre><p><strong>Example 3:</strong></p>
+</pre><p><strong class="example">Example 3:</strong></p>
 <pre><strong>Input:</strong> temperatures = [30,60,90]
 <strong>Output:</strong> [1,1,0]
 </pre>

solution/0800-0899/0843.Guess the Word/README.md

@@ -6,50 +6,61 @@
 
 <!-- 这里写题目描述 -->
 
-<p>这是一个&nbsp;<strong><em>交互式问题 </em></strong>。</p>
+<p>给你一个由 <strong>不同</strong> 字符串组成的单词列表&nbsp;<code>words</code> ，其中 <code>words[i]</code>&nbsp;长度均为&nbsp;<code>6</code> 。<code>words</code> 中的一个单词将被选作秘密单词 <code>secret</code>&nbsp;。</p>
 
-<p>我们给出了一个由一些 <strong>不同的</strong> 单词组成的列表&nbsp;<code>wordlist</code>&nbsp;，对于每个&nbsp;<code>wordlist[i]</code>&nbsp;长度均为&nbsp;<code>6</code> ，这个列表中的一个单词将被选作&nbsp;<code>secret</code>&nbsp;。</p>
+<p>另给你一个辅助对象&nbsp;<code>Master</code> ，你可以调用&nbsp;<code>Master.guess(word)</code> 来猜单词，其中参数 <code>word</code> 长度为 6 且必须是 <code>words</code> 中的字符串。</p>
 
-<p>你可以调用&nbsp;<code>Master.guess(word)</code>&nbsp;来猜单词。你所猜的单词应当是存在于原列表并且由 <code>6</code> 个小写字母组成的类型&nbsp;<code>string</code>&nbsp;。</p>
+<p><code>Master.guess(word)</code> 将会返回如下结果：</p>
 
-<p>此函数将会返回一个&nbsp;<code>integer</code>&nbsp;，表示你的猜测与<strong>秘密单词</strong>&nbsp;<code>secret</code>&nbsp;的准确匹配（值和位置同时匹配）的数目。此外，如果你的猜测不在给定的单词列表中，它将返回 <code>-1</code>。</p>
+<ul>
+	<li>如果 <code>word</code> 不是 <code>words</code> 中的字符串，返回 <code>-1</code> ，或者</li>
+	<li>一个整数，表示你所猜测的单词 <code>word</code> 与 <strong>秘密单词</strong>&nbsp;<code>secret</code>&nbsp;的准确匹配（值和位置同时匹配）的数目。</li>
+</ul>
 
-<p>对于每个测试用例，你有 <code>10</code> 次机会来猜出这个单词。当所有调用都结束时，如果您对 <code>Master.guess</code> 的调用在&nbsp;<code>10</code> 次以内，并且至少有一次猜到&nbsp;<code>secret</code>&nbsp;，将判定为通过该用例。</p>
+<p>每组测试用例都会包含一个参数 <code>allowedGuesses</code> ，其中 <code>allowedGuesses</code> 是你可以调用 <code>Master.guess(word)</code> 的最大次数。</p>
 
-<p>&nbsp;</p>
+<p>对于每组测试用例，在不超过允许猜测的次数的前提下，你应该调用 <code>Master.guess</code> 来猜出秘密单词。最终，你将会得到以下结果：</p>
+
+<ul>
+	<li>如果你调用 <code>Master.guess</code> 的次数大于 <code>allowedGuesses</code> 所限定的次数或者你没有用 <code>Master.guess</code> 猜到秘密单词，则得到 <strong><code>"Either you took too many guesses, or you did not find the secret word."</code> 。</strong></li>
+	<li>如果你调用 <code>Master.guess</code> 猜到秘密单词，且调用 <code>Master.guess</code> 的次数小于或等于 <code>allowedGuesses</code> ，则得到 <strong><code>"You guessed the secret word correctly."</code> 。</strong></li>
+</ul>
 
-<p><strong>示例 1:</strong></p>
+<p>生成的测试用例保证你可以利用某种合理的策略（而不是暴力）猜到秘密单词。</p>
+&nbsp;
+
+<p><strong>示例 1：</strong></p>
 
 <pre>
-<strong>输入:</strong>&nbsp;secret = "acckzz", wordlist = ["acckzz","ccbazz","eiowzz","abcczz"]
-<strong>输出:</strong>&nbsp;You guessed the secret word correctly.
-<strong>解释:</strong>
-<code>master.guess("aaaaaa")</code> 返回 -1, 因为&nbsp;<code>"aaaaaa"</code>&nbsp;不在 wordlist 中.
-<code>master.guess("acckzz") 返回</code> 6, 因为&nbsp;<code>"acckzz"</code> 就是<strong>秘密</strong>，6个字母完全匹配。
-<code>master.guess("ccbazz")</code> 返回 3, 因为<code>&nbsp;"ccbazz"</code>&nbsp;有 3 个匹配项。
-<code>master.guess("eiowzz")</code> 返回 2, 因为&nbsp;<code>"eiowzz"</code>&nbsp;有 2 个匹配项。
-<code>master.guess("abcczz")</code> 返回 4, 因为&nbsp;<code>"abcczz"</code> 有 4 个匹配项。
-我们调用了 5 次master.guess，其中一次猜到了<strong>秘密</strong>，所以我们通过了这个测试用例。
+<strong>输入：</strong>secret = "acckzz", words = ["acckzz","ccbazz","eiowzz","abcczz"], allowedGuesses = 10
+<strong>输出：</strong>You guessed the secret word correctly.
+<strong>解释：</strong>
+master.guess("aaaaaa") 返回 -1 ，因为 "aaaaaa" 不在 words 中。
+master.guess("acckzz") 返回 6 ，因为 "acckzz" 是秘密单词 secret ，共有 6 个字母匹配。
+master.guess("ccbazz") 返回 3 ，因为 "ccbazz" 共有 3 个字母匹配。
+master.guess("eiowzz") 返回 2 ，因为 "eiowzz" 共有 2 个字母匹配。
+master.guess("abcczz") 返回 4 ，因为 "abcczz" 共有 4 个字母匹配。
+一共调用 5 次 master.guess ，其中一个为秘密单词，所以通过测试用例。
 </pre>
 
-<p><strong>&nbsp;示例 2:</strong></p>
+<p><strong>示例 2：</strong></p>
 
 <pre>
-<strong>输入:</strong> secret = "hamada", wordlist = ["hamada","khaled"], numguesses = 10
-<strong>输出:</strong> You guessed the secret word correctly.
-</pre>
+<strong>输入：</strong>secret = "hamada", words = ["hamada","khaled"], allowedGuesses = 10
+<strong>输出：</strong>You guessed the secret word correctly.
+<strong>解释：</strong>共有 2 个单词，且其中一个为秘密单词，可以通过测试用例。</pre>
 
 <p>&nbsp;</p>
 
-<p><strong>提示:</strong></p>
+<p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>1 &lt;= wordlist.length &lt;= 100</code></li>
-	<li><code>wordlist[i].length == 6</code></li>
-	<li><code>wordlist[i]</code>&nbsp;只包含小写英文字母</li>
-	<li><code>wordlist</code>&nbsp;中所有字符串都 <strong>不同</strong></li>
-	<li><code>secret</code>&nbsp;在&nbsp;<code>wordlist</code>&nbsp;中</li>
-	<li><code>numguesses == 10</code></li>
+	<li><code>1 &lt;= words.length &lt;= 100</code></li>
+	<li><code>words[i].length == 6</code></li>
+	<li><code>words[i]</code> 仅由小写英文字母组成</li>
+	<li><code>words</code> 中所有字符串 <strong>互不相同</strong></li>
+	<li><code>secret</code> 存在于 <code>words</code> 中</li>
+	<li><code>10 &lt;= allowedGuesses &lt;= 30</code></li>
 </ul>
 
 ## 解法