You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+12-6Lines changed: 12 additions & 6 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -62,17 +62,23 @@ LeetCode Problems' Solutions
62
62
63
63
| # | Title | Solution | Difficulty |
64
64
| :-: | - | - | :-: |
65
+
| <spanid="1495">1495</span> |[Friendly Movies Streamed Last Month](https://leetcode.com/problems/friendly-movies-streamed-last-month) 🔒 |[MySQL](problems/friendly-movies-streamed-last-month)| Easy |
66
+
| <spanid="1494">1494</span> |[Parallel Courses II](https://leetcode.com/problems/parallel-courses-ii"并行课程 II")|[Go](problems/parallel-courses-ii)| Hard |
67
+
| <spanid="1493">1493</span> |[Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element"删掉一个元素以后全为 1 的最长子数组")|[Go](problems/longest-subarray-of-1s-after-deleting-one-element)| Medium |
68
+
| <spanid="1492">1492</span> |[The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n"n 的第 k 个因子")|[Go](problems/the-kth-factor-of-n)| Medium |
69
+
| <spanid="1491">1491</span> |[Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary"去掉最低工资和最高工资后的工资平均值")|[Go](problems/average-salary-excluding-the-minimum-and-maximum-salary)| Easy |
70
+
| <spanid="1490">1490</span> |[Clone N-ary Tree](https://leetcode.com/problems/clone-n-ary-tree"克隆 N 叉树") 🔒 |[Go](problems/clone-n-ary-tree)| Medium |
65
71
| <spanid="1489">1489</span> |[Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"找到最小生成树里的关键边和伪关键边")|[Go](problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree)| Hard |
66
72
| <spanid="1488">1488</span> |[Avoid Flood in The City](https://leetcode.com/problems/avoid-flood-in-the-city"避免洪水泛滥")|[Go](problems/avoid-flood-in-the-city)| Medium |
67
73
| <spanid="1487">1487</span> |[Making File Names Unique](https://leetcode.com/problems/making-file-names-unique"保证文件名唯一")|[Go](problems/making-file-names-unique)| Medium |
68
74
| <spanid="1486">1486</span> |[XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array"数组异或操作")|[Go](problems/xor-operation-in-an-array)| Easy |
69
75
| <spanid="1485">1485</span> |[Clone Binary Tree With Random Pointer](https://leetcode.com/problems/clone-binary-tree-with-random-pointer"克隆含随机指针的二叉树") 🔒 |[Go](problems/clone-binary-tree-with-random-pointer)| Medium |
70
-
| <spanid="1484">1484</span> |[Group Sold Products By The Date](https://leetcode.com/problems/group-sold-products-by-the-date) 🔒 |[MySQL](problems/group-sold-products-by-the-date)| Easy |
76
+
| <spanid="1484">1484</span> |[Group Sold Products By The Date](https://leetcode.com/problems/group-sold-products-by-the-date"按日期分组销售产品") 🔒 |[MySQL](problems/group-sold-products-by-the-date)| Easy |
71
77
| <spanid="1483">1483</span> |[Kth Ancestor of a Tree Node](https://leetcode.com/problems/kth-ancestor-of-a-tree-node"树节点的第 K 个祖先")|[Go](problems/kth-ancestor-of-a-tree-node)| Hard |
72
78
| <spanid="1482">1482</span> |[Minimum Number of Days to Make m Bouquets](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets"制作 m 束花所需的最少天数")|[Go](problems/minimum-number-of-days-to-make-m-bouquets)| Medium |
73
79
| <spanid="1481">1481</span> |[Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals"不同整数的最少数目")|[Go](problems/least-number-of-unique-integers-after-k-removals)| Medium |
74
80
| <spanid="1480">1480</span> |[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array"一维数组的动态和")|[Go](problems/running-sum-of-1d-array)| Easy |
75
-
| <spanid="1479">1479</span> |[Sales by Day of the Week](https://leetcode.com/problems/sales-by-day-of-the-week) 🔒 |[MySQL](problems/sales-by-day-of-the-week)| Hard |
81
+
| <spanid="1479">1479</span> |[Sales by Day of the Week](https://leetcode.com/problems/sales-by-day-of-the-week"周内每天的销售情况") 🔒 |[MySQL](problems/sales-by-day-of-the-week)| Hard |
76
82
| <spanid="1478">1478</span> |[Allocate Mailboxes](https://leetcode.com/problems/allocate-mailboxes"安排邮筒")|[Go](problems/allocate-mailboxes)| Hard |
77
83
| <spanid="1477">1477</span> |[Find Two Non-overlapping Sub-arrays Each With Target Sum](https://leetcode.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum"找两个和为目标值且不重叠的子数组")|[Go](problems/find-two-non-overlapping-sub-arrays-each-with-target-sum)| Medium |
78
84
| <spanid="1476">1476</span> |[Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries"子矩形查询")|[Go](problems/subrectangle-queries)| Medium |
@@ -82,7 +88,7 @@ LeetCode Problems' Solutions
82
88
| <spanid="1472">1472</span> |[Design Browser History](https://leetcode.com/problems/design-browser-history"设计浏览器历史记录")|[Go](problems/design-browser-history)| Medium |
83
89
| <spanid="1471">1471</span> |[The k Strongest Values in an Array](https://leetcode.com/problems/the-k-strongest-values-in-an-array"数组中的 k 个最强值")|[Go](problems/the-k-strongest-values-in-an-array)| Medium |
84
90
| <spanid="1470">1470</span> |[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array"重新排列数组")|[Go](problems/shuffle-the-array)| Easy |
85
-
| <spanid="1469">1469</span> |[Find All The Lonely Nodes](https://leetcode.com/problems/find-all-the-lonely-nodes) 🔒 |[Go](problems/find-all-the-lonely-nodes)| Easy |
91
+
| <spanid="1469">1469</span> |[Find All The Lonely Nodes](https://leetcode.com/problems/find-all-the-lonely-nodes"寻找所有的独生节点") 🔒 |[Go](problems/find-all-the-lonely-nodes)| Easy |
86
92
| <spanid="1468">1468</span> |[Calculate Salaries](https://leetcode.com/problems/calculate-salaries"计算税后工资") 🔒 |[MySQL](problems/calculate-salaries)| Medium |
87
93
| <spanid="1467">1467</span> |[Probability of a Two Boxes Having The Same Number of Distinct Balls](https://leetcode.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"两个盒子中球的颜色数相同的概率")|[Go](problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls)| Hard |
88
94
| <spanid="1466">1466</span> |[Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero"重新规划路线")|[Go](problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero)| Medium |
| <spanid="1438">1438</span> |[Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"绝对差不超过限制的最长连续子数组")|[Go](problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit)| Medium |
117
123
| <spanid="1437">1437</span> |[Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away"是否所有 1 都至少相隔 k 个元素")|[Go](problems/check-if-all-1s-are-at-least-length-k-places-away)| Medium |
| <spanid="1435">1435</span> |[Create a Session Bar Chart](https://leetcode.com/problems/create-a-session-bar-chart) 🔒 |[MySQL](problems/create-a-session-bar-chart)| Easy |
125
+
| <spanid="1435">1435</span> |[Create a Session Bar Chart](https://leetcode.com/problems/create-a-session-bar-chart"制作会话柱状图") 🔒 |[MySQL](problems/create-a-session-bar-chart)| Easy |
120
126
| <spanid="1434">1434</span> |[Number of Ways to Wear Different Hats to Each Other](https://leetcode.com/problems/number-of-ways-to-wear-different-hats-to-each-other"每个人戴不同帽子的方案数")|[Go](problems/number-of-ways-to-wear-different-hats-to-each-other)| Hard |
121
127
| <spanid="1433">1433</span> |[Check If a String Can Break Another String](https://leetcode.com/problems/check-if-a-string-can-break-another-string"检查一个字符串是否可以打破另一个字符串")|[Go](problems/check-if-a-string-can-break-another-string)| Medium |
122
128
| <spanid="1432">1432</span> |[Max Difference You Can Get From Changing an Integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer"改变一个整数能得到的最大差值")|[Go](problems/max-difference-you-can-get-from-changing-an-integer)| Medium |
123
129
| <spanid="1431">1431</span> |[Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies"拥有最多糖果的孩子")|[Go](problems/kids-with-the-greatest-number-of-candies)| Easy |
124
-
| <spanid="1430">1430</span> |[Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree](https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree) 🔒 |[Go](problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree)| Medium |
125
-
| <spanid="1429">1429</span> |[First Unique Number](https://leetcode.com/problems/first-unique-number) 🔒 |[Go](problems/first-unique-number)| Medium |
130
+
| <spanid="1430">1430</span> |[Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree](https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"判断给定的序列是否是二叉树从根到叶的路径") 🔒 |[Go](problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree)| Medium |
131
+
| <spanid="1429">1429</span> |[First Unique Number](https://leetcode.com/problems/first-unique-number"第一个唯一数字") 🔒 |[Go](problems/first-unique-number)| Medium |
126
132
| <spanid="1428">1428</span> |[Leftmost Column with at Least a One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one"至少有一个 1 的最左端列") 🔒 |[Go](problems/leftmost-column-with-at-least-a-one)| Medium |
[Next >](../the-kth-factor-of-n"The kth Factor of n")
11
+
12
+
## [1491. Average Salary Excluding the Minimum and Maximum Salary (Easy)](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary"去掉最低工资和最高工资后的工资平均值")
13
+
14
+
<p>Given an array of <strong>unique</strong> integers <code>salary</code> where <code>salary[i]</code> is the salary of the employee <code>i</code>.</p>
15
+
16
+
<p>Return the average salary of employees excluding the minimum and maximum salary.</p>
Copy file name to clipboardExpand all lines: problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree/README.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -9,7 +9,7 @@
9
9
10
10
[Next >](../kids-with-the-greatest-number-of-candies"Kids With the Greatest Number of Candies")
11
11
12
-
## [1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree (Medium)](https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"")
12
+
## [1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree (Medium)](https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"判断给定的序列是否是二叉树从根到叶的路径")
Traverse the tree, keep a hashtable with you and create a clone node for each node in the tree.
26
+
</details>
27
+
28
+
<details>
29
+
<summary>Hint 2</summary>
30
+
Start traversing the original tree again and connect each child pointer in the cloned tree the same way as the original tree with the help of the hashtable.
Copy file name to clipboardExpand all lines: problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/README.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -7,7 +7,7 @@
7
7
8
8
[< Previous](../avoid-flood-in-the-city"Avoid Flood in The City")
9
9
10
-
Next >
10
+
[Next >](../clone-n-ary-tree"Clone N-ary Tree")
11
11
12
12
## [1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree (Hard)](https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"找到最小生成树里的关键边和伪关键边")
0 commit comments