update problems content

Author: 2xiao

assets/output/0001.md

@@ -4,113 +4,50 @@
 
 ## 题目
 
-Given an array of integers `nums` and an integer `target`, return _indices of
-the two numbers such that they add up to`target`_.
+<p>给定一个整数数组 <code>nums</code>&nbsp;和一个整数目标值 <code>target</code>，请你在该数组中找出 <strong>和为目标值 </strong><em><code>target</code></em>&nbsp; 的那&nbsp;<strong>两个</strong>&nbsp;整数，并返回它们的数组下标。</p>
 
-You may assume that each input would have **_exactly_ one solution**, and you
-may not use the _same_ element twice.
+<p>你可以假设每种输入只会对应一个答案，并且你不能使用两次相同的元素。</p>
 
-You can return the answer in any order.
+<p>你可以按任意顺序返回答案。</p>
 
+<p>&nbsp;</p>
 
+<p><strong class="example">示例 1：</strong></p>
 
-**Example 1:**
+<pre>
+<strong>输入：</strong>nums = [2,7,11,15], target = 9
+<strong>输出：</strong>[0,1]
+<strong>解释：</strong>因为 nums[0] + nums[1] == 9 ，返回 [0, 1] 。
+</pre>
 
-> Input: nums = [2,7,11,15], target = 9
-> 
-> Output: [0,1]
-> 
-> Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
+<p><strong class="example">示例 2：</strong></p>
 
-**Example 2:**
+<pre>
+<strong>输入：</strong>nums = [3,2,4], target = 6
+<strong>输出：</strong>[1,2]
+</pre>
 
-> Input: nums = [3,2,4], target = 6
-> 
-> Output: [1,2]
+<p><strong class="example">示例 3：</strong></p>
 
-**Example 3:**
+<pre>
+<strong>输入：</strong>nums = [3,3], target = 6
+<strong>输出：</strong>[0,1]
+</pre>
 
-> Input: nums = [3,3], target = 6
-> 
-> Output: [0,1]
+<p>&nbsp;</p>
 
-**Constraints:**
+<p><strong>提示：</strong></p>
 
-  * `2 <= nums.length <= 10^4`
-  * `-10^9 <= nums[i] <= 10^9`
-  * `-10^9 <= target <= 10^9`
-  * **Only one valid answer exists.**
+<ul>
+	<li><code>2 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
+	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
+	<li><code>-10<sup>9</sup> &lt;= target &lt;= 10<sup>9</sup></code></li>
+	<li><strong>只会存在一个有效答案</strong></li>
+</ul>
 
+<p>&nbsp;</p>
 
-
-**Follow-up:  **Can you come up with an algorithm that is less than `O(n2)`
-time complexity?
-
-
-## 题目大意
-
-给定一个整数数组 `nums` 和一个整数目标值 `target`，请你在该数组中找出 **和为目标值** _`target`_   的那 **两个**
-整数，并返回它们的数组下标。
-
-你可以假设每种输入只会对应一个答案，并且你不能使用两次相同的元素。
-
-你可以按任意顺序返回答案。
-
-
-
-**示例 1：**
-
-> 
-> 
-> 
-> 
-> 
-> **输入：** nums = [2,7,11,15], target = 9
-> 
-> **输出：**[0,1]
-> 
-> **解释：** 因为 nums[0] + nums[1] == 9 ，返回 [0, 1] 。
-> 
-> 
-
-**示例 2：**
-
-> 
-> 
-> 
-> 
-> 
-> **输入：** nums = [3,2,4], target = 6
-> 
-> **输出：**[1,2]
-> 
-> 
-
-**示例 3：**
-
-> 
-> 
-> 
-> 
-> 
-> **输入：** nums = [3,3], target = 6
-> 
-> **输出：**[0,1]
-> 
-> 
-
-
-
-**提示：**
-
-  * `2 <= nums.length <= 10^4`
-  * `-10^9 <= nums[i] <= 10^9`
-  * `-10^9 <= target <= 10^9`
-  * **只会存在一个有效答案**
-
-
-
-**进阶：** 你可以想出一个时间复杂度小于 `O(n2)` 的算法吗？
+<p><strong>进阶：</strong>你可以想出一个时间复杂度小于 <code>O(n<sup>2</sup>)</code> 的算法吗？</p>
 
 
 ## 解题思路
