LeetCode 付费题目描述 400~600

Author: LjyYano

solution/0400-0499/0408.Valid Word Abbreviation/README.md

@@ -4,7 +4,35 @@
 
 ## 题目描述
 <!-- 这里写题目描述 -->
-None
+<p>给一个 <strong>非空</strong> 字符串 <code>s</code> 和一个单词缩写 <code>abbr</code> ，判断这个缩写是否可以是给定单词的缩写。</p>
+
+<p>字符串 <code>"word"</code> 的所有有效缩写为：</p>
+
+<pre>["word", "1ord", "w1rd", "wo1d", "wor1", "2rd", "w2d", "wo2", "1o1d", "1or1", "w1r1", "1o2", "2r1", "3d", "w3", "4"]</pre>
+
+<p>注意单词 <code>"word"</code> 的所有有效缩写仅包含以上这些。任何其他的字符串都不是 <code>"word"</code> 的有效缩写。</p>
+
+<p><strong>注意:</strong><br>
+假设字符串 <code>s</code> 仅包含小写字母且 <code>abbr</code> 只包含小写字母和数字。</p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre>给定 <strong>s</strong> = "internationalization", <strong>abbr</strong> = "i12iz4n":
+
+函数返回 true.
+</pre>
+
+<p> </p>
+
+<p><strong>示例 2:</strong></p>
+
+<pre>给定 <strong>s</strong> = "apple", <strong>abbr</strong> = "a2e":
+
+函数返回 false.
+</pre>
+
+<p> </p>
+
 
 
 ## 解法

solution/0400-0499/0408.Valid Word Abbreviation/README_EN.md

@@ -3,7 +3,36 @@
 [中文文档](/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README.md)
 
 ## Description
-None
+<p>
+Given a <b>non-empty</b> string <code>s</code> and an abbreviation <code>abbr</code>, return whether the string matches with the given abbreviation.
+</p>
+
+<p>A string such as <code>"word"</code> contains only the following valid abbreviations:</p>
+
+<pre>["word", "1ord", "w1rd", "wo1d", "wor1", "2rd", "w2d", "wo2", "1o1d", "1or1", "w1r1", "1o2", "2r1", "3d", "w3", "4"]
+</pre>
+
+<p>Notice that only the above abbreviations are valid abbreviations of the string <code>"word"</code>. Any other string is not a valid abbreviation of <code>"word"</code>.</p>
+
+<p><b>Note:</b><br />
+Assume <code>s</code> contains only lowercase letters and <code>abbr</code> contains only lowercase letters and digits.
+</p>
+
+<p><b>Example 1:</b><br />
+<pre>
+Given <b>s</b> = "internationalization", <b>abbr</b> = "i12iz4n":
+
+Return true.
+</pre>
+</p>
+
+<p><b>Example 2:</b><br />
+<pre>
+Given <b>s</b> = "apple", <b>abbr</b> = "a2e":
+
+Return false.
+</pre>
+</p>
 
 
 ## Solutions

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

@@ -4,7 +4,32 @@
 
 ## 题目描述
 <!-- 这里写题目描述 -->
-None
+<p>字符串 <code>"word"</code> 包含以下这些缩写形式：</p>
+
+<pre>["word", "1ord", "w1rd", "wo1d", "wor1", "2rd", "w2d", "wo2", "1o1d", "1or1", "w1r1", "1o2", "2r1", "3d", "w3", "4"]</pre>
+
+<p>给一个目标字符串和一个字符串字典，为目标字符串找一个 <strong>最短 </strong>长度的缩写字符串，同时这个缩写字符串不是字典中其他字符串的缩写形式。</p>
+
+<p>缩写形式中每一个 <strong>数字</strong> 或者字母都被视为长度为 1 。比方说，缩写形式 "a32bc" 的长度为 4 而不是 5 。</p>
+
+<p><strong>注意:</strong></p>
+
+<ul>
+	<li>如果像第二个示例一样有多个有效答案，你可以返回它们中的任意一个。</li>
+	<li>假设目标字符串的长度为 <strong>m </strong>，字典中的字符串数目为 <strong>n</strong> 。你可以假设 <strong>m ≤ 21</strong>， <strong>n ≤ 1000</strong>， 且 <strong>log<sub>2</sub>(n) + m ≤ 20</strong>.</li>
+</ul>
+
+<p> </p>
+
+<p><strong>示例:</strong></p>
+
+<pre>"apple", ["blade"] -> "a4" (因为 "5" 或者 "4e" 同时也是 "blade" 的缩写形式，所以它们是无效的缩写)
+
+"apple", ["plain", "amber", "blade"] -> "1p3" (其他有效的缩写形式还包括 "ap3", "a3e", "2p2", "3le", "3l1")。
+</pre>
+
+<p> </p>
+
 
 
 ## 解法

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

