LeetCode 付费题目描述 201~400

Author: LjyYano

solution/0200-0299/0243.Shortest Word Distance/README.md

@@ -4,7 +4,22 @@
 
 ## 题目描述
 <!-- 这里写题目描述 -->
-None
+<p>给定一个单词列表和两个单词 <em>word1</em> 和 <em>word2</em>，返回列表中这两个单词之间的最短距离。</p>
+
+<p><strong>示例:</strong><br>
+假设 words = <code>["practice", "makes", "perfect", "coding", "makes"]</code></p>
+
+<pre><strong>输入:</strong> <em>word1</em> = <code>“coding”</code>, <em>word2</em> = <code>“practice”</code>
+<strong>输出:</strong> 3
+</pre>
+
+<pre><strong>输入:</strong> <em>word1</em> = <code>"makes"</code>, <em>word2</em> = <code>"coding"</code>
+<strong>输出:</strong> 1
+</pre>
+
+<p><strong>注意:</strong><br>
+你可以假设 <em>word1</em> 不等于 <em>word2</em>, 并且 <em>word1</em> 和 <em>word2</em> 都在列表里。</p>
+
 
 
 ## 解法

solution/0200-0299/0243.Shortest Word Distance/README_EN.md

@@ -3,7 +3,24 @@
 [中文文档](/solution/0200-0299/0243.Shortest%20Word%20Distance/README.md)
 
 ## Description
-None
+<p>Given a list of words and two words <em>word1</em> and <em>word2</em>, return the shortest distance between these two words in the list.</p>
+
+<p><strong>Example:</strong><br />
+Assume that words = <code>["practice", "makes", "perfect", "coding", "makes"]</code>.</p>
+
+<pre>
+<b>Input:</b> <em>word1</em> = <code>“coding”</code>, <em>word2</em> = <code>“practice”</code>
+<b>Output:</b> 3
+</pre>
+
+<pre>
+<b>Input:</b> <em>word1</em> = <code>"makes"</code>, <em>word2</em> = <code>"coding"</code>
+<b>Output:</b> 1
+</pre>
+
+<p><strong>Note:</strong><br />
+You may assume that <em>word1</em> <strong>does not equal to</strong> <em>word2</em>, and <em>word1</em> and <em>word2</em> are both in the list.</p>
+
 
 
 ## Solutions

solution/0200-0299/0244.Shortest Word Distance II/README.md

@@ -4,7 +4,21 @@
 
 ## 题目描述
 <!-- 这里写题目描述 -->
-None
+<p>请设计一个类，使该类的构造函数能够接收一个单词列表。然后再实现一个方法，该方法能够分别接收两个单词 <em>word1</em> 和 <em>word2，</em>并返回列表中这两个单词之间的最短距离。您的方法将被以不同的参数调用 <em>多次</em>。</p>
+
+<p><strong>示例:</strong><br>
+假设 words = <code>["practice", "makes", "perfect", "coding", "makes"]</code></p>
+
+<pre><strong>输入:</strong> <em>word1</em> = <code>“coding”</code>, <em>word2</em> = <code>“practice”</code>
+<strong>输出:</strong> 3
+</pre>
+
+<pre><strong>输入:</strong> <em>word1</em> = <code>"makes"</code>, <em>word2</em> = <code>"coding"</code>
+<strong>输出:</strong> 1</pre>
+
+<p><strong>注意:</strong><br>
+你可以假设 <em>word1</em> <strong>不等于</strong> <em>word2</em>, 并且 <em>word1</em> 和 <em>word2</em> 都在列表里。</p>
+
 
 
 ## 解法

solution/0200-0299/0244.Shortest Word Distance II/README_EN.md

@@ -3,7 +3,23 @@
 [中文文档](/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README.md)
 
 ## Description
-None
+<p>Design a class which receives a list of words in the constructor, and implements a method that takes two words <em>word1</em> and <em>word2</em> and return the shortest distance between these two words in the list. Your method will be called <em>repeatedly</em> many times with different parameters. </p>
+
+<p><strong>Example:</strong><br />
+Assume that words = <code>["practice", "makes", "perfect", "coding", "makes"]</code>.</p>
+
+<pre>
+<b>Input:</b> <em>word1</em> = <code>“coding”</code>, <em>word2</em> = <code>“practice”</code>
+<b>Output:</b> 3
+</pre>
+
+<pre>
+<b>Input:</b> <em>word1</em> = <code>"makes"</code>, <em>word2</em> = <code>"coding"</code>
+<b>Output:</b> 1</pre>
+
+<p><strong>Note:</strong><br />
+You may assume that <em>word1</em> <strong>does not equal to</strong> <em>word2</em>, and <em>word1</em> and <em>word2</em> are both in the list.</p>
+
 
 
 ## Solutions

solution/0200-0299/0245.Shortest Word Distance III/README.md

@@ -4,7 +4,24 @@
 
 ## 题目描述
 <!-- 这里写题目描述 -->