@@ -138,7 +75,7 @@ time complexity?
 | 560 | [和为 K 的子数组](https://leetcode.com/problems/subarray-sum-equals-k) | [[✓]](/problem/0560.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`前缀和`](/tag/prefix-sum.md) | <font color=#ffb800>Medium</font> |
 | 653 | [两数之和 IV - 输入二叉搜索树](https://leetcode.com/problems/two-sum-iv-input-is-a-bst) |  |  [`树`](/tag/tree.md) [`深度优先搜索`](/tag/depth-first-search.md) [`广度优先搜索`](/tag/breadth-first-search.md) `4+` | <font color=#15bd66>Easy</font> |
 | 1099 | [小于 K 的两数之和](https://leetcode.com/problems/two-sum-less-than-k) |  |  [`数组`](/tag/array.md) [`双指针`](/tag/two-pointers.md) [`二分查找`](/tag/binary-search.md) `1+` | <font color=#15bd66>Easy</font> |
-| 1679 | [K 和数对的最大数目](https://leetcode.com/problems/max-number-of-k-sum-pairs) |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |
+| 1679 | [K 和数对的最大数目](https://leetcode.com/problems/max-number-of-k-sum-pairs) | [[✓]](/problem/1679.md) |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `1+` | <font color=#ffb800>Medium</font> |
 | 1711 | [大餐计数](https://leetcode.com/problems/count-good-meals) |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | <font color=#ffb800>Medium</font> |
 | 2006 | [差的绝对值为 K 的数对数目](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k) |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`计数`](/tag/counting.md) | <font color=#15bd66>Easy</font> |
 | 2023 | [连接后等于目标字符串的字符串对](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target) |  |  [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) `1+` | <font color=#ffb800>Medium</font> |

assets/output/0002.md

@@ -4,106 +4,45 @@
 
 ## 题目
 
-You are given two **non-empty** linked lists representing two non-negative
-integers. The digits are stored in **reverse order** , and each of their nodes
-contains a single digit. Add the two numbers and return the sum as a linked
-list.
+<p>给你两个&nbsp;<strong>非空</strong> 的链表，表示两个非负的整数。它们每位数字都是按照&nbsp;<strong>逆序</strong>&nbsp;的方式存储的，并且每个节点只能存储&nbsp;<strong>一位</strong>&nbsp;数字。</p>
 
-You may assume the two numbers do not contain any leading zero, except the
-number 0 itself.
+<p>请你将两个数相加，并以相同形式返回一个表示和的链表。</p>
 
+<p>你可以假设除了数字 0 之外，这两个数都不会以 0&nbsp;开头。</p>
 
+<p>&nbsp;</p>
 
-**Example 1:**
+<p><strong class="example">示例 1：</strong></p>
+<img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2021/01/02/addtwonumber1.jpg" style="width: 483px; height: 342px;" />
+<pre>
+<strong>输入：</strong>l1 = [2,4,3], l2 = [5,6,4]
+<strong>输出：</strong>[7,0,8]
+<strong>解释：</strong>342 + 465 = 807.
+</pre>
 
-![](https://assets.leetcode.com/uploads/2020/10/02/addtwonumber1.jpg)
+<p><strong class="example">示例 2：</strong></p>
 
-> Input: l1 = [2,4,3], l2 = [5,6,4]
-> 
-> Output: [7,0,8]
-> 
-> Explanation: 342 + 465 = 807.
+<pre>
+<strong>输入：</strong>l1 = [0], l2 = [0]
+<strong>输出：</strong>[0]
+</pre>
 
-**Example 2:**
+<p><strong class="example">示例 3：</strong></p>
 
-> Input: l1 = [0], l2 = [0]
-> 
-> Output: [0]
+<pre>
+<strong>输入：</strong>l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
+<strong>输出：</strong>[8,9,9,9,0,0,0,1]
+</pre>
 
-**Example 3:**
+<p>&nbsp;</p>
 
-> Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
-> 
-> Output: [8,9,9,9,0,0,0,1]
+<p><strong>提示：</strong></p>
 
-**Constraints:**
-
-  * The number of nodes in each linked list is in the range `[1, 100]`.
-  * `0 <= Node.val <= 9`
-  * It is guaranteed that the list represents a number that does not have leading zeros.
-
-
-## 题目大意
-
-给你两个 **非空** 的链表，表示两个非负的整数。它们每位数字都是按照 **逆序**  的方式存储的，并且每个节点只能存储 **一位**  数字。
-
-请你将两个数相加，并以相同形式返回一个表示和的链表。
-
-你可以假设除了数字 0 之外，这两个数都不会以 0 开头。
-
-
-
-**示例 1：**
-
-![](https://assets.leetcode-cn.com/aliyun-lc-
-upload/uploads/2021/01/02/addtwonumber1.jpg)
-
-> 
-> 
-> 
-> 
-> 
-> **输入：** l1 = [2,4,3], l2 = [5,6,4]
-> 
-> **输出：**[7,0,8]
-> 
-> **解释：** 342 + 465 = 807.
-> 
-> 
-
-**示例 2：**
-
-> 
-> 
-> 
-> 
-> 
-> **输入：** l1 = [0], l2 = [0]
-> 
-> **输出：**[0]
-> 
-> 
-
-**示例 3：**
-
-> 
-> 
-> 
-> 
-> 
-> **输入：** l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
-> 
-> **输出：**[8,9,9,9,0,0,0,1]
-> 
-> 
-
-
-
-**提示：**
-
-  * 每个链表中的节点数在范围 `[1, 100]` 内
-  * `0 <= Node.val <= 9`
-  * 题目数据保证列表表示的数字不含前导零
+<ul>
+	<li>每个链表中的节点数在范围 <code>[1, 100]</code> 内</li>
+	<li><code>0 &lt;= Node.val &lt;= 9</code></li>
+	<li>题目数据保证列表表示的数字不含前导零</li>
+</ul>
 
 
 ## 解题思路