@@ -3,7 +3,32 @@
 [中文文档](/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README.md)
 
 ## Description
-None
+<p>A string such as <code>"word"</code> contains the following abbreviations:</p>
+
+<pre>
+["word", "1ord", "w1rd", "wo1d", "wor1", "2rd", "w2d", "wo2", "1o1d", "1or1", "w1r1", "1o2", "2r1", "3d", "w3", "4"]
+</pre>
+
+<p>Given a target string and a set of strings in a dictionary, find an abbreviation of this target string with the <b><i>smallest possible</i></b> length such that it does not conflict with abbreviations of the strings in the dictionary.</p>
+
+<p>Each <b>number</b> or letter in the abbreviation is considered length = 1. For example, the abbreviation "a32bc" has length = 4.</p>
+
+<p><b>Examples:</b></p>
+
+<pre>
+"apple", ["blade"] -> "a4" (because "5" or "4e" conflicts with "blade")
+
+"apple", ["plain", "amber", "blade"] -> "1p3" (other valid answers include "ap3", "a3e", "2p2", "3le", "3l1").
+</pre>
+
+<p> </p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li>In the case of multiple answers as shown in the second example below, you may return any one of them.</li>
+	<li>Assume length of target string = <b>m</b>, and dictionary size = <b>n</b>. You may assume that <b>m ≤ 21</b>, <b>n ≤ 1000</b>, and <b>log<sub>2</sub>(n) + m ≤ 20</b>.</li>
+</ul>
+
 
 
 ## Solutions

solution/0400-0499/0418.Sentence Screen Fitting/README.md

@@ -4,7 +4,75 @@
 
 ## 题目描述
 <!-- 这里写题目描述 -->
-None
+<p>给你一个 <code>rows x cols</code> 的屏幕和一个用 <strong>非空 </strong>的单词列表组成的句子，请你计算出给定句子可以在屏幕上完整显示的次数。</p>
+
+<p><strong>注意：</strong></p>
+
+<ol>
+	<li>一个单词不能拆分成两行。</li>
+	<li>单词在句子中的顺序必须保持不变。</li>
+	<li><strong>在一行中 </strong>的两个连续单词必须用一个空格符分隔。</li>
+	<li>句子中的单词总量不会超过 100。</li>
+	<li>每个单词的长度大于 0 且不会超过 10。</li>
+	<li>1 ≤ <code>rows</code>, <code>cols</code> ≤ 20,000.</li>
+</ol>
+
+<p> </p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>
+rows = 2, cols = 8, 句子 sentence = ["hello", "world"]
+
+<strong>输出：</strong>
+1
+
+<strong>解释：</strong>
+hello---
+world---
+
+<strong>字符 '-' 表示屏幕上的一个空白位置。</strong>
+</pre>
+
+<p> </p>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>
+rows = 3, cols = 6, 句子 sentence = ["a", "bcd", "e"]
+
+<strong>输出：</strong>
+2
+
+<strong>解释：</strong>
+a-bcd- 
+e-a---
+bcd-e-
+
+<strong>字符 '-' 表示屏幕上的一个空白位置。</strong>
+</pre>
+
+<p> </p>
+
+<p><strong>示例 3：</strong></p>
+
+<pre><strong>输入：</strong>
+rows = 4, cols = 5, 句子 sentence = ["I", "had", "apple", "pie"]
+
+<strong>输出：</strong>
+1
+
+<strong>解释：</strong>
+I-had
+apple
+pie-I
+had--
+
+<strong>字符 '-' 表示屏幕上的一个空白位置。</strong>
+</pre>
+
+<p> </p>
+
 
 
 ## 解法

solution/0400-0499/0418.Sentence Screen Fitting/README_EN.md