-None
+<p>给定一个单词列表和两个单词 <em>word1</em> 和 <em>word2</em>，返回列表中这两个单词之间的最短距离。</p>
+
+<p><em>word1</em> 和 <em>word2</em> 是有可能相同的，并且它们将分别表示为列表中两个独立的单词。</p>
+
+<p><strong>示例:</strong><br>
+假设 words = <code>["practice", "makes", "perfect", "coding", "makes"]</code>.</p>
+
+<pre><strong>输入:</strong> <em>word1</em> = <code>“makes”</code>, <em>word2</em> = <code>“coding”</code>
+<strong>输出:</strong> 1
+</pre>
+
+<pre><strong>输入:</strong> <em>word1</em> = <code>"makes"</code>, <em>word2</em> = <code>"makes"</code>
+<strong>输出:</strong> 3
+</pre>
+
+<p><strong>注意:</strong><br>
+你可以假设 <em>word1</em> 和 <em>word2</em> 都在列表里。</p>
+
 
 
 ## 解法

solution/0200-0299/0245.Shortest Word Distance III/README_EN.md

@@ -3,7 +3,26 @@
 [中文文档](/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README.md)
 
 ## Description
-None
+<p>Given a list of words and two words <em>word1</em> and <em>word2</em>, return the shortest distance between these two words in the list.</p>
+
+<p><em>word1</em> and <em>word2</em> may be the same and they represent two individual words in the list.</p>
+
+<p><strong>Example:</strong><br />
+Assume that words = <code>["practice", "makes", "perfect", "coding", "makes"]</code>.</p>
+
+<pre>
+<b>Input:</b> <em>word1</em> = <code>“makes”</code>, <em>word2</em> = <code>“coding”</code>
+<b>Output:</b> 1
+</pre>
+
+<pre>
+<b>Input:</b> <em>word1</em> = <code>"makes"</code>, <em>word2</em> = <code>"makes"</code>
+<b>Output:</b> 3
+</pre>
+
+<p><strong>Note:</strong><br />
+You may assume <em>word1</em> and <em>word2</em> are both in the list.</p>
+
 
 
 ## Solutions

solution/0200-0299/0246.Strobogrammatic Number/README.md

@@ -4,7 +4,34 @@
 
 ## 题目描述
 <!-- 这里写题目描述 -->
-None
+<p>中心对称数是指一个数字在旋转了 180 度之后看起来依旧相同的数字（或者上下颠倒地看）。</p>
+
+<p>请写一个函数来判断该数字是否是中心对称数，其输入将会以一个字符串的形式来表达数字。</p>
+
+<p> </p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre><strong>输入:</strong> num = "69"
+<strong>输出:</strong> true
+</pre>
+
+<p><strong>示例 2:</strong></p>
+
+<pre><strong>输入:</strong> num = "88"
+<strong>输出:</strong> true</pre>
+
+<p><strong>示例 3:</strong></p>
+
+<pre><strong>输入:</strong> num = "962"
+<strong>输出:</strong> false</pre>
+
+<p><strong>示例 4：</strong></p>
+
+<pre><strong>输入：</strong>num = "1"
+<strong>输出：</strong>true
+</pre>
+
 
 
 ## 解法

solution/0200-0299/0246.Strobogrammatic Number/README_EN.md

@@ -3,7 +3,24 @@
 [中文文档](/solution/0200-0299/0246.Strobogrammatic%20Number/README.md)
 
 ## Description
-None
+<p>A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down).</p>
+
+<p>Write a function to determine if a number is strobogrammatic. The number is represented as a string.</p>
+
+<p> </p>
+<p><strong>Example 1:</strong></p>
+<pre><strong>Input:</strong> num = "69"
+<strong>Output:</strong> true
+</pre><p><strong>Example 2:</strong></p>
+<pre><strong>Input:</strong> num = "88"
+<strong>Output:</strong> true
+</pre><p><strong>Example 3:</strong></p>
+<pre><strong>Input:</strong> num = "962"
+<strong>Output:</strong> false
+</pre><p><strong>Example 4:</strong></p>
+<pre><strong>Input:</strong> num = "1"
+<strong>Output:</strong> true
+</pre>
 
 
 ## Solutions

solution/0200-0299/0248.Strobogrammatic Number III/README.md

@@ -4,7 +4,19 @@
 
 ## 题目描述
 <!-- 这里写题目描述 -->
-None
+<p>中心对称数是指一个数字在旋转了 180 度之后看起来依旧相同的数字（或者上下颠倒地看）。</p>
+
+<p>写一个函数来计算范围在 [low, high] 之间中心对称数的个数。</p>
+
+<p><strong>示例:</strong></p>
+
+<pre><strong>输入:</strong> low = "50", high = "100"
+<strong>输出:</strong> 3 
+<strong>解释: </strong>69，88 和 96 是三个在该范围内的中心对称数</pre>
+
+<p><strong>注意:</strong><br>
+由于范围可能很大，所以 low 和 high 都用字符串表示。</p>
+
 
 
 ## 解法

