Update: problems descriptions

Author: zhongdongy

src/problems/p000_0xx/p000_005.rs

@@ -2,6 +2,28 @@
 ///
 /// It's possible to have multiple correct answer.
 /// See `tests/cases/c000_0xx/c000_005.rs` for more info.
+/// 
+/// ### Description
+/// 
+/// Given a string `s`, return the longest palindromic substring in `s`.
+/// 
+/// | Example 1 |
+/// | :-- |
+/// | Input: s = "babad" |
+/// | Output: "bab" |
+/// 
+/// Explanation: "aba" is also a valid answer.
+/// 
+/// | Example 2 |
+/// | :-- |
+/// | Input: s = "cbbd" |
+/// | Output: "bb" |
+///  
+/// Constraints:
+/// - `1 <= s.length <= 1000`
+/// - `s` consist of only digits and English letters.
+/// 
+/// Source: https://leetcode.com/problems/longest-palindromic-substring/
 ///
 /// ### Arguments
 /// * `s` - original string to search.

src/problems/p000_0xx/p000_006.rs

@@ -6,6 +6,56 @@ pub enum Algorithm {
 /// Get a ZigZag matrix using given string and column-first algorithm.
 ///
 /// Two solutions available, use second argument to decide which to use.
+/// 
+/// ### Description
+/// 
+/// The string "PAYPALISHIRING" is written in a zigzag pattern on a given 
+/// number of rows like this: (you may want to display this pattern in a fixed 
+/// font for better legibility)
+/// 
+/// ```plain
+/// P   A   H   N
+/// A P L S I I G
+/// Y   I   R
+/// ```
+/// 
+/// And then read line by line: "PAHNAPLSIIGYIR"
+/// 
+/// Write the code that will take a string and make this conversion given a 
+/// number of rows:
+/// 
+/// string convert(string `s`, int `numRows`);
+///  
+/// | Example 1 |
+/// | :-- |
+/// | Input: s = "PAYPALISHIRING", numRows = 3 |
+/// | Output: "PAHNAPLSIIGYIR" |
+/// 
+/// | Example 2 |
+/// | :-- |
+/// | Input: s = "PAYPALISHIRING", numRows = 4 |
+/// | Output: "PINALSIGYAHRPI" |
+/// 
+/// Explanation: 
+/// ```plain
+/// P     I    N 
+/// A   L S  I G 
+/// Y A   H R 
+/// P     I 
+/// ``` 
+/// 
+/// | Example 3 |
+/// | :-- |
+/// | Input: s = "A", numRows = 1 |
+/// | Output: "A" |
+///  
+/// 
+/// Constraints:
+/// - `1 <= s.length <= 1000`
+/// - `s` consists of English letters (lower-case and upper-case), ',' and '.'.
+/// - `1 <= numRows <= 1000`
+/// 
+/// Source: https://leetcode.com/problems/zigzag-conversion/
 ///
 /// ### Arguments
 /// * `s` - original string to convert.

src/problems/p000_0xx/p000_007.rs

@@ -5,31 +5,33 @@
 ///
 /// ### Description
 ///
-/// Given a signed 32-bit integer x, return x with its digits reversed.
-/// If reversing x causes the value to go outside the signed 32-bit integer
-/// range [-231, 231 - 1], then return 0.
+/// Given a signed 32-bit integer `x`, return `x` with its digits reversed.
+/// If reversing `x` causes the value to go outside the signed 32-bit integer
+/// range \[-2^31, 2^31 - 1\], then return 0.
 ///
-/// Assume the environment does not allow you to store 64-bit integers (signed or /// unsigned).
+/// Assume the environment does not allow you to store 64-bit integers (signed 
+/// or unsigned).
 ///
-///  
-///
-/// Example 1:
-///
-/// Input: x = 123
-/// Output: 321
-/// Example 2:
 ///
-/// Input: x = -123
-/// Output: -321
-/// Example 3:
+/// | Example 1 |
+/// | :-- |
+/// | Input: x = 123 |
+/// | Output: 321 |
 ///
-/// Input: x = 120
-/// Output: 21
+/// | Example 2 |
+/// | :-- |
+/// | Input: x = -123 |
+/// | Output: -321 |
+/// 
+/// | Example 3 |
+/// | :-- |
+/// | Input: x = 120 |
+/// | Output: 21 |
 ///  
 ///
 /// Constraints:
 ///
-/// -231 <= x <= 231 - 1
+/// - `-2^31 <= x <= 2^31 - 1`
 ///
 /// Source: https://leetcode.com/problems/reverse-integer/description/
 ///

src/problems_cn/p000_0xx/p000_005.rs

@@ -2,6 +2,33 @@
 ///
 /// 可能出现同一个字符串有多个最长回文子串的现象
 /// 参照 `tests/cases_cn/c000_0xx/c000_005.rs` 了解测试用例
+/// 
+/// ### 题目描述
+/// 
+/// 给你一个字符串 `s`，找到 `s` 中最长的回文子串。
+/// 
+/// 如果字符串的反序与原始字符串相同，则该字符串称为回文字符串。
+/// 
+/// | 示例 1 | 
+/// | :-- |
+/// | 输入：s = "babad" |
+/// | 输出："bab" |
+/// 
+/// 解释："aba" 同样是符合题意的答案。
+/// 
+/// | 示例 2 |
+/// | :-- |
+/// | 输入：s = "cbbd" |
+/// | 输出："bb" |
+///  
+/// 
+/// 提示：
+/// - `1 <= s.length <= 1000`
+/// - `s` 仅由数字和英文字母组成
+/// 
+/// 来源：力扣（LeetCode）
+/// 链接：https://leetcode.cn/problems/longest-palindromic-substring
+/// 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
 ///
 /// ### Arguments
 /// * `s` - 待搜索的原始字符串.

src/problems_cn/p000_0xx/p000_006.rs

@@ -6,6 +6,60 @@ pub enum Algorithm {
 /// Z 字形变换
 ///
 /// 可以通过第三个参数选择要使用的算法
+/// 
+/// ### 题目描述
+/// 
+/// 将一个给定字符串 `s` 根据给定的行数 `numRows` ，以从上往下、从左到右进行 Z 字形排列。
+/// 
+/// 比如输入字符串为 "PAYPALISHIRING" 行数为 3 时，排列如下：
+/// 
+/// ```plain
+/// P   A   H   N
+/// A P L S I I G
+/// Y   I   R
+/// ```
+/// 
+/// 之后，你的输出需要从左往右逐行读取，产生出一个新的字符串，比如："PAHNAPLSIIGYIR"。
+/// 
+/// 请你实现这个将字符串进行指定行数变换的函数：
+/// 
+/// `string convert(string s, int numRows);`
+///  
+/// 
+/// | 示例 1 |
+/// | :-- |
+/// | 输入：s = "PAYPALISHIRING", numRows = 3 |
+/// | 输出："PAHNAPLSIIGYIR" |
+/// 
+/// | 示例 2 |
+/// | :-- |
+/// | 输入：s = "PAYPALISHIRING", numRows = 4 |
+/// | 输出："PINALSIGYAHRPI" |
+/// 
+/// 
+/// 解释：
+/// 
+/// ```plain
+/// P     I    N
+/// A   L S  I G
+/// Y A   H R
+/// P     I
+/// ```
+/// 
+/// | 示例 3 |
+/// | :-- |
+/// | 输入： s = "A", numRows = 1 |
+/// | 输出："A" |
+///  
+/// 提示：
+/// 
+/// - `1 <= s.length <= 1000`
+/// - `s` 由英文字母（小写和大写）、',' 和 '.' 组成
+/// - `1 <= numRows <= 1000`
+/// 
+/// 来源：力扣（LeetCode）
+/// 链接：https://leetcode.cn/problems/zigzag-conversion
+/// 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
 ///
 /// ### Arguments
 /// * `s` - 等待变换的字符串

src/problems_cn/p000_0xx/p000_007.rs

@@ -1,34 +1,36 @@
 /// 32 位整型反转的同时检查溢出
 ///
 /// ### 题目说明
-/// 给你一个 32 位的有符号整数 x ，返回将 x 中的数字部分反转后的结果。
+/// 给你一个 32 位的有符号整数 `x` ，返回将 `x` 中的数字部分反转后的结果。
 ///
-/// 如果反转后整数超过 32 位的有符号整数的范围 [−231,  231 − 1] ，就返回 0。
+/// 如果反转后整数超过 32 位的有符号整数的范围 [−2^31,  2^31 − 1] ，就返回 0。
 ///
 /// 假设环境不允许存储 64 位整数（有符号或无符号）。
 ///
 ///
-/// 示例 1：
-///
-/// 输入：x = 123
-/// 输出：321
-/// 示例 2：
-///
-/// 输入：x = -123
-/// 输出：-321
-/// 示例 3：
-///
-/// 输入：x = 120
-/// 输出：21
-/// 示例 4：
-///
-/// 输入：x = 0
-/// 输出：0
-///
+/// | 示例 1 |
+/// | :-- |
+/// | 输入：x = 123 |
+/// | 输出：321 |
+/// 
+/// | 示例 2 |
+/// | :-- |
+/// | 输入：x = -123 |
+/// | 输出：-321 |
+/// 
+/// | 示例 3 |
+/// | :-- |
+/// | 输入：x = 120 |
+/// | 输出：21 |
+/// 
+/// | 示例 4 |
+/// | :-- |
+/// | 输入：x = 0 |
+/// | 输出：0 |
 ///
 /// 提示：
 ///
-/// -231 <= x <= 231 - 1
+/// - `-2^31 <= x <= 2^31 - 1`
 ///
 /// 来源：力扣（LeetCode）
 /// 链接：https://leetcode.cn/problems/reverse-integer