@@ -3,7 +3,73 @@
 [中文文档](/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README.md)
 
 ## Description
-None
+<p>Given a <code>rows x cols</code> screen and a sentence represented by a list of <b>non-empty</b> words, find <b>how many times</b> the given sentence can be fitted on the screen.
+</p>
+
+<p><b>Note:</b>
+<ol>
+<li>A word cannot be split into two lines.</li>
+<li>The order of words in the sentence must remain unchanged.</li>
+<li>Two consecutive words <b>in a line</b> must be separated by a single space.</li>
+<li>Total words in the sentence won't exceed 100.</li>
+<li>Length of each word is greater than 0 and won't exceed 10.</li>
+<li>1 ≤ rows, cols ≤ 20,000.</li>
+</ol>
+</p>
+
+<p>
+<b>Example 1:</b> 
+<pre>
+<b>Input:</b>
+rows = 2, cols = 8, sentence = ["hello", "world"]
+
+<b>Output:</b> 
+1
+
+<b>Explanation:</b>
+hello---
+world---
+
+The character '-' signifies an empty space on the screen.
+</pre>
+</p>
+
+<p>
+<b>Example 2:</b> 
+<pre>
+<b>Input:</b>
+rows = 3, cols = 6, sentence = ["a", "bcd", "e"]
+
+<b>Output:</b> 
+2
+
+<b>Explanation:</b>
+a-bcd- 
+e-a---
+bcd-e-
+
+The character '-' signifies an empty space on the screen.
+</pre>
+</p>
+
+<p>
+<b>Example 3:</b> 
+<pre>
+<b>Input:</b>
+rows = 4, cols = 5, sentence = ["I", "had", "apple", "pie"]
+
+<b>Output:</b> 
+1
+
+<b>Explanation:</b>
+I-had
+apple
+pie-I
+had--
+
+The character '-' signifies an empty space on the screen.
+</pre>
+</p>
 
 
 ## Solutions

solution/0400-0499/0422.Valid Word Square/README.md

@@ -4,7 +4,89 @@
 
 ## 题目描述
 <!-- 这里写题目描述 -->
-None
+<p>给你一个单词序列，判断其是否形成了一个有效的单词方块。</p>
+
+<p>有效的单词方块是指此由单词序列组成的文字方块的 第 k 行 和 第 k 列 (0 ≤ <em>k</em> < max(行数, 列数)) 所显示的字符串完全相同。</p>
+
+<p><strong>注意：</strong></p>
+
+<ol>
+	<li>给定的单词数大于等于 1 且不超过 500。</li>
+	<li>单词长度大于等于 1 且不超过 500。</li>
+	<li>每个单词只包含小写英文字母 <code>a-z</code>。</li>
+</ol>
+
+<p> </p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>
+[
+  "abcd",
+  "bnrt",
+  "crmy",
+  "dtye"
+]
+
+<strong>输出：</strong>
+true
+
+<strong>解释：</strong>
+第 1 行和第 1 列都是 "abcd"。
+第 2 行和第 2 列都是 "bnrt"。
+第 3 行和第 3 列都是 "crmy"。
+第 4 行和第 4 列都是 "dtye"。
+
+因此，这是一个有效的单词方块。
+</pre>
+
+<p> </p>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>
+[
+  "abcd",
+  "bnrt",
+  "crm",
+  "dt"
+]
+
+<strong>输出：</strong>
+true
+
+<strong>解释：</strong>
+第 1 行和第 1 列都是 "abcd"。
+第 2 行和第 2 列都是 "bnrt"。
+第 3 行和第 3 列都是 "crm"。
+第 4 行和第 4 列都是 "dt"。
+
+因此，这是一个有效的单词方块。
+</pre>
+
+<p> </p>
+
+<p><strong>示例 3：</strong></p>
+
+<pre><strong>输入：</strong>
+[
+  "ball",
+  "area",
+  "read",
+  "lady"
+]
+
+<strong>输出：</strong>
+false
+
+<strong>解释：</strong>
+第 3 行是 "read" ，然而第 3 列是 "lead"。
+
+因此，这 <strong>不是</strong> 一个有效的单词方块。
+</pre>
+
+<p> </p>
+
 
 
 ## 解法