feat: add weekly contest (doocs#3926)

Author: yanglbme

solution/0000-0099/0079.Word Search/README.md

@@ -3,6 +3,7 @@ comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0000-0099/0079.Word%20Search/README.md
 tags:
+    - 深度优先搜索
     - 数组
     - 字符串
     - 回溯

solution/0000-0099/0079.Word Search/README_EN.md

@@ -3,6 +3,7 @@ comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/0000-0099/0079.Word%20Search/README_EN.md
 tags:
+    - Depth-First Search
     - Array
     - String
     - Backtracking

solution/0100-0199/0151.Reverse Words in a String/README.md

@@ -30,8 +30,8 @@ tags:
 <p><strong>示例 1：</strong></p>
 
 <pre>
-<strong>输入：</strong>s = "<code>the sky is blue</code>"
-<strong>输出：</strong>"<code>blue is sky the</code>"
+<strong>输入：</strong>s = "the sky is blue"
+<strong>输出：</strong>"blue is sky the"
 </pre>
 
 <p><strong>示例 2：</strong></p>

solution/0100-0199/0153.Find Minimum in Rotated Sorted Array/README.md

@@ -45,7 +45,7 @@ tags:
 <pre>
 <strong>输入：</strong>nums = [4,5,6,7,0,1,2]
 <strong>输出：</strong>0
-<strong>解释：</strong>原数组为 [0,1,2,4,5,6,7] ，旋转 3 次得到输入数组。
+<strong>解释：</strong>原数组为 [0,1,2,4,5,6,7] ，旋转 4 次得到输入数组。
 </pre>
 
 <p><strong>示例 3：</strong></p>

solution/0100-0199/0185.Department Top Three Salaries/README.md

@@ -104,6 +104,14 @@ Department  表:
 - 山姆的薪水第二高
 - 没有第三高的工资，因为只有两名员工</pre>
 
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li>没有姓名、薪资和部门 <strong>完全</strong> 相同的员工。</li>
+</ul>
+
 <!-- description:end -->
 
 ## 解法

solution/0100-0199/0185.Department Top Three Salaries/README_EN.md

@@ -104,6 +104,13 @@ In the Sales department:
 - There is no third-highest salary as there are only two employees
 </pre>
 
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li>There are no employees with the <strong>exact</strong> same name, salary <em>and</em> department.</li>
+</ul>
+
 <!-- description:end -->
 
 ## Solutions

solution/0200-0299/0207.Course Schedule/README_EN.md

@@ -33,7 +33,7 @@ tags:
 <pre>
 <strong>Input:</strong> numCourses = 2, prerequisites = [[1,0]]
 <strong>Output:</strong> true
-<strong>Explanation:</strong> There are a total of 2 courses to take.
+<strong>Explanation:</strong> There are a total of 2 courses to take. 
 To take course 1 you should have finished course 0. So it is possible.
 </pre>
 
@@ -42,7 +42,7 @@ To take course 1 you should have finished course 0. So it is possible.
 <pre>
 <strong>Input:</strong> numCourses = 2, prerequisites = [[1,0],[0,1]]
 <strong>Output:</strong> false
-<strong>Explanation:</strong> There are a total of 2 courses to take.
+<strong>Explanation:</strong> There are a total of 2 courses to take. 
 To take course 1 you should have finished course 0, and to take course 0 you should also have finished course 1. So it is impossible.
 </pre>
 

solution/0400-0499/0439.Ternary Expression Parser/README.md

@@ -22,7 +22,7 @@ tags:
 
 <p>你可以总是假设给定的表达式是有效的，并且只包含数字，&nbsp;<code>'?'</code>&nbsp;，&nbsp;&nbsp;<code>':'</code>&nbsp;，&nbsp;&nbsp;<code>'T'</code>&nbsp;和 <code>'F'</code> ，其中 <code>'T'</code> 为真， <code>'F'</code> 为假。表达式中的所有数字都是 <strong>一位</strong> 数(即在 <strong>[0,9] </strong>范围内)。</p>
 
-<p>条件表达式从右到左分组(大多数语言中都是这样)，表达式的结果总是为数字 <code>'T'</code> 或 <code>'F'</code> 。</p>
+<p>条件表达式从右到左分组(大多数语言中都是这样)，表达式的结果总是为数字，<code>'T'</code> 或 <code>'F'</code> 。</p>
 
 <p>&nbsp;</p>
 

solution/0500-0599/0536.Construct Binary Tree from String/README.md

@@ -56,7 +56,7 @@ tags:
 <ul>
 	<li><code>0 &lt;= s.length &lt;= 3 * 10<sup>4</sup></code></li>
 	<li>输入字符串中只包含&nbsp;<code>'('</code>, <code>')'</code>, <code>'-'</code>&nbsp;和&nbsp;<code>'0'</code> ~ <code>'9'</code>&nbsp;</li>
-	<li>空树由&nbsp;<code>""</code>&nbsp;而非<code>"()"</code>表示。</li>
+	<li>树中所有数字的值 <strong>最多</strong> 不超过&nbsp;<code>2<sup>30</sup></code>。</li>
 </ul>
 
 <!-- description:end -->

solution/0500-0599/0536.Construct Binary Tree from String/README_EN.md

@@ -54,6 +54,7 @@ tags:
 <ul>
 	<li><code>0 &lt;= s.length &lt;= 3 * 10<sup>4</sup></code></li>
 	<li><code>s</code> consists of digits, <code>&#39;(&#39;</code>, <code>&#39;)&#39;</code>, and <code>&#39;-&#39;</code> only.</li>
+	<li>All numbers in the tree have value <strong>at most</strong> than <code>2<sup>30</sup></code>.</li>
 </ul>
 
 <!-- description:end -->