solution/0200-0299/0248.Strobogrammatic Number III/README_EN.md

@@ -3,7 +3,20 @@
 [中文文档](/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README.md)
 
 ## Description
-None
+<p>A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down).</p>
+
+<p>Write a function to count the total strobogrammatic numbers that exist in the range of low <= num <= high.</p>
+
+<p><b>Example:</b></p>
+
+<pre>
+<b>Input:</b> low = "50", high = "100"
+<b>Output:</b> 3 
+<strong>Explanation: </strong>69, 88, and 96 are three strobogrammatic numbers.</pre>
+
+<p><strong>Note:</strong><br />
+Because the range might be a large number, the <em>low</em> and <em>high</em> numbers are represented as string.</p>
+
 
 
 ## Solutions

solution/0200-0299/0249.Group Shifted Strings/README.md

@@ -4,7 +4,26 @@
 
 ## 题目描述
 <!-- 这里写题目描述 -->
-None
+<p>给定一个字符串，对该字符串可以进行 “移位” 的操作，也就是将字符串中每个字母都变为其在字母表中后续的字母，比如：<code>"abc" -> "bcd"</code>。这样，我们可以持续进行 “移位” 操作，从而生成如下移位序列：</p>
+
+<pre>"abc" -> "bcd" -> ... -> "xyz"</pre>
+
+<p>给定一个包含仅小写字母字符串的列表，将该列表中所有满足 “移位” 操作规律的组合进行分组并返回。</p>
+
+<p> </p>
+
+<p><strong>示例：</strong></p>
+
+<pre><strong>输入：</strong><code>["abc", "bcd", "acef", "xyz", "az", "ba", "a", "z"]</code>
+<strong>输出：</strong>
+[
+  ["abc","bcd","xyz"],
+  ["az","ba"],
+  ["acef"],
+  ["a","z"]
+]
+<strong>解释：</strong>可以认为字母表首尾相接，所以 'z' 的后续为 'a'，所以 ["az","ba"] 也满足 “移位” 操作规律。</pre>
+
 
 
 ## 解法

solution/0200-0299/0249.Group Shifted Strings/README_EN.md

@@ -3,7 +3,26 @@
 [中文文档](/solution/0200-0299/0249.Group%20Shifted%20Strings/README.md)
 
 ## Description
-None
+<p>Given a string, we can "shift" each of its letter to its successive letter, for example: <code>"abc" -> "bcd"</code>. We can keep "shifting" which forms the sequence:</p>
+
+<pre>
+"abc" -> "bcd" -> ... -> "xyz"</pre>
+
+<p>Given a list of <strong>non-empty</strong> strings which contains only lowercase alphabets, group all strings that belong to the same shifting sequence.</p>
+
+<p><b>Example:</b></p>
+
+<pre>
+<b>Input:</b> <code>["abc", "bcd", "acef", "xyz", "az", "ba", "a", "z"],</code>
+<b>Output:</b> 
+[
+  ["abc","bcd","xyz"],
+  ["az","ba"],
+  ["acef"],
+  ["a","z"]
+]
+</pre>
+
 
 
 ## Solutions

solution/0200-0299/0250.Count Univalue Subtrees/README.md

@@ -4,7 +4,23 @@
 
 ## 题目描述
 <!-- 这里写题目描述 -->
-None
+<p>给定一个二叉树，统计该二叉树数值相同的子树个数。</p>
+
+<p>同值子树是指该子树的所有节点都拥有相同的数值。</p>
+
+<p><strong>示例：</strong></p>
+
+<pre><strong>输入: </strong>root = [5,1,5,5,5,null,5]
+
+              5
+             / \
+            1   5
+           / \   \
+          5   5   5
+
+<strong>输出:</strong> 4
+</pre>
+
 
 
 ## 解法

solution/0200-0299/0250.Count Univalue Subtrees/README_EN.md

@@ -3,7 +3,40 @@
 [中文文档](/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README.md)
 
 ## Description
-None
+<p>Given the <code>root</code> of a binary tree, return the number of <strong>uni-value</strong> subtrees.</p>
+
+<p>A <strong>uni-value subtree</strong> means all nodes of the subtree have the same value.</p>
+
+<p> </p>
+<p><strong>Example 1:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2020/08/21/unival_e1.jpg" style="width: 450px; height: 258px;" />
+<pre>
+<strong>Input:</strong> root = [5,1,5,5,5,null,5]
+<strong>Output:</strong> 4
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> root = []
+<strong>Output:</strong> 0
+</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> root = [5,5,5,5,5,null,5]
+<strong>Output:</strong> 6
+</pre>
+
+<p> </p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li>The numbrt of the node in the tree will be in the range <code>[0, 1000]</code>.</li>
+	<li><code>-1000 <= Node.val <= 1000</code></li>
+</ul>
+
 
 
 ## Solutions