chore: update lc problems (#4563)

Author: yanglbme

solution/0000-0099/0023.Merge k Sorted Lists/README_EN.md

@@ -35,7 +35,7 @@ tags:
   1->3->4,
   2->6
 ]
-merging them into one sorted list:
+merging them into one sorted linked list:
 1->1->2->3->4->4->5->6
 </pre>
 

solution/0200-0299/0282.Expression Add Operators/README_EN.md

@@ -22,6 +22,8 @@ tags:
 
 <p>Note that operands in the returned expressions <strong>should not</strong> contain leading zeros.</p>
 
+<p><strong>Note</strong> that a number can contain multiple digits.</p>
+
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 

solution/0400-0499/0405.Convert a Number to Hexadecimal/README.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0400-0499/0405.Co
 tags:
     - 位运算
     - 数学
+    - 字符串
 ---
 
 <!-- problem:start -->

solution/0400-0499/0405.Convert a Number to Hexadecimal/README_EN.md

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0400-0499/0405.Co
 tags:
     - Bit Manipulation
     - Math
+    - String
 ---
 
 <!-- problem:start -->

solution/0500-0599/0504.Base 7/README.md

@@ -4,6 +4,7 @@ difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0500-0599/0504.Base%207/README.md
 tags:
     - 数学
+    - 字符串
 ---
 
 <!-- problem:start -->

solution/0500-0599/0504.Base 7/README_EN.md

@@ -4,6 +4,7 @@ difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0500-0599/0504.Base%207/README_EN.md
 tags:
     - Math
+    - String
 ---
 
 <!-- problem:start -->

solution/0800-0899/0883.Projection Area of 3D Shapes/README.md

@@ -21,7 +21,7 @@ tags:
 
 <p>在<meta charset="UTF-8" />&nbsp;<code>n x n</code>&nbsp;的网格<meta charset="UTF-8" />&nbsp;<code>grid</code>&nbsp;中，我们放置了一些与 x，y，z 三轴对齐的<meta charset="UTF-8" />&nbsp;<code>1 x 1 x 1</code>&nbsp;立方体。</p>
 
-<p>每个值&nbsp;<code>v = grid[i][j]</code>&nbsp;表示 <code>v</code>&nbsp;个正方体叠放在单元格&nbsp;<code>(i, j)</code>&nbsp;上。</p>
+<p>每个值&nbsp;<code>v = grid[i][j]</code>&nbsp;表示有一列&nbsp;<code>v</code>&nbsp;个正方体叠放在格子&nbsp;<code>(i, j)</code>&nbsp;上。</p>
 
 <p>现在，我们查看这些立方体在 <code>xy</code>&nbsp;、<code>yz</code>&nbsp;和 <code>zx</code>&nbsp;平面上的<em>投影</em>。</p>
 

solution/0900-0999/0975.Odd Even Jump/README.md

@@ -7,6 +7,7 @@ tags:
     - 数组
     - 动态规划
     - 有序集合
+    - 排序
     - 单调栈
 ---
 

solution/0900-0999/0975.Odd Even Jump/README_EN.md

@@ -7,6 +7,7 @@ tags:
     - Array
     - Dynamic Programming
     - Ordered Set
+    - Sorting
     - Monotonic Stack
 ---
 

solution/1300-1399/1353.Maximum Number of Events That Can Be Attended/README_EN.md

@@ -23,7 +23,7 @@ tags:
 
 <p>You are given an array of <code>events</code> where <code>events[i] = [startDay<sub>i</sub>, endDay<sub>i</sub>]</code>. Every event <code>i</code> starts at <code>startDay<sub>i</sub></code><sub> </sub>and ends at <code>endDay<sub>i</sub></code>.</p>
 
-<p>You can attend an event <code>i</code> at any day <code>d</code> where <code>startTime<sub>i</sub> &lt;= d &lt;= endTime<sub>i</sub></code>. You can only attend one event at any time <code>d</code>.</p>
+<p>You can attend an event <code>i</code> at any day <code>d</code> where <code>startDay<sub>i</sub> &lt;= d &lt;= endDay<sub>i</sub></code>. You can only attend one event at any time <code>d</code>.</p>
 
 <p>Return <em>the maximum number of events you can attend</em>.</p>