diff --git a/solution/0000-0099/0069.Sqrt(x)/README.md b/solution/0000-0099/0069.Sqrt(x)/README.md index ac0ce5f4146cc..6aafea2efc4d1 100644 --- a/solution/0000-0099/0069.Sqrt(x)/README.md +++ b/solution/0000-0099/0069.Sqrt(x)/README.md @@ -1,4 +1,4 @@ -# [69. x 的平方根 ](https://leetcode.cn/problems/sqrtx) +# [69. x 的平方根](https://leetcode.cn/problems/sqrtx) [English Version](/solution/0000-0099/0069.Sqrt%28x%29/README_EN.md) diff --git a/solution/0100-0199/0156.Binary Tree Upside Down/README.md b/solution/0100-0199/0156.Binary Tree Upside Down/README.md index f5a5fe603839d..6c19d241d07c8 100644 --- a/solution/0100-0199/0156.Binary Tree Upside Down/README.md +++ b/solution/0100-0199/0156.Binary Tree Upside Down/README.md @@ -1,4 +1,4 @@ -# [156. 上下翻转二叉树](https://leetcode.cn/problems/binary-tree-upside-down) +# [156. 上下翻转二叉树 🔒](https://leetcode.cn/problems/binary-tree-upside-down) [English Version](/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README_EN.md) diff --git a/solution/0100-0199/0156.Binary Tree Upside Down/README_EN.md b/solution/0100-0199/0156.Binary Tree Upside Down/README_EN.md index 81ddb7588090b..20d7f4cec6e1c 100644 --- a/solution/0100-0199/0156.Binary Tree Upside Down/README_EN.md +++ b/solution/0100-0199/0156.Binary Tree Upside Down/README_EN.md @@ -1,4 +1,4 @@ -# [156. Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) +# [156. Binary Tree Upside Down 🔒](https://leetcode.com/problems/binary-tree-upside-down) [中文文档](/solution/0100-0199/0156.Binary%20Tree%20Upside%20Down/README.md) diff --git a/solution/0100-0199/0157.Read N Characters Given Read4/README.md b/solution/0100-0199/0157.Read N Characters Given Read4/README.md index 1dcdf1ee06bfb..81753dd7fa28a 100644 --- a/solution/0100-0199/0157.Read N Characters Given Read4/README.md +++ b/solution/0100-0199/0157.Read N Characters Given Read4/README.md @@ -1,4 +1,4 @@ -# [157. 用 Read4 读取 N 个字符](https://leetcode.cn/problems/read-n-characters-given-read4) +# [157. 用 Read4 读取 N 个字符 🔒](https://leetcode.cn/problems/read-n-characters-given-read4) [English Version](/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README_EN.md) diff --git a/solution/0100-0199/0157.Read N Characters Given Read4/README_EN.md b/solution/0100-0199/0157.Read N Characters Given Read4/README_EN.md index 3b1a442c420a7..205be656bbed7 100644 --- a/solution/0100-0199/0157.Read N Characters Given Read4/README_EN.md +++ b/solution/0100-0199/0157.Read N Characters Given Read4/README_EN.md @@ -1,4 +1,4 @@ -# [157. Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) +# [157. Read N Characters Given Read4 🔒](https://leetcode.com/problems/read-n-characters-given-read4) [中文文档](/solution/0100-0199/0157.Read%20N%20Characters%20Given%20Read4/README.md) diff --git a/solution/0100-0199/0158.Read N Characters Given read4 II - Call Multiple Times/README.md b/solution/0100-0199/0158.Read N Characters Given read4 II - Call Multiple Times/README.md index 4709b38a955f8..526487380405c 100644 --- a/solution/0100-0199/0158.Read N Characters Given read4 II - Call Multiple Times/README.md +++ b/solution/0100-0199/0158.Read N Characters Given read4 II - Call Multiple Times/README.md @@ -1,4 +1,4 @@ -# [158. 用 Read4 读取 N 个字符 II - 多次调用](https://leetcode.cn/problems/read-n-characters-given-read4-ii-call-multiple-times) +# [158. 用 Read4 读取 N 个字符 II - 多次调用 🔒](https://leetcode.cn/problems/read-n-characters-given-read4-ii-call-multiple-times) [English Version](/solution/0100-0199/0158.Read%20N%20Characters%20Given%20read4%20II%20-%20Call%20Multiple%20Times/README_EN.md) diff --git a/solution/0100-0199/0158.Read N Characters Given read4 II - Call Multiple Times/README_EN.md b/solution/0100-0199/0158.Read N Characters Given read4 II - Call Multiple Times/README_EN.md index c3e49dffd5196..b26ff7542e0d5 100644 --- a/solution/0100-0199/0158.Read N Characters Given read4 II - Call Multiple Times/README_EN.md +++ b/solution/0100-0199/0158.Read N Characters Given read4 II - Call Multiple Times/README_EN.md @@ -1,4 +1,4 @@ -# [158. Read N Characters Given read4 II - Call Multiple Times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) +# [158. Read N Characters Given read4 II - Call Multiple Times 🔒](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times) [中文文档](/solution/0100-0199/0158.Read%20N%20Characters%20Given%20read4%20II%20-%20Call%20Multiple%20Times/README.md) diff --git a/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README.md b/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README.md index 53c9b57777248..3a982031d8533 100644 --- a/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README.md +++ b/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README.md @@ -1,4 +1,4 @@ -# [159. 至多包含两个不同字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-most-two-distinct-characters) +# [159. 至多包含两个不同字符的最长子串 🔒](https://leetcode.cn/problems/longest-substring-with-at-most-two-distinct-characters) [English Version](/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README_EN.md) diff --git a/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README_EN.md b/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README_EN.md index f37e0c501b689..2bc2d552aebf4 100644 --- a/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README_EN.md +++ b/solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/README_EN.md @@ -1,4 +1,4 @@ -# [159. Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) +# [159. Longest Substring with At Most Two Distinct Characters 🔒](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters) [中文文档](/solution/0100-0199/0159.Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters/README.md) diff --git a/solution/0100-0199/0161.One Edit Distance/README.md b/solution/0100-0199/0161.One Edit Distance/README.md index ec2be814cf20e..23aa1784352c4 100644 --- a/solution/0100-0199/0161.One Edit Distance/README.md +++ b/solution/0100-0199/0161.One Edit Distance/README.md @@ -1,4 +1,4 @@ -# [161. 相隔为 1 的编辑距离](https://leetcode.cn/problems/one-edit-distance) +# [161. 相隔为 1 的编辑距离 🔒](https://leetcode.cn/problems/one-edit-distance) [English Version](/solution/0100-0199/0161.One%20Edit%20Distance/README_EN.md) diff --git a/solution/0100-0199/0161.One Edit Distance/README_EN.md b/solution/0100-0199/0161.One Edit Distance/README_EN.md index 699fa323cc969..25974c3524c6f 100644 --- a/solution/0100-0199/0161.One Edit Distance/README_EN.md +++ b/solution/0100-0199/0161.One Edit Distance/README_EN.md @@ -1,4 +1,4 @@ -# [161. One Edit Distance](https://leetcode.com/problems/one-edit-distance) +# [161. One Edit Distance 🔒](https://leetcode.com/problems/one-edit-distance) [中文文档](/solution/0100-0199/0161.One%20Edit%20Distance/README.md) diff --git a/solution/0100-0199/0163.Missing Ranges/README.md b/solution/0100-0199/0163.Missing Ranges/README.md index 6f930ed37e057..357e9e4a8664c 100644 --- a/solution/0100-0199/0163.Missing Ranges/README.md +++ b/solution/0100-0199/0163.Missing Ranges/README.md @@ -1,4 +1,4 @@ -# [163. 缺失的区间](https://leetcode.cn/problems/missing-ranges) +# [163. 缺失的区间 🔒](https://leetcode.cn/problems/missing-ranges) [English Version](/solution/0100-0199/0163.Missing%20Ranges/README_EN.md) diff --git a/solution/0100-0199/0163.Missing Ranges/README_EN.md b/solution/0100-0199/0163.Missing Ranges/README_EN.md index eb3e578c4e03d..ccb81b4af79d3 100644 --- a/solution/0100-0199/0163.Missing Ranges/README_EN.md +++ b/solution/0100-0199/0163.Missing Ranges/README_EN.md @@ -1,4 +1,4 @@ -# [163. Missing Ranges](https://leetcode.com/problems/missing-ranges) +# [163. Missing Ranges 🔒](https://leetcode.com/problems/missing-ranges) [中文文档](/solution/0100-0199/0163.Missing%20Ranges/README.md) diff --git a/solution/0100-0199/0170.Two Sum III - Data structure design/README.md b/solution/0100-0199/0170.Two Sum III - Data structure design/README.md index 8c07424e69231..a357cc53dbcd7 100644 --- a/solution/0100-0199/0170.Two Sum III - Data structure design/README.md +++ b/solution/0100-0199/0170.Two Sum III - Data structure design/README.md @@ -1,4 +1,4 @@ -# [170. 两数之和 III - 数据结构设计](https://leetcode.cn/problems/two-sum-iii-data-structure-design) +# [170. 两数之和 III - 数据结构设计 🔒](https://leetcode.cn/problems/two-sum-iii-data-structure-design) [English Version](/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README_EN.md) diff --git a/solution/0100-0199/0170.Two Sum III - Data structure design/README_EN.md b/solution/0100-0199/0170.Two Sum III - Data structure design/README_EN.md index 81a1b801402eb..8e1dd014f4196 100644 --- a/solution/0100-0199/0170.Two Sum III - Data structure design/README_EN.md +++ b/solution/0100-0199/0170.Two Sum III - Data structure design/README_EN.md @@ -1,4 +1,4 @@ -# [170. Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) +# [170. Two Sum III - Data structure design 🔒](https://leetcode.com/problems/two-sum-iii-data-structure-design) [中文文档](/solution/0100-0199/0170.Two%20Sum%20III%20-%20Data%20structure%20design/README.md) diff --git a/solution/0100-0199/0186.Reverse Words in a String II/README.md b/solution/0100-0199/0186.Reverse Words in a String II/README.md index cf5a9ccf58d59..00a0676070dfe 100644 --- a/solution/0100-0199/0186.Reverse Words in a String II/README.md +++ b/solution/0100-0199/0186.Reverse Words in a String II/README.md @@ -1,4 +1,4 @@ -# [186. 反转字符串中的单词 II](https://leetcode.cn/problems/reverse-words-in-a-string-ii) +# [186. 反转字符串中的单词 II 🔒](https://leetcode.cn/problems/reverse-words-in-a-string-ii) [English Version](/solution/0100-0199/0186.Reverse%20Words%20in%20a%20String%20II/README_EN.md) diff --git a/solution/0100-0199/0186.Reverse Words in a String II/README_EN.md b/solution/0100-0199/0186.Reverse Words in a String II/README_EN.md index a421d956cb541..04cb75452354c 100644 --- a/solution/0100-0199/0186.Reverse Words in a String II/README_EN.md +++ b/solution/0100-0199/0186.Reverse Words in a String II/README_EN.md @@ -1,4 +1,4 @@ -# [186. Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii) +# [186. Reverse Words in a String II 🔒](https://leetcode.com/problems/reverse-words-in-a-string-ii) [中文文档](/solution/0100-0199/0186.Reverse%20Words%20in%20a%20String%20II/README.md) diff --git a/solution/0200-0299/0243.Shortest Word Distance/README.md b/solution/0200-0299/0243.Shortest Word Distance/README.md index 74e19799e19c8..d893f57ed9312 100644 --- a/solution/0200-0299/0243.Shortest Word Distance/README.md +++ b/solution/0200-0299/0243.Shortest Word Distance/README.md @@ -1,4 +1,4 @@ -# [243. 最短单词距离](https://leetcode.cn/problems/shortest-word-distance) +# [243. 最短单词距离 🔒](https://leetcode.cn/problems/shortest-word-distance) [English Version](/solution/0200-0299/0243.Shortest%20Word%20Distance/README_EN.md) diff --git a/solution/0200-0299/0243.Shortest Word Distance/README_EN.md b/solution/0200-0299/0243.Shortest Word Distance/README_EN.md index 5fed44ae4c6fd..ac5b24d06e1cf 100644 --- a/solution/0200-0299/0243.Shortest Word Distance/README_EN.md +++ b/solution/0200-0299/0243.Shortest Word Distance/README_EN.md @@ -1,4 +1,4 @@ -# [243. Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) +# [243. Shortest Word Distance 🔒](https://leetcode.com/problems/shortest-word-distance) [中文文档](/solution/0200-0299/0243.Shortest%20Word%20Distance/README.md) diff --git a/solution/0200-0299/0244.Shortest Word Distance II/README.md b/solution/0200-0299/0244.Shortest Word Distance II/README.md index 40abe60c278cc..3bb3e1df1caf4 100644 --- a/solution/0200-0299/0244.Shortest Word Distance II/README.md +++ b/solution/0200-0299/0244.Shortest Word Distance II/README.md @@ -1,4 +1,4 @@ -# [244. 最短单词距离 II](https://leetcode.cn/problems/shortest-word-distance-ii) +# [244. 最短单词距离 II 🔒](https://leetcode.cn/problems/shortest-word-distance-ii) [English Version](/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README_EN.md) diff --git a/solution/0200-0299/0244.Shortest Word Distance II/README_EN.md b/solution/0200-0299/0244.Shortest Word Distance II/README_EN.md index 3b9afcaa2fbc1..787f87875b06b 100644 --- a/solution/0200-0299/0244.Shortest Word Distance II/README_EN.md +++ b/solution/0200-0299/0244.Shortest Word Distance II/README_EN.md @@ -1,4 +1,4 @@ -# [244. Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) +# [244. Shortest Word Distance II 🔒](https://leetcode.com/problems/shortest-word-distance-ii) [中文文档](/solution/0200-0299/0244.Shortest%20Word%20Distance%20II/README.md) diff --git a/solution/0200-0299/0245.Shortest Word Distance III/README.md b/solution/0200-0299/0245.Shortest Word Distance III/README.md index a8e0dc9f19143..4f09675e97466 100644 --- a/solution/0200-0299/0245.Shortest Word Distance III/README.md +++ b/solution/0200-0299/0245.Shortest Word Distance III/README.md @@ -1,4 +1,4 @@ -# [245. 最短单词距离 III](https://leetcode.cn/problems/shortest-word-distance-iii) +# [245. 最短单词距离 III 🔒](https://leetcode.cn/problems/shortest-word-distance-iii) [English Version](/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README_EN.md) diff --git a/solution/0200-0299/0245.Shortest Word Distance III/README_EN.md b/solution/0200-0299/0245.Shortest Word Distance III/README_EN.md index e2edc86156eda..da8d756e8fadd 100644 --- a/solution/0200-0299/0245.Shortest Word Distance III/README_EN.md +++ b/solution/0200-0299/0245.Shortest Word Distance III/README_EN.md @@ -1,4 +1,4 @@ -# [245. Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii) +# [245. Shortest Word Distance III 🔒](https://leetcode.com/problems/shortest-word-distance-iii) [中文文档](/solution/0200-0299/0245.Shortest%20Word%20Distance%20III/README.md) diff --git a/solution/0200-0299/0246.Strobogrammatic Number/README.md b/solution/0200-0299/0246.Strobogrammatic Number/README.md index 94047c27c1722..6f350f96172ac 100644 --- a/solution/0200-0299/0246.Strobogrammatic Number/README.md +++ b/solution/0200-0299/0246.Strobogrammatic Number/README.md @@ -1,4 +1,4 @@ -# [246. 中心对称数](https://leetcode.cn/problems/strobogrammatic-number) +# [246. 中心对称数 🔒](https://leetcode.cn/problems/strobogrammatic-number) [English Version](/solution/0200-0299/0246.Strobogrammatic%20Number/README_EN.md) @@ -42,7 +42,7 @@ 我们定义一个数组 $d$，其中 $d[i]$ 表示数字 $i$ 旋转 180° 之后的数字。如果 $d[i]$ 为 $-1$，表示数字 $i$ 不能旋转 180° 得到一个数字。 -定义两个指针 $i$ 和 $j$，分别指向字符串的左右两端，然后不断向中间移动指针，判断 $d[num[i]]$ 和 $num[j]$ 是否相等，如果不相等，说明该字符串不是中心对称数，直接返回 $false$ 即可。如果 $i \gt j$，说明遍历完了字符串，返回 $true$。 +定义两个指针 $i$ 和 $j$，分别指向字符串的左右两端，然后不断向中间移动指针，判断 $d[num[i]]$ 和 $num[j]$ 是否相等，如果不相等，说明该字符串不是中心对称数 🔒，直接返回 $false$ 即可。如果 $i \gt j$，说明遍历完了字符串，返回 $true$。 时间复杂度 $O(n)$，空间复杂度 $O(1)$。其中 $n$ 为字符串的长度。 diff --git a/solution/0200-0299/0246.Strobogrammatic Number/README_EN.md b/solution/0200-0299/0246.Strobogrammatic Number/README_EN.md index 75f490a1b9bef..a310d3e168389 100644 --- a/solution/0200-0299/0246.Strobogrammatic Number/README_EN.md +++ b/solution/0200-0299/0246.Strobogrammatic Number/README_EN.md @@ -1,4 +1,4 @@ -# [246. Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number) +# [246. Strobogrammatic Number 🔒](https://leetcode.com/problems/strobogrammatic-number) [中文文档](/solution/0200-0299/0246.Strobogrammatic%20Number/README.md) diff --git a/solution/0200-0299/0247.Strobogrammatic Number II/README.md b/solution/0200-0299/0247.Strobogrammatic Number II/README.md index 5ffba97530c83..98d310b084a48 100644 --- a/solution/0200-0299/0247.Strobogrammatic Number II/README.md +++ b/solution/0200-0299/0247.Strobogrammatic Number II/README.md @@ -1,4 +1,4 @@ -# [247. 中心对称数 II](https://leetcode.cn/problems/strobogrammatic-number-ii) +# [247. 中心对称数 II 🔒](https://leetcode.cn/problems/strobogrammatic-number-ii) [English Version](/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README_EN.md) @@ -55,7 +55,7 @@ 相似题目： -- [248. 中心对称数 III](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README.md) +- [248. 中心对称数 II 🔒I](https://github.com/doocs/leetcode/blob/main/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README.md) diff --git a/solution/0200-0299/0247.Strobogrammatic Number II/README_EN.md b/solution/0200-0299/0247.Strobogrammatic Number II/README_EN.md index 68d149bb88dfb..528abb2e0a5b1 100644 --- a/solution/0200-0299/0247.Strobogrammatic Number II/README_EN.md +++ b/solution/0200-0299/0247.Strobogrammatic Number II/README_EN.md @@ -1,4 +1,4 @@ -# [247. Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii) +# [247. Strobogrammatic Number II 🔒](https://leetcode.com/problems/strobogrammatic-number-ii) [中文文档](/solution/0200-0299/0247.Strobogrammatic%20Number%20II/README.md) diff --git a/solution/0200-0299/0248.Strobogrammatic Number III/README.md b/solution/0200-0299/0248.Strobogrammatic Number III/README.md index e125d991de9df..1c4701f2e01de 100644 --- a/solution/0200-0299/0248.Strobogrammatic Number III/README.md +++ b/solution/0200-0299/0248.Strobogrammatic Number III/README.md @@ -1,4 +1,4 @@ -# [248. 中心对称数 III](https://leetcode.cn/problems/strobogrammatic-number-iii) +# [248. 中心对称数 III 🔒](https://leetcode.cn/problems/strobogrammatic-number-iii) [English Version](/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README_EN.md) diff --git a/solution/0200-0299/0248.Strobogrammatic Number III/README_EN.md b/solution/0200-0299/0248.Strobogrammatic Number III/README_EN.md index 12639a8a5366a..f6c00c0d1208f 100644 --- a/solution/0200-0299/0248.Strobogrammatic Number III/README_EN.md +++ b/solution/0200-0299/0248.Strobogrammatic Number III/README_EN.md @@ -1,4 +1,4 @@ -# [248. Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii) +# [248. Strobogrammatic Number III 🔒](https://leetcode.com/problems/strobogrammatic-number-iii) [中文文档](/solution/0200-0299/0248.Strobogrammatic%20Number%20III/README.md) diff --git a/solution/0200-0299/0249.Group Shifted Strings/README.md b/solution/0200-0299/0249.Group Shifted Strings/README.md index 9fae56265019a..8ce81a59ab509 100644 --- a/solution/0200-0299/0249.Group Shifted Strings/README.md +++ b/solution/0200-0299/0249.Group Shifted Strings/README.md @@ -1,4 +1,4 @@ -# [249. 移位字符串分组](https://leetcode.cn/problems/group-shifted-strings) +# [249. 移位字符串分组 🔒](https://leetcode.cn/problems/group-shifted-strings) [English Version](/solution/0200-0299/0249.Group%20Shifted%20Strings/README_EN.md) diff --git a/solution/0200-0299/0249.Group Shifted Strings/README_EN.md b/solution/0200-0299/0249.Group Shifted Strings/README_EN.md index 4c430a9a6c8aa..fa01c48b3c485 100644 --- a/solution/0200-0299/0249.Group Shifted Strings/README_EN.md +++ b/solution/0200-0299/0249.Group Shifted Strings/README_EN.md @@ -1,4 +1,4 @@ -# [249. Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings) +# [249. Group Shifted Strings 🔒](https://leetcode.com/problems/group-shifted-strings) [中文文档](/solution/0200-0299/0249.Group%20Shifted%20Strings/README.md) diff --git a/solution/0200-0299/0250.Count Univalue Subtrees/README.md b/solution/0200-0299/0250.Count Univalue Subtrees/README.md index b6f044800bbf8..c735da8155cbf 100644 --- a/solution/0200-0299/0250.Count Univalue Subtrees/README.md +++ b/solution/0200-0299/0250.Count Univalue Subtrees/README.md @@ -1,4 +1,4 @@ -# [250. 统计同值子树](https://leetcode.cn/problems/count-univalue-subtrees) +# [250. 统计同值子树 🔒](https://leetcode.cn/problems/count-univalue-subtrees) [English Version](/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README_EN.md) diff --git a/solution/0200-0299/0250.Count Univalue Subtrees/README_EN.md b/solution/0200-0299/0250.Count Univalue Subtrees/README_EN.md index c114a563b96cc..bb7be5a3d4dbb 100644 --- a/solution/0200-0299/0250.Count Univalue Subtrees/README_EN.md +++ b/solution/0200-0299/0250.Count Univalue Subtrees/README_EN.md @@ -1,4 +1,4 @@ -# [250. Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees) +# [250. Count Univalue Subtrees 🔒](https://leetcode.com/problems/count-univalue-subtrees) [中文文档](/solution/0200-0299/0250.Count%20Univalue%20Subtrees/README.md) diff --git a/solution/0200-0299/0251.Flatten 2D Vector/README.md b/solution/0200-0299/0251.Flatten 2D Vector/README.md index 4e9ad05a9320d..5fb8fed442cf3 100644 --- a/solution/0200-0299/0251.Flatten 2D Vector/README.md +++ b/solution/0200-0299/0251.Flatten 2D Vector/README.md @@ -1,4 +1,4 @@ -# [251. 展开二维向量](https://leetcode.cn/problems/flatten-2d-vector) +# [251. 展开二维向量 🔒](https://leetcode.cn/problems/flatten-2d-vector) [English Version](/solution/0200-0299/0251.Flatten%202D%20Vector/README_EN.md) diff --git a/solution/0200-0299/0251.Flatten 2D Vector/README_EN.md b/solution/0200-0299/0251.Flatten 2D Vector/README_EN.md index 94dffe0ae66d1..d0ed2d244d808 100644 --- a/solution/0200-0299/0251.Flatten 2D Vector/README_EN.md +++ b/solution/0200-0299/0251.Flatten 2D Vector/README_EN.md @@ -1,4 +1,4 @@ -# [251. Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector) +# [251. Flatten 2D Vector 🔒](https://leetcode.com/problems/flatten-2d-vector) [中文文档](/solution/0200-0299/0251.Flatten%202D%20Vector/README.md) diff --git a/solution/0200-0299/0252.Meeting Rooms/README.md b/solution/0200-0299/0252.Meeting Rooms/README.md index dad13eb2ab710..e7bc268f6b367 100644 --- a/solution/0200-0299/0252.Meeting Rooms/README.md +++ b/solution/0200-0299/0252.Meeting Rooms/README.md @@ -1,4 +1,4 @@ -# [252. 会议室](https://leetcode.cn/problems/meeting-rooms) +# [252. 会议室 🔒](https://leetcode.cn/problems/meeting-rooms) [English Version](/solution/0200-0299/0252.Meeting%20Rooms/README_EN.md) diff --git a/solution/0200-0299/0252.Meeting Rooms/README_EN.md b/solution/0200-0299/0252.Meeting Rooms/README_EN.md index 7a1d04976de99..8cfc2aec26836 100644 --- a/solution/0200-0299/0252.Meeting Rooms/README_EN.md +++ b/solution/0200-0299/0252.Meeting Rooms/README_EN.md @@ -1,4 +1,4 @@ -# [252. Meeting Rooms](https://leetcode.com/problems/meeting-rooms) +# [252. Meeting Rooms 🔒](https://leetcode.com/problems/meeting-rooms) [中文文档](/solution/0200-0299/0252.Meeting%20Rooms/README.md) diff --git a/solution/0200-0299/0253.Meeting Rooms II/README.md b/solution/0200-0299/0253.Meeting Rooms II/README.md index 417303477ee2d..74fa72319816f 100644 --- a/solution/0200-0299/0253.Meeting Rooms II/README.md +++ b/solution/0200-0299/0253.Meeting Rooms II/README.md @@ -1,4 +1,4 @@ -# [253. 会议室 II](https://leetcode.cn/problems/meeting-rooms-ii) +# [253. 会议室 II 🔒](https://leetcode.cn/problems/meeting-rooms-ii) [English Version](/solution/0200-0299/0253.Meeting%20Rooms%20II/README_EN.md) diff --git a/solution/0200-0299/0253.Meeting Rooms II/README_EN.md b/solution/0200-0299/0253.Meeting Rooms II/README_EN.md index 57c197be177b9..17b910952ce87 100644 --- a/solution/0200-0299/0253.Meeting Rooms II/README_EN.md +++ b/solution/0200-0299/0253.Meeting Rooms II/README_EN.md @@ -1,4 +1,4 @@ -# [253. Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) +# [253. Meeting Rooms II 🔒](https://leetcode.com/problems/meeting-rooms-ii) [中文文档](/solution/0200-0299/0253.Meeting%20Rooms%20II/README.md) diff --git a/solution/0200-0299/0254.Factor Combinations/README.md b/solution/0200-0299/0254.Factor Combinations/README.md index b103fde1a7d3c..5ee79d6da9a20 100644 --- a/solution/0200-0299/0254.Factor Combinations/README.md +++ b/solution/0200-0299/0254.Factor Combinations/README.md @@ -1,4 +1,4 @@ -# [254. 因子的组合](https://leetcode.cn/problems/factor-combinations) +# [254. 因子的组合 🔒](https://leetcode.cn/problems/factor-combinations) [English Version](/solution/0200-0299/0254.Factor%20Combinations/README_EN.md) diff --git a/solution/0200-0299/0254.Factor Combinations/README_EN.md b/solution/0200-0299/0254.Factor Combinations/README_EN.md index 15b7f7d2c03c9..f3e5ff28be4ad 100644 --- a/solution/0200-0299/0254.Factor Combinations/README_EN.md +++ b/solution/0200-0299/0254.Factor Combinations/README_EN.md @@ -1,4 +1,4 @@ -# [254. Factor Combinations](https://leetcode.com/problems/factor-combinations) +# [254. Factor Combinations 🔒](https://leetcode.com/problems/factor-combinations) [中文文档](/solution/0200-0299/0254.Factor%20Combinations/README.md) diff --git a/solution/0200-0299/0255.Verify Preorder Sequence in Binary Search Tree/README.md b/solution/0200-0299/0255.Verify Preorder Sequence in Binary Search Tree/README.md index 2275af76f274e..0742c25877eb7 100644 --- a/solution/0200-0299/0255.Verify Preorder Sequence in Binary Search Tree/README.md +++ b/solution/0200-0299/0255.Verify Preorder Sequence in Binary Search Tree/README.md @@ -1,4 +1,4 @@ -# [255. 验证二叉搜索树的前序遍历序列](https://leetcode.cn/problems/verify-preorder-sequence-in-binary-search-tree) +# [255. 验证二叉搜索树的前序遍历序列 🔒](https://leetcode.cn/problems/verify-preorder-sequence-in-binary-search-tree) [English Version](/solution/0200-0299/0255.Verify%20Preorder%20Sequence%20in%20Binary%20Search%20Tree/README_EN.md) diff --git a/solution/0200-0299/0255.Verify Preorder Sequence in Binary Search Tree/README_EN.md b/solution/0200-0299/0255.Verify Preorder Sequence in Binary Search Tree/README_EN.md index f4520b1dabd21..5d629fe11ef00 100644 --- a/solution/0200-0299/0255.Verify Preorder Sequence in Binary Search Tree/README_EN.md +++ b/solution/0200-0299/0255.Verify Preorder Sequence in Binary Search Tree/README_EN.md @@ -1,4 +1,4 @@ -# [255. Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) +# [255. Verify Preorder Sequence in Binary Search Tree 🔒](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree) [中文文档](/solution/0200-0299/0255.Verify%20Preorder%20Sequence%20in%20Binary%20Search%20Tree/README.md) diff --git a/solution/0200-0299/0256.Paint House/README.md b/solution/0200-0299/0256.Paint House/README.md index 1b6a10fdac7cf..5de28458676bd 100644 --- a/solution/0200-0299/0256.Paint House/README.md +++ b/solution/0200-0299/0256.Paint House/README.md @@ -1,4 +1,4 @@ -# [256. 粉刷房子](https://leetcode.cn/problems/paint-house) +# [256. 粉刷房子 🔒](https://leetcode.cn/problems/paint-house) [English Version](/solution/0200-0299/0256.Paint%20House/README_EN.md) diff --git a/solution/0200-0299/0256.Paint House/README_EN.md b/solution/0200-0299/0256.Paint House/README_EN.md index 34789ed820d9c..29c47f300bb99 100644 --- a/solution/0200-0299/0256.Paint House/README_EN.md +++ b/solution/0200-0299/0256.Paint House/README_EN.md @@ -1,4 +1,4 @@ -# [256. Paint House](https://leetcode.com/problems/paint-house) +# [256. Paint House 🔒](https://leetcode.com/problems/paint-house) [中文文档](/solution/0200-0299/0256.Paint%20House/README.md) diff --git a/solution/0200-0299/0259.3Sum Smaller/README.md b/solution/0200-0299/0259.3Sum Smaller/README.md index 1d5005322c30b..66b38eff0995e 100644 --- a/solution/0200-0299/0259.3Sum Smaller/README.md +++ b/solution/0200-0299/0259.3Sum Smaller/README.md @@ -1,4 +1,4 @@ -# [259. 较小的三数之和](https://leetcode.cn/problems/3sum-smaller) +# [259. 较小的三数之和 🔒](https://leetcode.cn/problems/3sum-smaller) [English Version](/solution/0200-0299/0259.3Sum%20Smaller/README_EN.md) diff --git a/solution/0200-0299/0259.3Sum Smaller/README_EN.md b/solution/0200-0299/0259.3Sum Smaller/README_EN.md index 180ca8a8b29bc..208b7433378bf 100644 --- a/solution/0200-0299/0259.3Sum Smaller/README_EN.md +++ b/solution/0200-0299/0259.3Sum Smaller/README_EN.md @@ -1,4 +1,4 @@ -# [259. 3Sum Smaller](https://leetcode.com/problems/3sum-smaller) +# [259. 3Sum Smaller 🔒](https://leetcode.com/problems/3sum-smaller) [中文文档](/solution/0200-0299/0259.3Sum%20Smaller/README.md) diff --git a/solution/0200-0299/0261.Graph Valid Tree/README.md b/solution/0200-0299/0261.Graph Valid Tree/README.md index dfdf7460a3c0f..89874396a0902 100644 --- a/solution/0200-0299/0261.Graph Valid Tree/README.md +++ b/solution/0200-0299/0261.Graph Valid Tree/README.md @@ -1,4 +1,4 @@ -# [261. 以图判树](https://leetcode.cn/problems/graph-valid-tree) +# [261. 以图判树 🔒](https://leetcode.cn/problems/graph-valid-tree) [English Version](/solution/0200-0299/0261.Graph%20Valid%20Tree/README_EN.md) diff --git a/solution/0200-0299/0261.Graph Valid Tree/README_EN.md b/solution/0200-0299/0261.Graph Valid Tree/README_EN.md index 98baff413198c..319540c3b73c9 100644 --- a/solution/0200-0299/0261.Graph Valid Tree/README_EN.md +++ b/solution/0200-0299/0261.Graph Valid Tree/README_EN.md @@ -1,4 +1,4 @@ -# [261. Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree) +# [261. Graph Valid Tree 🔒](https://leetcode.com/problems/graph-valid-tree) [中文文档](/solution/0200-0299/0261.Graph%20Valid%20Tree/README.md) diff --git a/solution/0200-0299/0265.Paint House II/README.md b/solution/0200-0299/0265.Paint House II/README.md index 2821c4268cb8e..8bbc44263523d 100644 --- a/solution/0200-0299/0265.Paint House II/README.md +++ b/solution/0200-0299/0265.Paint House II/README.md @@ -1,4 +1,4 @@ -# [265. 粉刷房子 II](https://leetcode.cn/problems/paint-house-ii) +# [265. 粉刷房子 II 🔒](https://leetcode.cn/problems/paint-house-ii) [English Version](/solution/0200-0299/0265.Paint%20House%20II/README_EN.md) diff --git a/solution/0200-0299/0265.Paint House II/README_EN.md b/solution/0200-0299/0265.Paint House II/README_EN.md index a447391ea91d8..342a1b243d5b7 100644 --- a/solution/0200-0299/0265.Paint House II/README_EN.md +++ b/solution/0200-0299/0265.Paint House II/README_EN.md @@ -1,4 +1,4 @@ -# [265. Paint House II](https://leetcode.com/problems/paint-house-ii) +# [265. Paint House II 🔒](https://leetcode.com/problems/paint-house-ii) [中文文档](/solution/0200-0299/0265.Paint%20House%20II/README.md) diff --git a/solution/0200-0299/0266.Palindrome Permutation/README.md b/solution/0200-0299/0266.Palindrome Permutation/README.md index 8ac721b45a68d..e1e489696733c 100644 --- a/solution/0200-0299/0266.Palindrome Permutation/README.md +++ b/solution/0200-0299/0266.Palindrome Permutation/README.md @@ -1,4 +1,4 @@ -# [266. 回文排列](https://leetcode.cn/problems/palindrome-permutation) +# [266. 回文排列 🔒](https://leetcode.cn/problems/palindrome-permutation) [English Version](/solution/0200-0299/0266.Palindrome%20Permutation/README_EN.md) diff --git a/solution/0200-0299/0266.Palindrome Permutation/README_EN.md b/solution/0200-0299/0266.Palindrome Permutation/README_EN.md index e0cae5d12b944..bddc403e08919 100644 --- a/solution/0200-0299/0266.Palindrome Permutation/README_EN.md +++ b/solution/0200-0299/0266.Palindrome Permutation/README_EN.md @@ -1,4 +1,4 @@ -# [266. Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation) +# [266. Palindrome Permutation 🔒](https://leetcode.com/problems/palindrome-permutation) [中文文档](/solution/0200-0299/0266.Palindrome%20Permutation/README.md) diff --git a/solution/0200-0299/0267.Palindrome Permutation II/README.md b/solution/0200-0299/0267.Palindrome Permutation II/README.md index 486382d04157c..217b65b5b5700 100644 --- a/solution/0200-0299/0267.Palindrome Permutation II/README.md +++ b/solution/0200-0299/0267.Palindrome Permutation II/README.md @@ -1,4 +1,4 @@ -# [267. 回文排列 II](https://leetcode.cn/problems/palindrome-permutation-ii) +# [267. 回文排列 II 🔒](https://leetcode.cn/problems/palindrome-permutation-ii) [English Version](/solution/0200-0299/0267.Palindrome%20Permutation%20II/README_EN.md) diff --git a/solution/0200-0299/0267.Palindrome Permutation II/README_EN.md b/solution/0200-0299/0267.Palindrome Permutation II/README_EN.md index dd219e46b0ca8..9f68d52ee4fc4 100644 --- a/solution/0200-0299/0267.Palindrome Permutation II/README_EN.md +++ b/solution/0200-0299/0267.Palindrome Permutation II/README_EN.md @@ -1,4 +1,4 @@ -# [267. Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii) +# [267. Palindrome Permutation II 🔒](https://leetcode.com/problems/palindrome-permutation-ii) [中文文档](/solution/0200-0299/0267.Palindrome%20Permutation%20II/README.md) diff --git a/solution/0200-0299/0269.Alien Dictionary/README.md b/solution/0200-0299/0269.Alien Dictionary/README.md index 1d717d4f280e3..ecbd277f8dc58 100644 --- a/solution/0200-0299/0269.Alien Dictionary/README.md +++ b/solution/0200-0299/0269.Alien Dictionary/README.md @@ -1,4 +1,4 @@ -# [269. 火星词典](https://leetcode.cn/problems/alien-dictionary) +# [269. 火星词典 🔒](https://leetcode.cn/problems/alien-dictionary) [English Version](/solution/0200-0299/0269.Alien%20Dictionary/README_EN.md) diff --git a/solution/0200-0299/0269.Alien Dictionary/README_EN.md b/solution/0200-0299/0269.Alien Dictionary/README_EN.md index 440a39071bb9a..64d63fb749ea4 100644 --- a/solution/0200-0299/0269.Alien Dictionary/README_EN.md +++ b/solution/0200-0299/0269.Alien Dictionary/README_EN.md @@ -1,4 +1,4 @@ -# [269. Alien Dictionary](https://leetcode.com/problems/alien-dictionary) +# [269. Alien Dictionary 🔒](https://leetcode.com/problems/alien-dictionary) [中文文档](/solution/0200-0299/0269.Alien%20Dictionary/README.md) diff --git a/solution/0200-0299/0270.Closest Binary Search Tree Value/README.md b/solution/0200-0299/0270.Closest Binary Search Tree Value/README.md index 38c4457288dcf..15d69c5d6a2fe 100644 --- a/solution/0200-0299/0270.Closest Binary Search Tree Value/README.md +++ b/solution/0200-0299/0270.Closest Binary Search Tree Value/README.md @@ -1,4 +1,4 @@ -# [270. 最接近的二叉搜索树值](https://leetcode.cn/problems/closest-binary-search-tree-value) +# [270. 最接近的二叉搜索树值 🔒](https://leetcode.cn/problems/closest-binary-search-tree-value) [English Version](/solution/0200-0299/0270.Closest%20Binary%20Search%20Tree%20Value/README_EN.md) diff --git a/solution/0200-0299/0270.Closest Binary Search Tree Value/README_EN.md b/solution/0200-0299/0270.Closest Binary Search Tree Value/README_EN.md index 6bcb0fc9c0c6e..d876ef6e1f90e 100644 --- a/solution/0200-0299/0270.Closest Binary Search Tree Value/README_EN.md +++ b/solution/0200-0299/0270.Closest Binary Search Tree Value/README_EN.md @@ -1,4 +1,4 @@ -# [270. Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value) +# [270. Closest Binary Search Tree Value 🔒](https://leetcode.com/problems/closest-binary-search-tree-value) [中文文档](/solution/0200-0299/0270.Closest%20Binary%20Search%20Tree%20Value/README.md) diff --git a/solution/0200-0299/0271.Encode and Decode Strings/README.md b/solution/0200-0299/0271.Encode and Decode Strings/README.md index c6838e3a3c626..7e9c3abfbbfe0 100644 --- a/solution/0200-0299/0271.Encode and Decode Strings/README.md +++ b/solution/0200-0299/0271.Encode and Decode Strings/README.md @@ -1,4 +1,4 @@ -# [271. 字符串的编码与解码](https://leetcode.cn/problems/encode-and-decode-strings) +# [271. 字符串的编码与解码 🔒](https://leetcode.cn/problems/encode-and-decode-strings) [English Version](/solution/0200-0299/0271.Encode%20and%20Decode%20Strings/README_EN.md) diff --git a/solution/0200-0299/0271.Encode and Decode Strings/README_EN.md b/solution/0200-0299/0271.Encode and Decode Strings/README_EN.md index 272236177dacd..6db611c788e45 100644 --- a/solution/0200-0299/0271.Encode and Decode Strings/README_EN.md +++ b/solution/0200-0299/0271.Encode and Decode Strings/README_EN.md @@ -1,4 +1,4 @@ -# [271. Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings) +# [271. Encode and Decode Strings 🔒](https://leetcode.com/problems/encode-and-decode-strings) [中文文档](/solution/0200-0299/0271.Encode%20and%20Decode%20Strings/README.md) diff --git a/solution/0200-0299/0272.Closest Binary Search Tree Value II/README.md b/solution/0200-0299/0272.Closest Binary Search Tree Value II/README.md index 0306fba38b46f..a758646b2cb52 100644 --- a/solution/0200-0299/0272.Closest Binary Search Tree Value II/README.md +++ b/solution/0200-0299/0272.Closest Binary Search Tree Value II/README.md @@ -1,4 +1,4 @@ -# [272. 最接近的二叉搜索树值 II](https://leetcode.cn/problems/closest-binary-search-tree-value-ii) +# [272. 最接近的二叉搜索树值 II 🔒](https://leetcode.cn/problems/closest-binary-search-tree-value-ii) [English Version](/solution/0200-0299/0272.Closest%20Binary%20Search%20Tree%20Value%20II/README_EN.md) diff --git a/solution/0200-0299/0272.Closest Binary Search Tree Value II/README_EN.md b/solution/0200-0299/0272.Closest Binary Search Tree Value II/README_EN.md index 0286f2b205500..f030073fdbb89 100644 --- a/solution/0200-0299/0272.Closest Binary Search Tree Value II/README_EN.md +++ b/solution/0200-0299/0272.Closest Binary Search Tree Value II/README_EN.md @@ -1,4 +1,4 @@ -# [272. Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) +# [272. Closest Binary Search Tree Value II 🔒](https://leetcode.com/problems/closest-binary-search-tree-value-ii) [中文文档](/solution/0200-0299/0272.Closest%20Binary%20Search%20Tree%20Value%20II/README.md) diff --git a/solution/0200-0299/0276.Paint Fence/README.md b/solution/0200-0299/0276.Paint Fence/README.md index 4904ffa553d2f..5912ab68eaf3b 100644 --- a/solution/0200-0299/0276.Paint Fence/README.md +++ b/solution/0200-0299/0276.Paint Fence/README.md @@ -1,4 +1,4 @@ -# [276. 栅栏涂色](https://leetcode.cn/problems/paint-fence) +# [276. 栅栏涂色 🔒](https://leetcode.cn/problems/paint-fence) [English Version](/solution/0200-0299/0276.Paint%20Fence/README_EN.md) diff --git a/solution/0200-0299/0276.Paint Fence/README_EN.md b/solution/0200-0299/0276.Paint Fence/README_EN.md index 938117deaf632..83bcc23595b3c 100644 --- a/solution/0200-0299/0276.Paint Fence/README_EN.md +++ b/solution/0200-0299/0276.Paint Fence/README_EN.md @@ -1,4 +1,4 @@ -# [276. Paint Fence](https://leetcode.com/problems/paint-fence) +# [276. Paint Fence 🔒](https://leetcode.com/problems/paint-fence) [中文文档](/solution/0200-0299/0276.Paint%20Fence/README.md) diff --git a/solution/0200-0299/0277.Find the Celebrity/README.md b/solution/0200-0299/0277.Find the Celebrity/README.md index 41d780c88809e..22d5421f7ac09 100644 --- a/solution/0200-0299/0277.Find the Celebrity/README.md +++ b/solution/0200-0299/0277.Find the Celebrity/README.md @@ -1,4 +1,4 @@ -# [277. 搜寻名人](https://leetcode.cn/problems/find-the-celebrity) +# [277. 搜寻名人 🔒](https://leetcode.cn/problems/find-the-celebrity) [English Version](/solution/0200-0299/0277.Find%20the%20Celebrity/README_EN.md) diff --git a/solution/0200-0299/0277.Find the Celebrity/README_EN.md b/solution/0200-0299/0277.Find the Celebrity/README_EN.md index 8d3d455269682..aac5272f2b2d9 100644 --- a/solution/0200-0299/0277.Find the Celebrity/README_EN.md +++ b/solution/0200-0299/0277.Find the Celebrity/README_EN.md @@ -1,4 +1,4 @@ -# [277. Find the Celebrity](https://leetcode.com/problems/find-the-celebrity) +# [277. Find the Celebrity 🔒](https://leetcode.com/problems/find-the-celebrity) [中文文档](/solution/0200-0299/0277.Find%20the%20Celebrity/README.md) diff --git a/solution/0200-0299/0280.Wiggle Sort/README.md b/solution/0200-0299/0280.Wiggle Sort/README.md index 8c7e7a6a70321..57adb98b8d5c9 100644 --- a/solution/0200-0299/0280.Wiggle Sort/README.md +++ b/solution/0200-0299/0280.Wiggle Sort/README.md @@ -1,4 +1,4 @@ -# [280. 摆动排序](https://leetcode.cn/problems/wiggle-sort) +# [280. 摆动排序 🔒](https://leetcode.cn/problems/wiggle-sort) [English Version](/solution/0200-0299/0280.Wiggle%20Sort/README_EN.md) diff --git a/solution/0200-0299/0280.Wiggle Sort/README_EN.md b/solution/0200-0299/0280.Wiggle Sort/README_EN.md index 8d821190d1386..05f2d4ba5d911 100644 --- a/solution/0200-0299/0280.Wiggle Sort/README_EN.md +++ b/solution/0200-0299/0280.Wiggle Sort/README_EN.md @@ -1,4 +1,4 @@ -# [280. Wiggle Sort](https://leetcode.com/problems/wiggle-sort) +# [280. Wiggle Sort 🔒](https://leetcode.com/problems/wiggle-sort) [中文文档](/solution/0200-0299/0280.Wiggle%20Sort/README.md) diff --git a/solution/0200-0299/0281.Zigzag Iterator/README.md b/solution/0200-0299/0281.Zigzag Iterator/README.md index 09d47c5428552..2ed80707dc355 100644 --- a/solution/0200-0299/0281.Zigzag Iterator/README.md +++ b/solution/0200-0299/0281.Zigzag Iterator/README.md @@ -1,4 +1,4 @@ -# [281. 锯齿迭代器](https://leetcode.cn/problems/zigzag-iterator) +# [281. 锯齿迭代器 🔒](https://leetcode.cn/problems/zigzag-iterator) [English Version](/solution/0200-0299/0281.Zigzag%20Iterator/README_EN.md) diff --git a/solution/0200-0299/0281.Zigzag Iterator/README_EN.md b/solution/0200-0299/0281.Zigzag Iterator/README_EN.md index 1b47862dc909c..c89380f19818a 100644 --- a/solution/0200-0299/0281.Zigzag Iterator/README_EN.md +++ b/solution/0200-0299/0281.Zigzag Iterator/README_EN.md @@ -1,4 +1,4 @@ -# [281. Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator) +# [281. Zigzag Iterator 🔒](https://leetcode.com/problems/zigzag-iterator) [中文文档](/solution/0200-0299/0281.Zigzag%20Iterator/README.md) diff --git a/solution/0200-0299/0285.Inorder Successor in BST/README.md b/solution/0200-0299/0285.Inorder Successor in BST/README.md index 37260a869d175..843b574865a93 100644 --- a/solution/0200-0299/0285.Inorder Successor in BST/README.md +++ b/solution/0200-0299/0285.Inorder Successor in BST/README.md @@ -1,4 +1,4 @@ -# [285. 二叉搜索树中的中序后继](https://leetcode.cn/problems/inorder-successor-in-bst) +# [285. 二叉搜索树中的中序后继 🔒](https://leetcode.cn/problems/inorder-successor-in-bst) [English Version](/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README_EN.md) diff --git a/solution/0200-0299/0285.Inorder Successor in BST/README_EN.md b/solution/0200-0299/0285.Inorder Successor in BST/README_EN.md index 3cb5ec177483d..c6c1fbb489ba1 100644 --- a/solution/0200-0299/0285.Inorder Successor in BST/README_EN.md +++ b/solution/0200-0299/0285.Inorder Successor in BST/README_EN.md @@ -1,4 +1,4 @@ -# [285. Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst) +# [285. Inorder Successor in BST 🔒](https://leetcode.com/problems/inorder-successor-in-bst) [中文文档](/solution/0200-0299/0285.Inorder%20Successor%20in%20BST/README.md) diff --git a/solution/0200-0299/0286.Walls and Gates/README.md b/solution/0200-0299/0286.Walls and Gates/README.md index 71e370c8aa6e5..2d258368f631c 100644 --- a/solution/0200-0299/0286.Walls and Gates/README.md +++ b/solution/0200-0299/0286.Walls and Gates/README.md @@ -1,4 +1,4 @@ -# [286. 墙与门](https://leetcode.cn/problems/walls-and-gates) +# [286. 墙与门 🔒](https://leetcode.cn/problems/walls-and-gates) [English Version](/solution/0200-0299/0286.Walls%20and%20Gates/README_EN.md) diff --git a/solution/0200-0299/0286.Walls and Gates/README_EN.md b/solution/0200-0299/0286.Walls and Gates/README_EN.md index 775ba6fdb5fbb..57f85a9c2cc47 100644 --- a/solution/0200-0299/0286.Walls and Gates/README_EN.md +++ b/solution/0200-0299/0286.Walls and Gates/README_EN.md @@ -1,4 +1,4 @@ -# [286. Walls and Gates](https://leetcode.com/problems/walls-and-gates) +# [286. Walls and Gates 🔒](https://leetcode.com/problems/walls-and-gates) [中文文档](/solution/0200-0299/0286.Walls%20and%20Gates/README.md) diff --git a/solution/0200-0299/0288.Unique Word Abbreviation/README.md b/solution/0200-0299/0288.Unique Word Abbreviation/README.md index 94a63f6826bfd..da95c4fbb5999 100644 --- a/solution/0200-0299/0288.Unique Word Abbreviation/README.md +++ b/solution/0200-0299/0288.Unique Word Abbreviation/README.md @@ -1,4 +1,4 @@ -# [288. 单词的唯一缩写](https://leetcode.cn/problems/unique-word-abbreviation) +# [288. 单词的唯一缩写 🔒](https://leetcode.cn/problems/unique-word-abbreviation) [English Version](/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README_EN.md) diff --git a/solution/0200-0299/0288.Unique Word Abbreviation/README_EN.md b/solution/0200-0299/0288.Unique Word Abbreviation/README_EN.md index 902893b89cf8e..6eba54c3f8c2d 100644 --- a/solution/0200-0299/0288.Unique Word Abbreviation/README_EN.md +++ b/solution/0200-0299/0288.Unique Word Abbreviation/README_EN.md @@ -1,4 +1,4 @@ -# [288. Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation) +# [288. Unique Word Abbreviation 🔒](https://leetcode.com/problems/unique-word-abbreviation) [中文文档](/solution/0200-0299/0288.Unique%20Word%20Abbreviation/README.md) diff --git a/solution/0200-0299/0291.Word Pattern II/README.md b/solution/0200-0299/0291.Word Pattern II/README.md index f07818a12b736..a374760186dca 100644 --- a/solution/0200-0299/0291.Word Pattern II/README.md +++ b/solution/0200-0299/0291.Word Pattern II/README.md @@ -1,4 +1,4 @@ -# [291. 单词规律 II](https://leetcode.cn/problems/word-pattern-ii) +# [291. 单词规律 II 🔒](https://leetcode.cn/problems/word-pattern-ii) [English Version](/solution/0200-0299/0291.Word%20Pattern%20II/README_EN.md) diff --git a/solution/0200-0299/0291.Word Pattern II/README_EN.md b/solution/0200-0299/0291.Word Pattern II/README_EN.md index ec5220c8063c8..9efe6c755f461 100644 --- a/solution/0200-0299/0291.Word Pattern II/README_EN.md +++ b/solution/0200-0299/0291.Word Pattern II/README_EN.md @@ -1,4 +1,4 @@ -# [291. Word Pattern II](https://leetcode.com/problems/word-pattern-ii) +# [291. Word Pattern II 🔒](https://leetcode.com/problems/word-pattern-ii) [中文文档](/solution/0200-0299/0291.Word%20Pattern%20II/README.md) diff --git a/solution/0200-0299/0293.Flip Game/README.md b/solution/0200-0299/0293.Flip Game/README.md index 81c0c460a6946..6614e13b67f3e 100644 --- a/solution/0200-0299/0293.Flip Game/README.md +++ b/solution/0200-0299/0293.Flip Game/README.md @@ -1,4 +1,4 @@ -# [293. 翻转游戏](https://leetcode.cn/problems/flip-game) +# [293. 翻转游戏 🔒](https://leetcode.cn/problems/flip-game) [English Version](/solution/0200-0299/0293.Flip%20Game/README_EN.md) diff --git a/solution/0200-0299/0293.Flip Game/README_EN.md b/solution/0200-0299/0293.Flip Game/README_EN.md index 927a8ef5a3e48..7913a3a5558d4 100644 --- a/solution/0200-0299/0293.Flip Game/README_EN.md +++ b/solution/0200-0299/0293.Flip Game/README_EN.md @@ -1,4 +1,4 @@ -# [293. Flip Game](https://leetcode.com/problems/flip-game) +# [293. Flip Game 🔒](https://leetcode.com/problems/flip-game) [中文文档](/solution/0200-0299/0293.Flip%20Game/README.md) diff --git a/solution/0200-0299/0294.Flip Game II/README.md b/solution/0200-0299/0294.Flip Game II/README.md index 9475215c33cdd..3a1e37b67b942 100644 --- a/solution/0200-0299/0294.Flip Game II/README.md +++ b/solution/0200-0299/0294.Flip Game II/README.md @@ -1,4 +1,4 @@ -# [294. 翻转游戏 II](https://leetcode.cn/problems/flip-game-ii) +# [294. 翻转游戏 II 🔒](https://leetcode.cn/problems/flip-game-ii) [English Version](/solution/0200-0299/0294.Flip%20Game%20II/README_EN.md) diff --git a/solution/0200-0299/0294.Flip Game II/README_EN.md b/solution/0200-0299/0294.Flip Game II/README_EN.md index f791b7cf2731b..89fd8308a7361 100644 --- a/solution/0200-0299/0294.Flip Game II/README_EN.md +++ b/solution/0200-0299/0294.Flip Game II/README_EN.md @@ -1,4 +1,4 @@ -# [294. Flip Game II](https://leetcode.com/problems/flip-game-ii) +# [294. Flip Game II 🔒](https://leetcode.com/problems/flip-game-ii) [中文文档](/solution/0200-0299/0294.Flip%20Game%20II/README.md) diff --git a/solution/0200-0299/0296.Best Meeting Point/README.md b/solution/0200-0299/0296.Best Meeting Point/README.md index b3e3f14c202b9..848373a2bbe22 100644 --- a/solution/0200-0299/0296.Best Meeting Point/README.md +++ b/solution/0200-0299/0296.Best Meeting Point/README.md @@ -1,4 +1,4 @@ -# [296. 最佳的碰头地点](https://leetcode.cn/problems/best-meeting-point) +# [296. 最佳的碰头地点 🔒](https://leetcode.cn/problems/best-meeting-point) [English Version](/solution/0200-0299/0296.Best%20Meeting%20Point/README_EN.md) diff --git a/solution/0200-0299/0296.Best Meeting Point/README_EN.md b/solution/0200-0299/0296.Best Meeting Point/README_EN.md index b2aa867f7641d..5cfe70f7278fb 100644 --- a/solution/0200-0299/0296.Best Meeting Point/README_EN.md +++ b/solution/0200-0299/0296.Best Meeting Point/README_EN.md @@ -1,4 +1,4 @@ -# [296. Best Meeting Point](https://leetcode.com/problems/best-meeting-point) +# [296. Best Meeting Point 🔒](https://leetcode.com/problems/best-meeting-point) [中文文档](/solution/0200-0299/0296.Best%20Meeting%20Point/README.md) diff --git a/solution/0200-0299/0298.Binary Tree Longest Consecutive Sequence/README.md b/solution/0200-0299/0298.Binary Tree Longest Consecutive Sequence/README.md index 8f33fab2219ec..73e802600da35 100644 --- a/solution/0200-0299/0298.Binary Tree Longest Consecutive Sequence/README.md +++ b/solution/0200-0299/0298.Binary Tree Longest Consecutive Sequence/README.md @@ -1,4 +1,4 @@ -# [298. 二叉树最长连续序列](https://leetcode.cn/problems/binary-tree-longest-consecutive-sequence) +# [298. 二叉树最长连续序列 🔒](https://leetcode.cn/problems/binary-tree-longest-consecutive-sequence) [English Version](/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/README_EN.md) diff --git a/solution/0200-0299/0298.Binary Tree Longest Consecutive Sequence/README_EN.md b/solution/0200-0299/0298.Binary Tree Longest Consecutive Sequence/README_EN.md index 95c2092fa6d74..e01dd06d688a3 100644 --- a/solution/0200-0299/0298.Binary Tree Longest Consecutive Sequence/README_EN.md +++ b/solution/0200-0299/0298.Binary Tree Longest Consecutive Sequence/README_EN.md @@ -1,4 +1,4 @@ -# [298. Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) +# [298. Binary Tree Longest Consecutive Sequence 🔒](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence) [中文文档](/solution/0200-0299/0298.Binary%20Tree%20Longest%20Consecutive%20Sequence/README.md) diff --git a/solution/0300-0399/0302.Smallest Rectangle Enclosing Black Pixels/README.md b/solution/0300-0399/0302.Smallest Rectangle Enclosing Black Pixels/README.md index 9bffd939466f9..282436fcb586a 100644 --- a/solution/0300-0399/0302.Smallest Rectangle Enclosing Black Pixels/README.md +++ b/solution/0300-0399/0302.Smallest Rectangle Enclosing Black Pixels/README.md @@ -1,4 +1,4 @@ -# [302. 包含全部黑色像素的最小矩形](https://leetcode.cn/problems/smallest-rectangle-enclosing-black-pixels) +# [302. 包含全部黑色像素的最小矩形 🔒](https://leetcode.cn/problems/smallest-rectangle-enclosing-black-pixels) [English Version](/solution/0300-0399/0302.Smallest%20Rectangle%20Enclosing%20Black%20Pixels/README_EN.md) diff --git a/solution/0300-0399/0302.Smallest Rectangle Enclosing Black Pixels/README_EN.md b/solution/0300-0399/0302.Smallest Rectangle Enclosing Black Pixels/README_EN.md index e1c711644371a..433b5c910fe6c 100644 --- a/solution/0300-0399/0302.Smallest Rectangle Enclosing Black Pixels/README_EN.md +++ b/solution/0300-0399/0302.Smallest Rectangle Enclosing Black Pixels/README_EN.md @@ -1,4 +1,4 @@ -# [302. Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) +# [302. Smallest Rectangle Enclosing Black Pixels 🔒](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels) [中文文档](/solution/0300-0399/0302.Smallest%20Rectangle%20Enclosing%20Black%20Pixels/README.md) diff --git a/solution/0300-0399/0305.Number of Islands II/README.md b/solution/0300-0399/0305.Number of Islands II/README.md index 82d37669c1f0c..9ceb83f08de5b 100644 --- a/solution/0300-0399/0305.Number of Islands II/README.md +++ b/solution/0300-0399/0305.Number of Islands II/README.md @@ -1,4 +1,4 @@ -# [305. 岛屿数量 II](https://leetcode.cn/problems/number-of-islands-ii) +# [305. 岛屿数量 II 🔒](https://leetcode.cn/problems/number-of-islands-ii) [English Version](/solution/0300-0399/0305.Number%20of%20Islands%20II/README_EN.md) diff --git a/solution/0300-0399/0305.Number of Islands II/README_EN.md b/solution/0300-0399/0305.Number of Islands II/README_EN.md index a7a366e6385b2..10f0a94b75f1b 100644 --- a/solution/0300-0399/0305.Number of Islands II/README_EN.md +++ b/solution/0300-0399/0305.Number of Islands II/README_EN.md @@ -1,4 +1,4 @@ -# [305. Number of Islands II](https://leetcode.com/problems/number-of-islands-ii) +# [305. Number of Islands II 🔒](https://leetcode.com/problems/number-of-islands-ii) [中文文档](/solution/0300-0399/0305.Number%20of%20Islands%20II/README.md) diff --git a/solution/0300-0399/0308.Range Sum Query 2D - Mutable/README.md b/solution/0300-0399/0308.Range Sum Query 2D - Mutable/README.md index 96c52369bb5cb..f2ac8825ec605 100644 --- a/solution/0300-0399/0308.Range Sum Query 2D - Mutable/README.md +++ b/solution/0300-0399/0308.Range Sum Query 2D - Mutable/README.md @@ -1,4 +1,4 @@ -# [308. 二维区域和检索 - 可变](https://leetcode.cn/problems/range-sum-query-2d-mutable) +# [308. 二维区域和检索 - 可变 🔒](https://leetcode.cn/problems/range-sum-query-2d-mutable) [English Version](/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README_EN.md) diff --git a/solution/0300-0399/0308.Range Sum Query 2D - Mutable/README_EN.md b/solution/0300-0399/0308.Range Sum Query 2D - Mutable/README_EN.md index 42251174b1306..9c70a4d8ec9d5 100644 --- a/solution/0300-0399/0308.Range Sum Query 2D - Mutable/README_EN.md +++ b/solution/0300-0399/0308.Range Sum Query 2D - Mutable/README_EN.md @@ -1,4 +1,4 @@ -# [308. Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable) +# [308. Range Sum Query 2D - Mutable 🔒](https://leetcode.com/problems/range-sum-query-2d-mutable) [中文文档](/solution/0300-0399/0308.Range%20Sum%20Query%202D%20-%20Mutable/README.md) diff --git a/solution/0300-0399/0311.Sparse Matrix Multiplication/README.md b/solution/0300-0399/0311.Sparse Matrix Multiplication/README.md index 725353358eb1f..b46f1b3ff965b 100644 --- a/solution/0300-0399/0311.Sparse Matrix Multiplication/README.md +++ b/solution/0300-0399/0311.Sparse Matrix Multiplication/README.md @@ -1,4 +1,4 @@ -# [311. 稀疏矩阵的乘法](https://leetcode.cn/problems/sparse-matrix-multiplication) +# [311. 稀疏矩阵的乘法 🔒](https://leetcode.cn/problems/sparse-matrix-multiplication) [English Version](/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README_EN.md) diff --git a/solution/0300-0399/0311.Sparse Matrix Multiplication/README_EN.md b/solution/0300-0399/0311.Sparse Matrix Multiplication/README_EN.md index f0271ce259a8d..afa48bb7607b0 100644 --- a/solution/0300-0399/0311.Sparse Matrix Multiplication/README_EN.md +++ b/solution/0300-0399/0311.Sparse Matrix Multiplication/README_EN.md @@ -1,4 +1,4 @@ -# [311. Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication) +# [311. Sparse Matrix Multiplication 🔒](https://leetcode.com/problems/sparse-matrix-multiplication) [中文文档](/solution/0300-0399/0311.Sparse%20Matrix%20Multiplication/README.md) diff --git a/solution/0300-0399/0314.Binary Tree Vertical Order Traversal/README.md b/solution/0300-0399/0314.Binary Tree Vertical Order Traversal/README.md index 82ce7b3f83b43..4cdc823635007 100644 --- a/solution/0300-0399/0314.Binary Tree Vertical Order Traversal/README.md +++ b/solution/0300-0399/0314.Binary Tree Vertical Order Traversal/README.md @@ -1,4 +1,4 @@ -# [314. 二叉树的垂直遍历](https://leetcode.cn/problems/binary-tree-vertical-order-traversal) +# [314. 二叉树的垂直遍历 🔒](https://leetcode.cn/problems/binary-tree-vertical-order-traversal) [English Version](/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README_EN.md) diff --git a/solution/0300-0399/0314.Binary Tree Vertical Order Traversal/README_EN.md b/solution/0300-0399/0314.Binary Tree Vertical Order Traversal/README_EN.md index 7985a8f40f5d8..5e9b7dd846dd7 100644 --- a/solution/0300-0399/0314.Binary Tree Vertical Order Traversal/README_EN.md +++ b/solution/0300-0399/0314.Binary Tree Vertical Order Traversal/README_EN.md @@ -1,4 +1,4 @@ -# [314. Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal) +# [314. Binary Tree Vertical Order Traversal 🔒](https://leetcode.com/problems/binary-tree-vertical-order-traversal) [中文文档](/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README.md) diff --git a/solution/0300-0399/0317.Shortest Distance from All Buildings/README.md b/solution/0300-0399/0317.Shortest Distance from All Buildings/README.md index 2953e79c2ad7b..c7ad6ddadca23 100644 --- a/solution/0300-0399/0317.Shortest Distance from All Buildings/README.md +++ b/solution/0300-0399/0317.Shortest Distance from All Buildings/README.md @@ -1,4 +1,4 @@ -# [317. 离建筑物最近的距离](https://leetcode.cn/problems/shortest-distance-from-all-buildings) +# [317. 离建筑物最近的距离 🔒](https://leetcode.cn/problems/shortest-distance-from-all-buildings) [English Version](/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README_EN.md) diff --git a/solution/0300-0399/0317.Shortest Distance from All Buildings/README_EN.md b/solution/0300-0399/0317.Shortest Distance from All Buildings/README_EN.md index 6221456a38b9e..f983267697b13 100644 --- a/solution/0300-0399/0317.Shortest Distance from All Buildings/README_EN.md +++ b/solution/0300-0399/0317.Shortest Distance from All Buildings/README_EN.md @@ -1,4 +1,4 @@ -# [317. Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings) +# [317. Shortest Distance from All Buildings 🔒](https://leetcode.com/problems/shortest-distance-from-all-buildings) [中文文档](/solution/0300-0399/0317.Shortest%20Distance%20from%20All%20Buildings/README.md) diff --git a/solution/0300-0399/0320.Generalized Abbreviation/README.md b/solution/0300-0399/0320.Generalized Abbreviation/README.md index cef3bd9e5220d..27fd850345f0d 100644 --- a/solution/0300-0399/0320.Generalized Abbreviation/README.md +++ b/solution/0300-0399/0320.Generalized Abbreviation/README.md @@ -1,4 +1,4 @@ -# [320. 列举单词的全部缩写](https://leetcode.cn/problems/generalized-abbreviation) +# [320. 列举单词的全部缩写 🔒](https://leetcode.cn/problems/generalized-abbreviation) [English Version](/solution/0300-0399/0320.Generalized%20Abbreviation/README_EN.md) diff --git a/solution/0300-0399/0320.Generalized Abbreviation/README_EN.md b/solution/0300-0399/0320.Generalized Abbreviation/README_EN.md index 56996c22aa30d..52fa625b668e1 100644 --- a/solution/0300-0399/0320.Generalized Abbreviation/README_EN.md +++ b/solution/0300-0399/0320.Generalized Abbreviation/README_EN.md @@ -1,4 +1,4 @@ -# [320. Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation) +# [320. Generalized Abbreviation 🔒](https://leetcode.com/problems/generalized-abbreviation) [中文文档](/solution/0300-0399/0320.Generalized%20Abbreviation/README.md) diff --git a/solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/README.md b/solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/README.md index fcf39c1c93199..efde32e4b1e5f 100644 --- a/solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/README.md +++ b/solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/README.md @@ -1,4 +1,4 @@ -# [323. 无向图中连通分量的数目](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph) +# [323. 无向图中连通分量的数目 🔒](https://leetcode.cn/problems/number-of-connected-components-in-an-undirected-graph) [English Version](/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/README_EN.md) diff --git a/solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/README_EN.md b/solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/README_EN.md index b8271a0a26054..3aac050dfc88e 100644 --- a/solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/README_EN.md +++ b/solution/0300-0399/0323.Number of Connected Components in an Undirected Graph/README_EN.md @@ -1,4 +1,4 @@ -# [323. Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) +# [323. Number of Connected Components in an Undirected Graph 🔒](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph) [中文文档](/solution/0300-0399/0323.Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/README.md) diff --git a/solution/0300-0399/0325.Maximum Size Subarray Sum Equals k/README.md b/solution/0300-0399/0325.Maximum Size Subarray Sum Equals k/README.md index 3d9415c8ba42c..7a2cbf9d5ef78 100644 --- a/solution/0300-0399/0325.Maximum Size Subarray Sum Equals k/README.md +++ b/solution/0300-0399/0325.Maximum Size Subarray Sum Equals k/README.md @@ -1,4 +1,4 @@ -# [325. 和等于 k 的最长子数组长度](https://leetcode.cn/problems/maximum-size-subarray-sum-equals-k) +# [325. 和等于 k 的最长子数组长度 🔒](https://leetcode.cn/problems/maximum-size-subarray-sum-equals-k) [English Version](/solution/0300-0399/0325.Maximum%20Size%20Subarray%20Sum%20Equals%20k/README_EN.md) diff --git a/solution/0300-0399/0325.Maximum Size Subarray Sum Equals k/README_EN.md b/solution/0300-0399/0325.Maximum Size Subarray Sum Equals k/README_EN.md index 3d63f28cba156..292f3f1065471 100644 --- a/solution/0300-0399/0325.Maximum Size Subarray Sum Equals k/README_EN.md +++ b/solution/0300-0399/0325.Maximum Size Subarray Sum Equals k/README_EN.md @@ -1,4 +1,4 @@ -# [325. Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) +# [325. Maximum Size Subarray Sum Equals k 🔒](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k) [中文文档](/solution/0300-0399/0325.Maximum%20Size%20Subarray%20Sum%20Equals%20k/README.md) diff --git a/solution/0300-0399/0333.Largest BST Subtree/README.md b/solution/0300-0399/0333.Largest BST Subtree/README.md index 5f1c7ddb97e39..4046e850b23e8 100644 --- a/solution/0300-0399/0333.Largest BST Subtree/README.md +++ b/solution/0300-0399/0333.Largest BST Subtree/README.md @@ -1,4 +1,4 @@ -# [333. 最大二叉搜索子树](https://leetcode.cn/problems/largest-bst-subtree) +# [333. 最大二叉搜索子树 🔒](https://leetcode.cn/problems/largest-bst-subtree) [English Version](/solution/0300-0399/0333.Largest%20BST%20Subtree/README_EN.md) diff --git a/solution/0300-0399/0333.Largest BST Subtree/README_EN.md b/solution/0300-0399/0333.Largest BST Subtree/README_EN.md index 2c4e03787d021..5eae71aacdf4c 100644 --- a/solution/0300-0399/0333.Largest BST Subtree/README_EN.md +++ b/solution/0300-0399/0333.Largest BST Subtree/README_EN.md @@ -1,4 +1,4 @@ -# [333. Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree) +# [333. Largest BST Subtree 🔒](https://leetcode.com/problems/largest-bst-subtree) [中文文档](/solution/0300-0399/0333.Largest%20BST%20Subtree/README.md) diff --git a/solution/0300-0399/0339.Nested List Weight Sum/README.md b/solution/0300-0399/0339.Nested List Weight Sum/README.md index dfb04cdb2359a..2ad26417e900b 100644 --- a/solution/0300-0399/0339.Nested List Weight Sum/README.md +++ b/solution/0300-0399/0339.Nested List Weight Sum/README.md @@ -1,4 +1,4 @@ -# [339. 嵌套列表加权和](https://leetcode.cn/problems/nested-list-weight-sum) +# [339. 嵌套列表加权和 🔒](https://leetcode.cn/problems/nested-list-weight-sum) [English Version](/solution/0300-0399/0339.Nested%20List%20Weight%20Sum/README_EN.md) diff --git a/solution/0300-0399/0339.Nested List Weight Sum/README_EN.md b/solution/0300-0399/0339.Nested List Weight Sum/README_EN.md index a4ea4571afffc..f01e9bf51382a 100644 --- a/solution/0300-0399/0339.Nested List Weight Sum/README_EN.md +++ b/solution/0300-0399/0339.Nested List Weight Sum/README_EN.md @@ -1,4 +1,4 @@ -# [339. Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) +# [339. Nested List Weight Sum 🔒](https://leetcode.com/problems/nested-list-weight-sum) [中文文档](/solution/0300-0399/0339.Nested%20List%20Weight%20Sum/README.md) diff --git a/solution/0300-0399/0340.Longest Substring with At Most K Distinct Characters/README.md b/solution/0300-0399/0340.Longest Substring with At Most K Distinct Characters/README.md index 384c96d7edf19..dc3f22be2ee94 100644 --- a/solution/0300-0399/0340.Longest Substring with At Most K Distinct Characters/README.md +++ b/solution/0300-0399/0340.Longest Substring with At Most K Distinct Characters/README.md @@ -1,4 +1,4 @@ -# [340. 至多包含 K 个不同字符的最长子串](https://leetcode.cn/problems/longest-substring-with-at-most-k-distinct-characters) +# [340. 至多包含 K 个不同字符的最长子串 🔒](https://leetcode.cn/problems/longest-substring-with-at-most-k-distinct-characters) [English Version](/solution/0300-0399/0340.Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters/README_EN.md) diff --git a/solution/0300-0399/0340.Longest Substring with At Most K Distinct Characters/README_EN.md b/solution/0300-0399/0340.Longest Substring with At Most K Distinct Characters/README_EN.md index 8bbaa112111e5..48693035476f6 100644 --- a/solution/0300-0399/0340.Longest Substring with At Most K Distinct Characters/README_EN.md +++ b/solution/0300-0399/0340.Longest Substring with At Most K Distinct Characters/README_EN.md @@ -1,4 +1,4 @@ -# [340. Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) +# [340. Longest Substring with At Most K Distinct Characters 🔒](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters) [中文文档](/solution/0300-0399/0340.Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters/README.md) diff --git a/solution/0300-0399/0346.Moving Average from Data Stream/README.md b/solution/0300-0399/0346.Moving Average from Data Stream/README.md index b4dabd8430956..0c3719caa65ce 100644 --- a/solution/0300-0399/0346.Moving Average from Data Stream/README.md +++ b/solution/0300-0399/0346.Moving Average from Data Stream/README.md @@ -1,4 +1,4 @@ -# [346. 数据流中的移动平均值](https://leetcode.cn/problems/moving-average-from-data-stream) +# [346. 数据流中的移动平均值 🔒](https://leetcode.cn/problems/moving-average-from-data-stream) [English Version](/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README_EN.md) diff --git a/solution/0300-0399/0346.Moving Average from Data Stream/README_EN.md b/solution/0300-0399/0346.Moving Average from Data Stream/README_EN.md index f426c4721a917..3519bc8f803d6 100644 --- a/solution/0300-0399/0346.Moving Average from Data Stream/README_EN.md +++ b/solution/0300-0399/0346.Moving Average from Data Stream/README_EN.md @@ -1,4 +1,4 @@ -# [346. Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream) +# [346. Moving Average from Data Stream 🔒](https://leetcode.com/problems/moving-average-from-data-stream) [中文文档](/solution/0300-0399/0346.Moving%20Average%20from%20Data%20Stream/README.md) diff --git a/solution/0300-0399/0348.Design Tic-Tac-Toe/README.md b/solution/0300-0399/0348.Design Tic-Tac-Toe/README.md index d51f36cde5a92..62ba67a360854 100644 --- a/solution/0300-0399/0348.Design Tic-Tac-Toe/README.md +++ b/solution/0300-0399/0348.Design Tic-Tac-Toe/README.md @@ -1,4 +1,4 @@ -# [348. 设计井字棋](https://leetcode.cn/problems/design-tic-tac-toe) +# [348. 设计井字棋 🔒](https://leetcode.cn/problems/design-tic-tac-toe) [English Version](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README_EN.md) diff --git a/solution/0300-0399/0348.Design Tic-Tac-Toe/README_EN.md b/solution/0300-0399/0348.Design Tic-Tac-Toe/README_EN.md index cccadbe293ac7..5fadfb7680d84 100644 --- a/solution/0300-0399/0348.Design Tic-Tac-Toe/README_EN.md +++ b/solution/0300-0399/0348.Design Tic-Tac-Toe/README_EN.md @@ -1,4 +1,4 @@ -# [348. Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe) +# [348. Design Tic-Tac-Toe 🔒](https://leetcode.com/problems/design-tic-tac-toe) [中文文档](/solution/0300-0399/0348.Design%20Tic-Tac-Toe/README.md) diff --git a/solution/0300-0399/0351.Android Unlock Patterns/README.md b/solution/0300-0399/0351.Android Unlock Patterns/README.md index fc14ef08d856c..645ace91d5a22 100644 --- a/solution/0300-0399/0351.Android Unlock Patterns/README.md +++ b/solution/0300-0399/0351.Android Unlock Patterns/README.md @@ -1,4 +1,4 @@ -# [351. 安卓系统手势解锁](https://leetcode.cn/problems/android-unlock-patterns) +# [351. 安卓系统手势解锁 🔒](https://leetcode.cn/problems/android-unlock-patterns) [English Version](/solution/0300-0399/0351.Android%20Unlock%20Patterns/README_EN.md) diff --git a/solution/0300-0399/0351.Android Unlock Patterns/README_EN.md b/solution/0300-0399/0351.Android Unlock Patterns/README_EN.md index d28ebfcc227af..08ce4fd52f2b7 100644 --- a/solution/0300-0399/0351.Android Unlock Patterns/README_EN.md +++ b/solution/0300-0399/0351.Android Unlock Patterns/README_EN.md @@ -1,4 +1,4 @@ -# [351. Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns) +# [351. Android Unlock Patterns 🔒](https://leetcode.com/problems/android-unlock-patterns) [中文文档](/solution/0300-0399/0351.Android%20Unlock%20Patterns/README.md) diff --git a/solution/0300-0399/0353.Design Snake Game/README.md b/solution/0300-0399/0353.Design Snake Game/README.md index 43f03b9bfbcb6..3d6fc201b2a24 100644 --- a/solution/0300-0399/0353.Design Snake Game/README.md +++ b/solution/0300-0399/0353.Design Snake Game/README.md @@ -1,4 +1,4 @@ -# [353. 贪吃蛇](https://leetcode.cn/problems/design-snake-game) +# [353. 贪吃蛇 🔒](https://leetcode.cn/problems/design-snake-game) [English Version](/solution/0300-0399/0353.Design%20Snake%20Game/README_EN.md) diff --git a/solution/0300-0399/0353.Design Snake Game/README_EN.md b/solution/0300-0399/0353.Design Snake Game/README_EN.md index aa784c5d3fb73..6ea99b21d4d5c 100644 --- a/solution/0300-0399/0353.Design Snake Game/README_EN.md +++ b/solution/0300-0399/0353.Design Snake Game/README_EN.md @@ -1,4 +1,4 @@ -# [353. Design Snake Game](https://leetcode.com/problems/design-snake-game) +# [353. Design Snake Game 🔒](https://leetcode.com/problems/design-snake-game) [中文文档](/solution/0300-0399/0353.Design%20Snake%20Game/README.md) diff --git a/solution/0300-0399/0356.Line Reflection/README.md b/solution/0300-0399/0356.Line Reflection/README.md index 68174cc8a8727..cee24e946d92e 100644 --- a/solution/0300-0399/0356.Line Reflection/README.md +++ b/solution/0300-0399/0356.Line Reflection/README.md @@ -1,4 +1,4 @@ -# [356. 直线镜像](https://leetcode.cn/problems/line-reflection) +# [356. 直线镜像 🔒](https://leetcode.cn/problems/line-reflection) [English Version](/solution/0300-0399/0356.Line%20Reflection/README_EN.md) diff --git a/solution/0300-0399/0356.Line Reflection/README_EN.md b/solution/0300-0399/0356.Line Reflection/README_EN.md index f7e96007d59d5..41ac624503588 100644 --- a/solution/0300-0399/0356.Line Reflection/README_EN.md +++ b/solution/0300-0399/0356.Line Reflection/README_EN.md @@ -1,4 +1,4 @@ -# [356. Line Reflection](https://leetcode.com/problems/line-reflection) +# [356. Line Reflection 🔒](https://leetcode.com/problems/line-reflection) [中文文档](/solution/0300-0399/0356.Line%20Reflection/README.md) diff --git a/solution/0300-0399/0358.Rearrange String k Distance Apart/README.md b/solution/0300-0399/0358.Rearrange String k Distance Apart/README.md index 13c16ad77b7a6..a1a7703fd3766 100644 --- a/solution/0300-0399/0358.Rearrange String k Distance Apart/README.md +++ b/solution/0300-0399/0358.Rearrange String k Distance Apart/README.md @@ -1,4 +1,4 @@ -# [358. K 距离间隔重排字符串](https://leetcode.cn/problems/rearrange-string-k-distance-apart) +# [358. K 距离间隔重排字符串 🔒](https://leetcode.cn/problems/rearrange-string-k-distance-apart) [English Version](/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README_EN.md) diff --git a/solution/0300-0399/0358.Rearrange String k Distance Apart/README_EN.md b/solution/0300-0399/0358.Rearrange String k Distance Apart/README_EN.md index dbc51e01ce3ca..bbc3d3dd3e998 100644 --- a/solution/0300-0399/0358.Rearrange String k Distance Apart/README_EN.md +++ b/solution/0300-0399/0358.Rearrange String k Distance Apart/README_EN.md @@ -1,4 +1,4 @@ -# [358. Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart) +# [358. Rearrange String k Distance Apart 🔒](https://leetcode.com/problems/rearrange-string-k-distance-apart) [中文文档](/solution/0300-0399/0358.Rearrange%20String%20k%20Distance%20Apart/README.md) diff --git a/solution/0300-0399/0359.Logger Rate Limiter/README.md b/solution/0300-0399/0359.Logger Rate Limiter/README.md index f793e794b3c52..0c746835488f2 100644 --- a/solution/0300-0399/0359.Logger Rate Limiter/README.md +++ b/solution/0300-0399/0359.Logger Rate Limiter/README.md @@ -1,4 +1,4 @@ -# [359. 日志速率限制器](https://leetcode.cn/problems/logger-rate-limiter) +# [359. 日志速率限制器 🔒](https://leetcode.cn/problems/logger-rate-limiter) [English Version](/solution/0300-0399/0359.Logger%20Rate%20Limiter/README_EN.md) diff --git a/solution/0300-0399/0359.Logger Rate Limiter/README_EN.md b/solution/0300-0399/0359.Logger Rate Limiter/README_EN.md index 9b8570d2da1c0..7c303c8be2f1a 100644 --- a/solution/0300-0399/0359.Logger Rate Limiter/README_EN.md +++ b/solution/0300-0399/0359.Logger Rate Limiter/README_EN.md @@ -1,4 +1,4 @@ -# [359. Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) +# [359. Logger Rate Limiter 🔒](https://leetcode.com/problems/logger-rate-limiter) [中文文档](/solution/0300-0399/0359.Logger%20Rate%20Limiter/README.md) diff --git a/solution/0300-0399/0360.Sort Transformed Array/README.md b/solution/0300-0399/0360.Sort Transformed Array/README.md index fcb0285c07e96..c73c6c75368ac 100644 --- a/solution/0300-0399/0360.Sort Transformed Array/README.md +++ b/solution/0300-0399/0360.Sort Transformed Array/README.md @@ -1,4 +1,4 @@ -# [360. 有序转化数组](https://leetcode.cn/problems/sort-transformed-array) +# [360. 有序转化数组 🔒](https://leetcode.cn/problems/sort-transformed-array) [English Version](/solution/0300-0399/0360.Sort%20Transformed%20Array/README_EN.md) diff --git a/solution/0300-0399/0360.Sort Transformed Array/README_EN.md b/solution/0300-0399/0360.Sort Transformed Array/README_EN.md index 1804f48364fde..8947e13ee80f2 100644 --- a/solution/0300-0399/0360.Sort Transformed Array/README_EN.md +++ b/solution/0300-0399/0360.Sort Transformed Array/README_EN.md @@ -1,4 +1,4 @@ -# [360. Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array) +# [360. Sort Transformed Array 🔒](https://leetcode.com/problems/sort-transformed-array) [中文文档](/solution/0300-0399/0360.Sort%20Transformed%20Array/README.md) diff --git a/solution/0300-0399/0361.Bomb Enemy/README.md b/solution/0300-0399/0361.Bomb Enemy/README.md index 987761f130cc7..81eeb67bf9f79 100644 --- a/solution/0300-0399/0361.Bomb Enemy/README.md +++ b/solution/0300-0399/0361.Bomb Enemy/README.md @@ -1,4 +1,4 @@ -# [361. 轰炸敌人](https://leetcode.cn/problems/bomb-enemy) +# [361. 轰炸敌人 🔒](https://leetcode.cn/problems/bomb-enemy) [English Version](/solution/0300-0399/0361.Bomb%20Enemy/README_EN.md) diff --git a/solution/0300-0399/0361.Bomb Enemy/README_EN.md b/solution/0300-0399/0361.Bomb Enemy/README_EN.md index acb939226999b..98ba532fb614e 100644 --- a/solution/0300-0399/0361.Bomb Enemy/README_EN.md +++ b/solution/0300-0399/0361.Bomb Enemy/README_EN.md @@ -1,4 +1,4 @@ -# [361. Bomb Enemy](https://leetcode.com/problems/bomb-enemy) +# [361. Bomb Enemy 🔒](https://leetcode.com/problems/bomb-enemy) [中文文档](/solution/0300-0399/0361.Bomb%20Enemy/README.md) diff --git a/solution/0300-0399/0362.Design Hit Counter/README.md b/solution/0300-0399/0362.Design Hit Counter/README.md index 5e780732082ef..722141dede958 100644 --- a/solution/0300-0399/0362.Design Hit Counter/README.md +++ b/solution/0300-0399/0362.Design Hit Counter/README.md @@ -1,4 +1,4 @@ -# [362. 敲击计数器](https://leetcode.cn/problems/design-hit-counter) +# [362. 敲击计数器 🔒](https://leetcode.cn/problems/design-hit-counter) [English Version](/solution/0300-0399/0362.Design%20Hit%20Counter/README_EN.md) diff --git a/solution/0300-0399/0362.Design Hit Counter/README_EN.md b/solution/0300-0399/0362.Design Hit Counter/README_EN.md index 0f86ff77de91f..b309632ea297a 100644 --- a/solution/0300-0399/0362.Design Hit Counter/README_EN.md +++ b/solution/0300-0399/0362.Design Hit Counter/README_EN.md @@ -1,4 +1,4 @@ -# [362. Design Hit Counter](https://leetcode.com/problems/design-hit-counter) +# [362. Design Hit Counter 🔒](https://leetcode.com/problems/design-hit-counter) [中文文档](/solution/0300-0399/0362.Design%20Hit%20Counter/README.md) diff --git a/solution/0300-0399/0364.Nested List Weight Sum II/README.md b/solution/0300-0399/0364.Nested List Weight Sum II/README.md index 61672ba34066c..b9940d769d843 100644 --- a/solution/0300-0399/0364.Nested List Weight Sum II/README.md +++ b/solution/0300-0399/0364.Nested List Weight Sum II/README.md @@ -1,4 +1,4 @@ -# [364. 嵌套列表加权和 II](https://leetcode.cn/problems/nested-list-weight-sum-ii) +# [364. 嵌套列表加权和 II 🔒](https://leetcode.cn/problems/nested-list-weight-sum-ii) [English Version](/solution/0300-0399/0364.Nested%20List%20Weight%20Sum%20II/README_EN.md) diff --git a/solution/0300-0399/0364.Nested List Weight Sum II/README_EN.md b/solution/0300-0399/0364.Nested List Weight Sum II/README_EN.md index 7d86fc01ba9a7..1beb53578a003 100644 --- a/solution/0300-0399/0364.Nested List Weight Sum II/README_EN.md +++ b/solution/0300-0399/0364.Nested List Weight Sum II/README_EN.md @@ -1,4 +1,4 @@ -# [364. Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) +# [364. Nested List Weight Sum II 🔒](https://leetcode.com/problems/nested-list-weight-sum-ii) [中文文档](/solution/0300-0399/0364.Nested%20List%20Weight%20Sum%20II/README.md) diff --git a/solution/0300-0399/0366.Find Leaves of Binary Tree/README.md b/solution/0300-0399/0366.Find Leaves of Binary Tree/README.md index 6bf59b9fc1acb..95a979cecba67 100644 --- a/solution/0300-0399/0366.Find Leaves of Binary Tree/README.md +++ b/solution/0300-0399/0366.Find Leaves of Binary Tree/README.md @@ -1,4 +1,4 @@ -# [366. 寻找二叉树的叶子节点](https://leetcode.cn/problems/find-leaves-of-binary-tree) +# [366. 寻找二叉树的叶子节点 🔒](https://leetcode.cn/problems/find-leaves-of-binary-tree) [English Version](/solution/0300-0399/0366.Find%20Leaves%20of%20Binary%20Tree/README_EN.md) diff --git a/solution/0300-0399/0366.Find Leaves of Binary Tree/README_EN.md b/solution/0300-0399/0366.Find Leaves of Binary Tree/README_EN.md index 0eeadefa523bd..513a661073a97 100644 --- a/solution/0300-0399/0366.Find Leaves of Binary Tree/README_EN.md +++ b/solution/0300-0399/0366.Find Leaves of Binary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [366. Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) +# [366. Find Leaves of Binary Tree 🔒](https://leetcode.com/problems/find-leaves-of-binary-tree) [中文文档](/solution/0300-0399/0366.Find%20Leaves%20of%20Binary%20Tree/README.md) diff --git a/solution/0300-0399/0369.Plus One Linked List/README.md b/solution/0300-0399/0369.Plus One Linked List/README.md index f1a25f5dd73de..6451954642d8e 100644 --- a/solution/0300-0399/0369.Plus One Linked List/README.md +++ b/solution/0300-0399/0369.Plus One Linked List/README.md @@ -1,4 +1,4 @@ -# [369. 给单链表加一](https://leetcode.cn/problems/plus-one-linked-list) +# [369. 给单链表加一 🔒](https://leetcode.cn/problems/plus-one-linked-list) [English Version](/solution/0300-0399/0369.Plus%20One%20Linked%20List/README_EN.md) diff --git a/solution/0300-0399/0369.Plus One Linked List/README_EN.md b/solution/0300-0399/0369.Plus One Linked List/README_EN.md index 0b79fa3bb479d..b21003dc1c8f0 100644 --- a/solution/0300-0399/0369.Plus One Linked List/README_EN.md +++ b/solution/0300-0399/0369.Plus One Linked List/README_EN.md @@ -1,4 +1,4 @@ -# [369. Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list) +# [369. Plus One Linked List 🔒](https://leetcode.com/problems/plus-one-linked-list) [中文文档](/solution/0300-0399/0369.Plus%20One%20Linked%20List/README.md) diff --git a/solution/0300-0399/0370.Range Addition/README.md b/solution/0300-0399/0370.Range Addition/README.md index a3b047f84c51a..448681ab33278 100644 --- a/solution/0300-0399/0370.Range Addition/README.md +++ b/solution/0300-0399/0370.Range Addition/README.md @@ -1,4 +1,4 @@ -# [370. 区间加法](https://leetcode.cn/problems/range-addition) +# [370. 区间加法 🔒](https://leetcode.cn/problems/range-addition) [English Version](/solution/0300-0399/0370.Range%20Addition/README_EN.md) diff --git a/solution/0300-0399/0370.Range Addition/README_EN.md b/solution/0300-0399/0370.Range Addition/README_EN.md index 25df7c3fe11cd..d173d514f01ff 100644 --- a/solution/0300-0399/0370.Range Addition/README_EN.md +++ b/solution/0300-0399/0370.Range Addition/README_EN.md @@ -1,4 +1,4 @@ -# [370. Range Addition](https://leetcode.com/problems/range-addition) +# [370. Range Addition 🔒](https://leetcode.com/problems/range-addition) [中文文档](/solution/0300-0399/0370.Range%20Addition/README.md) diff --git a/solution/0300-0399/0379.Design Phone Directory/README.md b/solution/0300-0399/0379.Design Phone Directory/README.md index 18d1518fe758a..d80f3e9aaec14 100644 --- a/solution/0300-0399/0379.Design Phone Directory/README.md +++ b/solution/0300-0399/0379.Design Phone Directory/README.md @@ -1,4 +1,4 @@ -# [379. 电话目录管理系统](https://leetcode.cn/problems/design-phone-directory) +# [379. 电话目录管理系统 🔒](https://leetcode.cn/problems/design-phone-directory) [English Version](/solution/0300-0399/0379.Design%20Phone%20Directory/README_EN.md) diff --git a/solution/0300-0399/0379.Design Phone Directory/README_EN.md b/solution/0300-0399/0379.Design Phone Directory/README_EN.md index a8bff76b2992b..84b415c02d24a 100644 --- a/solution/0300-0399/0379.Design Phone Directory/README_EN.md +++ b/solution/0300-0399/0379.Design Phone Directory/README_EN.md @@ -1,4 +1,4 @@ -# [379. Design Phone Directory](https://leetcode.com/problems/design-phone-directory) +# [379. Design Phone Directory 🔒](https://leetcode.com/problems/design-phone-directory) [中文文档](/solution/0300-0399/0379.Design%20Phone%20Directory/README.md) diff --git a/solution/0400-0499/0408.Valid Word Abbreviation/README.md b/solution/0400-0499/0408.Valid Word Abbreviation/README.md index 9a6033751255e..5142c77dc5541 100644 --- a/solution/0400-0499/0408.Valid Word Abbreviation/README.md +++ b/solution/0400-0499/0408.Valid Word Abbreviation/README.md @@ -1,4 +1,4 @@ -# [408. 有效单词缩写](https://leetcode.cn/problems/valid-word-abbreviation) +# [408. 有效单词缩写 🔒](https://leetcode.cn/problems/valid-word-abbreviation) [English Version](/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README_EN.md) diff --git a/solution/0400-0499/0408.Valid Word Abbreviation/README_EN.md b/solution/0400-0499/0408.Valid Word Abbreviation/README_EN.md index 44da8fde1031d..bd91be0306478 100644 --- a/solution/0400-0499/0408.Valid Word Abbreviation/README_EN.md +++ b/solution/0400-0499/0408.Valid Word Abbreviation/README_EN.md @@ -1,4 +1,4 @@ -# [408. Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation) +# [408. Valid Word Abbreviation 🔒](https://leetcode.com/problems/valid-word-abbreviation) [中文文档](/solution/0400-0499/0408.Valid%20Word%20Abbreviation/README.md) diff --git a/solution/0400-0499/0411.Minimum Unique Word Abbreviation/README.md b/solution/0400-0499/0411.Minimum Unique Word Abbreviation/README.md index 5b0ef11365f5d..b0c7f3fa1e361 100644 --- a/solution/0400-0499/0411.Minimum Unique Word Abbreviation/README.md +++ b/solution/0400-0499/0411.Minimum Unique Word Abbreviation/README.md @@ -1,4 +1,4 @@ -# [411. 最短独占单词缩写](https://leetcode.cn/problems/minimum-unique-word-abbreviation) +# [411. 最短独占单词缩写 🔒](https://leetcode.cn/problems/minimum-unique-word-abbreviation) [English Version](/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README_EN.md) diff --git a/solution/0400-0499/0411.Minimum Unique Word Abbreviation/README_EN.md b/solution/0400-0499/0411.Minimum Unique Word Abbreviation/README_EN.md index 6a9c57d5374fd..4c08d86f41692 100644 --- a/solution/0400-0499/0411.Minimum Unique Word Abbreviation/README_EN.md +++ b/solution/0400-0499/0411.Minimum Unique Word Abbreviation/README_EN.md @@ -1,4 +1,4 @@ -# [411. Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation) +# [411. Minimum Unique Word Abbreviation 🔒](https://leetcode.com/problems/minimum-unique-word-abbreviation) [中文文档](/solution/0400-0499/0411.Minimum%20Unique%20Word%20Abbreviation/README.md) diff --git a/solution/0400-0499/0418.Sentence Screen Fitting/README.md b/solution/0400-0499/0418.Sentence Screen Fitting/README.md index 69b4a04fe9f97..65920650e26e2 100644 --- a/solution/0400-0499/0418.Sentence Screen Fitting/README.md +++ b/solution/0400-0499/0418.Sentence Screen Fitting/README.md @@ -1,4 +1,4 @@ -# [418. 屏幕可显示句子的数量](https://leetcode.cn/problems/sentence-screen-fitting) +# [418. 屏幕可显示句子的数量 🔒](https://leetcode.cn/problems/sentence-screen-fitting) [English Version](/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README_EN.md) diff --git a/solution/0400-0499/0418.Sentence Screen Fitting/README_EN.md b/solution/0400-0499/0418.Sentence Screen Fitting/README_EN.md index 6f9e7ae0769c6..ceefa3986fd9e 100644 --- a/solution/0400-0499/0418.Sentence Screen Fitting/README_EN.md +++ b/solution/0400-0499/0418.Sentence Screen Fitting/README_EN.md @@ -1,4 +1,4 @@ -# [418. Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting) +# [418. Sentence Screen Fitting 🔒](https://leetcode.com/problems/sentence-screen-fitting) [中文文档](/solution/0400-0499/0418.Sentence%20Screen%20Fitting/README.md) diff --git a/solution/0400-0499/0422.Valid Word Square/README.md b/solution/0400-0499/0422.Valid Word Square/README.md index 55bf870f30878..68a3c49196f1f 100644 --- a/solution/0400-0499/0422.Valid Word Square/README.md +++ b/solution/0400-0499/0422.Valid Word Square/README.md @@ -1,4 +1,4 @@ -# [422. 有效的单词方块](https://leetcode.cn/problems/valid-word-square) +# [422. 有效的单词方块 🔒](https://leetcode.cn/problems/valid-word-square) [English Version](/solution/0400-0499/0422.Valid%20Word%20Square/README_EN.md) diff --git a/solution/0400-0499/0422.Valid Word Square/README_EN.md b/solution/0400-0499/0422.Valid Word Square/README_EN.md index fcb3c84046b5f..1360982114f90 100644 --- a/solution/0400-0499/0422.Valid Word Square/README_EN.md +++ b/solution/0400-0499/0422.Valid Word Square/README_EN.md @@ -1,4 +1,4 @@ -# [422. Valid Word Square](https://leetcode.com/problems/valid-word-square) +# [422. Valid Word Square 🔒](https://leetcode.com/problems/valid-word-square) [中文文档](/solution/0400-0499/0422.Valid%20Word%20Square/README.md) diff --git a/solution/0400-0499/0425.Word Squares/README.md b/solution/0400-0499/0425.Word Squares/README.md index 44dbc32841ab2..f6c6540b8ffe8 100644 --- a/solution/0400-0499/0425.Word Squares/README.md +++ b/solution/0400-0499/0425.Word Squares/README.md @@ -1,4 +1,4 @@ -# [425. 单词方块](https://leetcode.cn/problems/word-squares) +# [425. 单词方块 🔒](https://leetcode.cn/problems/word-squares) [English Version](/solution/0400-0499/0425.Word%20Squares/README_EN.md) diff --git a/solution/0400-0499/0425.Word Squares/README_EN.md b/solution/0400-0499/0425.Word Squares/README_EN.md index 6154b63b4464d..affdb62dc2cdb 100644 --- a/solution/0400-0499/0425.Word Squares/README_EN.md +++ b/solution/0400-0499/0425.Word Squares/README_EN.md @@ -1,4 +1,4 @@ -# [425. Word Squares](https://leetcode.com/problems/word-squares) +# [425. Word Squares 🔒](https://leetcode.com/problems/word-squares) [中文文档](/solution/0400-0499/0425.Word%20Squares/README.md) diff --git a/solution/0400-0499/0426.Convert Binary Search Tree to Sorted Doubly Linked List/README.md b/solution/0400-0499/0426.Convert Binary Search Tree to Sorted Doubly Linked List/README.md index 046b5a2cf8ba8..64b998591e73d 100644 --- a/solution/0400-0499/0426.Convert Binary Search Tree to Sorted Doubly Linked List/README.md +++ b/solution/0400-0499/0426.Convert Binary Search Tree to Sorted Doubly Linked List/README.md @@ -1,4 +1,4 @@ -# [426. 将二叉搜索树转化为排序的双向链表](https://leetcode.cn/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) +# [426. 将二叉搜索树转化为排序的双向链表 🔒](https://leetcode.cn/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) [English Version](/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README_EN.md) diff --git a/solution/0400-0499/0426.Convert Binary Search Tree to Sorted Doubly Linked List/README_EN.md b/solution/0400-0499/0426.Convert Binary Search Tree to Sorted Doubly Linked List/README_EN.md index 2cbbea53fde56..b5abe76b8ed11 100644 --- a/solution/0400-0499/0426.Convert Binary Search Tree to Sorted Doubly Linked List/README_EN.md +++ b/solution/0400-0499/0426.Convert Binary Search Tree to Sorted Doubly Linked List/README_EN.md @@ -1,4 +1,4 @@ -# [426. Convert Binary Search Tree to Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) +# [426. Convert Binary Search Tree to Sorted Doubly Linked List 🔒](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) [中文文档](/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README.md) diff --git a/solution/0400-0499/0428.Serialize and Deserialize N-ary Tree/README.md b/solution/0400-0499/0428.Serialize and Deserialize N-ary Tree/README.md index b45b5ba7c3710..d364be60ee939 100644 --- a/solution/0400-0499/0428.Serialize and Deserialize N-ary Tree/README.md +++ b/solution/0400-0499/0428.Serialize and Deserialize N-ary Tree/README.md @@ -1,4 +1,4 @@ -# [428. 序列化和反序列化 N 叉树](https://leetcode.cn/problems/serialize-and-deserialize-n-ary-tree) +# [428. 序列化和反序列化 N 叉树 🔒](https://leetcode.cn/problems/serialize-and-deserialize-n-ary-tree) [English Version](/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/README_EN.md) diff --git a/solution/0400-0499/0428.Serialize and Deserialize N-ary Tree/README_EN.md b/solution/0400-0499/0428.Serialize and Deserialize N-ary Tree/README_EN.md index 00e5c54df1fdc..c9677875c7c35 100644 --- a/solution/0400-0499/0428.Serialize and Deserialize N-ary Tree/README_EN.md +++ b/solution/0400-0499/0428.Serialize and Deserialize N-ary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [428. Serialize and Deserialize N-ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) +# [428. Serialize and Deserialize N-ary Tree 🔒](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree) [中文文档](/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/README.md) diff --git a/solution/0400-0499/0431.Encode N-ary Tree to Binary Tree/README.md b/solution/0400-0499/0431.Encode N-ary Tree to Binary Tree/README.md index ff7b81988373b..535785336ab9b 100644 --- a/solution/0400-0499/0431.Encode N-ary Tree to Binary Tree/README.md +++ b/solution/0400-0499/0431.Encode N-ary Tree to Binary Tree/README.md @@ -1,4 +1,4 @@ -# [431. 将 N 叉树编码为二叉树](https://leetcode.cn/problems/encode-n-ary-tree-to-binary-tree) +# [431. 将 N 叉树编码为二叉树 🔒](https://leetcode.cn/problems/encode-n-ary-tree-to-binary-tree) [English Version](/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/README_EN.md) diff --git a/solution/0400-0499/0431.Encode N-ary Tree to Binary Tree/README_EN.md b/solution/0400-0499/0431.Encode N-ary Tree to Binary Tree/README_EN.md index 498ba9e2d8520..428511242f34a 100644 --- a/solution/0400-0499/0431.Encode N-ary Tree to Binary Tree/README_EN.md +++ b/solution/0400-0499/0431.Encode N-ary Tree to Binary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [431. Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) +# [431. Encode N-ary Tree to Binary Tree 🔒](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree) [中文文档](/solution/0400-0499/0431.Encode%20N-ary%20Tree%20to%20Binary%20Tree/README.md) diff --git a/solution/0400-0499/0439.Ternary Expression Parser/README.md b/solution/0400-0499/0439.Ternary Expression Parser/README.md index 114e317f4bfc3..a52b3a2b718a1 100644 --- a/solution/0400-0499/0439.Ternary Expression Parser/README.md +++ b/solution/0400-0499/0439.Ternary Expression Parser/README.md @@ -1,4 +1,4 @@ -# [439. 三元表达式解析器](https://leetcode.cn/problems/ternary-expression-parser) +# [439. 三元表达式解析器 🔒](https://leetcode.cn/problems/ternary-expression-parser) [English Version](/solution/0400-0499/0439.Ternary%20Expression%20Parser/README_EN.md) diff --git a/solution/0400-0499/0439.Ternary Expression Parser/README_EN.md b/solution/0400-0499/0439.Ternary Expression Parser/README_EN.md index 97388f60f0fab..1ffa3d90d90d6 100644 --- a/solution/0400-0499/0439.Ternary Expression Parser/README_EN.md +++ b/solution/0400-0499/0439.Ternary Expression Parser/README_EN.md @@ -1,4 +1,4 @@ -# [439. Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser) +# [439. Ternary Expression Parser 🔒](https://leetcode.com/problems/ternary-expression-parser) [中文文档](/solution/0400-0499/0439.Ternary%20Expression%20Parser/README.md) diff --git a/solution/0400-0499/0444.Sequence Reconstruction/README.md b/solution/0400-0499/0444.Sequence Reconstruction/README.md index bd6d9adb5d854..5cad725d4f9d5 100644 --- a/solution/0400-0499/0444.Sequence Reconstruction/README.md +++ b/solution/0400-0499/0444.Sequence Reconstruction/README.md @@ -1,4 +1,4 @@ -# [444. 序列重建](https://leetcode.cn/problems/sequence-reconstruction) +# [444. 序列重建 🔒](https://leetcode.cn/problems/sequence-reconstruction) [English Version](/solution/0400-0499/0444.Sequence%20Reconstruction/README_EN.md) diff --git a/solution/0400-0499/0444.Sequence Reconstruction/README_EN.md b/solution/0400-0499/0444.Sequence Reconstruction/README_EN.md index 30fb36d1be8d7..4b94532b106f1 100644 --- a/solution/0400-0499/0444.Sequence Reconstruction/README_EN.md +++ b/solution/0400-0499/0444.Sequence Reconstruction/README_EN.md @@ -1,4 +1,4 @@ -# [444. Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction) +# [444. Sequence Reconstruction 🔒](https://leetcode.com/problems/sequence-reconstruction) [中文文档](/solution/0400-0499/0444.Sequence%20Reconstruction/README.md) diff --git a/solution/0400-0499/0465.Optimal Account Balancing/README.md b/solution/0400-0499/0465.Optimal Account Balancing/README.md index e51484a7fc2c8..afc1386e8f67c 100644 --- a/solution/0400-0499/0465.Optimal Account Balancing/README.md +++ b/solution/0400-0499/0465.Optimal Account Balancing/README.md @@ -1,4 +1,4 @@ -# [465. 最优账单平衡](https://leetcode.cn/problems/optimal-account-balancing) +# [465. 最优账单平衡 🔒](https://leetcode.cn/problems/optimal-account-balancing) [English Version](/solution/0400-0499/0465.Optimal%20Account%20Balancing/README_EN.md) diff --git a/solution/0400-0499/0465.Optimal Account Balancing/README_EN.md b/solution/0400-0499/0465.Optimal Account Balancing/README_EN.md index 4ceb978615bf8..174e55835f7a0 100644 --- a/solution/0400-0499/0465.Optimal Account Balancing/README_EN.md +++ b/solution/0400-0499/0465.Optimal Account Balancing/README_EN.md @@ -1,4 +1,4 @@ -# [465. Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing) +# [465. Optimal Account Balancing 🔒](https://leetcode.com/problems/optimal-account-balancing) [中文文档](/solution/0400-0499/0465.Optimal%20Account%20Balancing/README.md) diff --git a/solution/0400-0499/0469.Convex Polygon/README.md b/solution/0400-0499/0469.Convex Polygon/README.md index 11af91772e738..6cf3b1a97c3f7 100644 --- a/solution/0400-0499/0469.Convex Polygon/README.md +++ b/solution/0400-0499/0469.Convex Polygon/README.md @@ -1,4 +1,4 @@ -# [469. 凸多边形](https://leetcode.cn/problems/convex-polygon) +# [469. 凸多边形 🔒](https://leetcode.cn/problems/convex-polygon) [English Version](/solution/0400-0499/0469.Convex%20Polygon/README_EN.md) @@ -49,9 +49,9 @@ ### 方法一：数学（向量叉积） -假设当前连续的三个顶点分别为 $p_1, p_2, p_3$，我们可以计算向量 $\overrightarrow{p_1p_2}$ 和 $\overrightarrow{p_1p_3}$ 的叉积，记为 $cur$。如果 $cur$ 的方向与之前的 $pre$ 方向不一致，说明多边形不是凸多边形。否则，我们更新 $pre = cur$，继续遍历下一个顶点。 +假设当前连续的三个顶点分别为 $p_1, p_2, p_3$，我们可以计算向量 $\overrightarrow{p_1p_2}$ 和 $\overrightarrow{p_1p_3}$ 的叉积，记为 $cur$。如果 $cur$ 的方向与之前的 $pre$ 方向不一致，说明多边形不是凸多边形 🔒。否则，我们更新 $pre = cur$，继续遍历下一个顶点。 -遍历结束，如果没有发现不一致的情况，说明多边形是凸多边形。 +遍历结束，如果没有发现不一致的情况，说明多边形是凸多边形 🔒。 时间复杂度 $O(n)$，其中 $n$ 是顶点的数量。空间复杂度 $O(1)$。 diff --git a/solution/0400-0499/0469.Convex Polygon/README_EN.md b/solution/0400-0499/0469.Convex Polygon/README_EN.md index fba43d54c4582..467af45f4c3ce 100644 --- a/solution/0400-0499/0469.Convex Polygon/README_EN.md +++ b/solution/0400-0499/0469.Convex Polygon/README_EN.md @@ -1,4 +1,4 @@ -# [469. Convex Polygon](https://leetcode.com/problems/convex-polygon) +# [469. Convex Polygon 🔒](https://leetcode.com/problems/convex-polygon) [中文文档](/solution/0400-0499/0469.Convex%20Polygon/README.md) diff --git a/solution/0400-0499/0471.Encode String with Shortest Length/README.md b/solution/0400-0499/0471.Encode String with Shortest Length/README.md index 1f6a096277b1c..ae5c5bf7cd2b5 100644 --- a/solution/0400-0499/0471.Encode String with Shortest Length/README.md +++ b/solution/0400-0499/0471.Encode String with Shortest Length/README.md @@ -1,4 +1,4 @@ -# [471. 编码最短长度的字符串](https://leetcode.cn/problems/encode-string-with-shortest-length) +# [471. 编码最短长度的字符串 🔒](https://leetcode.cn/problems/encode-string-with-shortest-length) [English Version](/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README_EN.md) diff --git a/solution/0400-0499/0471.Encode String with Shortest Length/README_EN.md b/solution/0400-0499/0471.Encode String with Shortest Length/README_EN.md index efeefa269b883..c51d6316ace70 100644 --- a/solution/0400-0499/0471.Encode String with Shortest Length/README_EN.md +++ b/solution/0400-0499/0471.Encode String with Shortest Length/README_EN.md @@ -1,4 +1,4 @@ -# [471. Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length) +# [471. Encode String with Shortest Length 🔒](https://leetcode.com/problems/encode-string-with-shortest-length) [中文文档](/solution/0400-0499/0471.Encode%20String%20with%20Shortest%20Length/README.md) diff --git a/solution/0400-0499/0484.Find Permutation/README.md b/solution/0400-0499/0484.Find Permutation/README.md index 6e73969be4231..379797828f4a0 100644 --- a/solution/0400-0499/0484.Find Permutation/README.md +++ b/solution/0400-0499/0484.Find Permutation/README.md @@ -1,4 +1,4 @@ -# [484. 寻找排列](https://leetcode.cn/problems/find-permutation) +# [484. 寻找排列 🔒](https://leetcode.cn/problems/find-permutation) [English Version](/solution/0400-0499/0484.Find%20Permutation/README_EN.md) diff --git a/solution/0400-0499/0484.Find Permutation/README_EN.md b/solution/0400-0499/0484.Find Permutation/README_EN.md index 82f7fababe8c8..062cac78eb5c3 100644 --- a/solution/0400-0499/0484.Find Permutation/README_EN.md +++ b/solution/0400-0499/0484.Find Permutation/README_EN.md @@ -1,4 +1,4 @@ -# [484. Find Permutation](https://leetcode.com/problems/find-permutation) +# [484. Find Permutation 🔒](https://leetcode.com/problems/find-permutation) [中文文档](/solution/0400-0499/0484.Find%20Permutation/README.md) diff --git a/solution/0400-0499/0487.Max Consecutive Ones II/README.md b/solution/0400-0499/0487.Max Consecutive Ones II/README.md index 55a968e5769be..e4b14d5ce0355 100644 --- a/solution/0400-0499/0487.Max Consecutive Ones II/README.md +++ b/solution/0400-0499/0487.Max Consecutive Ones II/README.md @@ -1,4 +1,4 @@ -# [487. 最大连续 1 的个数 II](https://leetcode.cn/problems/max-consecutive-ones-ii) +# [487. 最大连续 1 的个数 II 🔒](https://leetcode.cn/problems/max-consecutive-ones-ii) [English Version](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README_EN.md) @@ -192,7 +192,7 @@ func findMaxConsecutiveOnes(nums []int) int { 相似题目： -- [1004. 最大连续 1 的个数 III](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md) +- [1004. 最大连续 1 的个数 II 🔒I](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md) 以下是滑动窗口的优化版本。 diff --git a/solution/0400-0499/0487.Max Consecutive Ones II/README_EN.md b/solution/0400-0499/0487.Max Consecutive Ones II/README_EN.md index 176e54dd9a8fc..77953f950c332 100644 --- a/solution/0400-0499/0487.Max Consecutive Ones II/README_EN.md +++ b/solution/0400-0499/0487.Max Consecutive Ones II/README_EN.md @@ -1,4 +1,4 @@ -# [487. Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii) +# [487. Max Consecutive Ones II 🔒](https://leetcode.com/problems/max-consecutive-ones-ii) [中文文档](/solution/0400-0499/0487.Max%20Consecutive%20Ones%20II/README.md) diff --git a/solution/0400-0499/0489.Robot Room Cleaner/README.md b/solution/0400-0499/0489.Robot Room Cleaner/README.md index 4a20b7857db64..f2a9f27a45333 100644 --- a/solution/0400-0499/0489.Robot Room Cleaner/README.md +++ b/solution/0400-0499/0489.Robot Room Cleaner/README.md @@ -1,4 +1,4 @@ -# [489. 扫地机器人](https://leetcode.cn/problems/robot-room-cleaner) +# [489. 扫地机器人 🔒](https://leetcode.cn/problems/robot-room-cleaner) [English Version](/solution/0400-0499/0489.Robot%20Room%20Cleaner/README_EN.md) diff --git a/solution/0400-0499/0489.Robot Room Cleaner/README_EN.md b/solution/0400-0499/0489.Robot Room Cleaner/README_EN.md index 97f200673c7e1..903a652242b59 100644 --- a/solution/0400-0499/0489.Robot Room Cleaner/README_EN.md +++ b/solution/0400-0499/0489.Robot Room Cleaner/README_EN.md @@ -1,4 +1,4 @@ -# [489. Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner) +# [489. Robot Room Cleaner 🔒](https://leetcode.com/problems/robot-room-cleaner) [中文文档](/solution/0400-0499/0489.Robot%20Room%20Cleaner/README.md) diff --git a/solution/0400-0499/0490.The Maze/README.md b/solution/0400-0499/0490.The Maze/README.md index 415382d62016c..046fb99c6bdc9 100644 --- a/solution/0400-0499/0490.The Maze/README.md +++ b/solution/0400-0499/0490.The Maze/README.md @@ -1,4 +1,4 @@ -# [490. 迷宫](https://leetcode.cn/problems/the-maze) +# [490. 迷宫 🔒](https://leetcode.cn/problems/the-maze) [English Version](/solution/0400-0499/0490.The%20Maze/README_EN.md) diff --git a/solution/0400-0499/0490.The Maze/README_EN.md b/solution/0400-0499/0490.The Maze/README_EN.md index 4376118480084..e99eb703bd1ca 100644 --- a/solution/0400-0499/0490.The Maze/README_EN.md +++ b/solution/0400-0499/0490.The Maze/README_EN.md @@ -1,4 +1,4 @@ -# [490. The Maze](https://leetcode.com/problems/the-maze) +# [490. The Maze 🔒](https://leetcode.com/problems/the-maze) [中文文档](/solution/0400-0499/0490.The%20Maze/README.md) diff --git a/solution/0400-0499/0499.The Maze III/README.md b/solution/0400-0499/0499.The Maze III/README.md index 8a3a9502cfcc8..4d536e9c48d49 100644 --- a/solution/0400-0499/0499.The Maze III/README.md +++ b/solution/0400-0499/0499.The Maze III/README.md @@ -1,4 +1,4 @@ -# [499. 迷宫 III](https://leetcode.cn/problems/the-maze-iii) +# [499. 迷宫 III 🔒](https://leetcode.cn/problems/the-maze-iii) [English Version](/solution/0400-0499/0499.The%20Maze%20III/README_EN.md) diff --git a/solution/0400-0499/0499.The Maze III/README_EN.md b/solution/0400-0499/0499.The Maze III/README_EN.md index 671cc5207655a..7a025ea34bc01 100644 --- a/solution/0400-0499/0499.The Maze III/README_EN.md +++ b/solution/0400-0499/0499.The Maze III/README_EN.md @@ -1,4 +1,4 @@ -# [499. The Maze III](https://leetcode.com/problems/the-maze-iii) +# [499. The Maze III 🔒](https://leetcode.com/problems/the-maze-iii) [中文文档](/solution/0400-0499/0499.The%20Maze%20III/README.md) diff --git a/solution/0500-0599/0505.The Maze II/README.md b/solution/0500-0599/0505.The Maze II/README.md index fde770859b6e6..29ff5d916e5df 100644 --- a/solution/0500-0599/0505.The Maze II/README.md +++ b/solution/0500-0599/0505.The Maze II/README.md @@ -1,4 +1,4 @@ -# [505. 迷宫 II](https://leetcode.cn/problems/the-maze-ii) +# [505. 迷宫 II 🔒](https://leetcode.cn/problems/the-maze-ii) [English Version](/solution/0500-0599/0505.The%20Maze%20II/README_EN.md) diff --git a/solution/0500-0599/0505.The Maze II/README_EN.md b/solution/0500-0599/0505.The Maze II/README_EN.md index 8381d4aa91b68..22168990e9add 100644 --- a/solution/0500-0599/0505.The Maze II/README_EN.md +++ b/solution/0500-0599/0505.The Maze II/README_EN.md @@ -1,4 +1,4 @@ -# [505. The Maze II](https://leetcode.com/problems/the-maze-ii) +# [505. The Maze II 🔒](https://leetcode.com/problems/the-maze-ii) [中文文档](/solution/0500-0599/0505.The%20Maze%20II/README.md) diff --git a/solution/0500-0599/0510.Inorder Successor in BST II/README.md b/solution/0500-0599/0510.Inorder Successor in BST II/README.md index 60d196526de73..50e6329f28507 100644 --- a/solution/0500-0599/0510.Inorder Successor in BST II/README.md +++ b/solution/0500-0599/0510.Inorder Successor in BST II/README.md @@ -1,4 +1,4 @@ -# [510. 二叉搜索树中的中序后继 II](https://leetcode.cn/problems/inorder-successor-in-bst-ii) +# [510. 二叉搜索树中的中序后继 II 🔒](https://leetcode.cn/problems/inorder-successor-in-bst-ii) [English Version](/solution/0500-0599/0510.Inorder%20Successor%20in%20BST%20II/README_EN.md) diff --git a/solution/0500-0599/0510.Inorder Successor in BST II/README_EN.md b/solution/0500-0599/0510.Inorder Successor in BST II/README_EN.md index 36841902cbafb..a478900c6d1f8 100644 --- a/solution/0500-0599/0510.Inorder Successor in BST II/README_EN.md +++ b/solution/0500-0599/0510.Inorder Successor in BST II/README_EN.md @@ -1,4 +1,4 @@ -# [510. Inorder Successor in BST II](https://leetcode.com/problems/inorder-successor-in-bst-ii) +# [510. Inorder Successor in BST II 🔒](https://leetcode.com/problems/inorder-successor-in-bst-ii) [中文文档](/solution/0500-0599/0510.Inorder%20Successor%20in%20BST%20II/README.md) diff --git a/solution/0500-0599/0512.Game Play Analysis II/README.md b/solution/0500-0599/0512.Game Play Analysis II/README.md index 22a34800260b8..b75256771ef84 100644 --- a/solution/0500-0599/0512.Game Play Analysis II/README.md +++ b/solution/0500-0599/0512.Game Play Analysis II/README.md @@ -1,4 +1,4 @@ -# [512. 游戏玩法分析 II](https://leetcode.cn/problems/game-play-analysis-ii) +# [512. 游戏玩法分析 II 🔒](https://leetcode.cn/problems/game-play-analysis-ii) [English Version](/solution/0500-0599/0512.Game%20Play%20Analysis%20II/README_EN.md) diff --git a/solution/0500-0599/0512.Game Play Analysis II/README_EN.md b/solution/0500-0599/0512.Game Play Analysis II/README_EN.md index 7832edbbe3450..057a674be3ebf 100644 --- a/solution/0500-0599/0512.Game Play Analysis II/README_EN.md +++ b/solution/0500-0599/0512.Game Play Analysis II/README_EN.md @@ -1,4 +1,4 @@ -# [512. Game Play Analysis II](https://leetcode.com/problems/game-play-analysis-ii) +# [512. Game Play Analysis II 🔒](https://leetcode.com/problems/game-play-analysis-ii) [中文文档](/solution/0500-0599/0512.Game%20Play%20Analysis%20II/README.md) diff --git a/solution/0500-0599/0527.Word Abbreviation/README.md b/solution/0500-0599/0527.Word Abbreviation/README.md index 29f1bb318c24e..ea496089e28ea 100644 --- a/solution/0500-0599/0527.Word Abbreviation/README.md +++ b/solution/0500-0599/0527.Word Abbreviation/README.md @@ -1,4 +1,4 @@ -# [527. 单词缩写](https://leetcode.cn/problems/word-abbreviation) +# [527. 单词缩写 🔒](https://leetcode.cn/problems/word-abbreviation) [English Version](/solution/0500-0599/0527.Word%20Abbreviation/README_EN.md) diff --git a/solution/0500-0599/0527.Word Abbreviation/README_EN.md b/solution/0500-0599/0527.Word Abbreviation/README_EN.md index 33c3e8b0ed0bb..f9184e45fccb9 100644 --- a/solution/0500-0599/0527.Word Abbreviation/README_EN.md +++ b/solution/0500-0599/0527.Word Abbreviation/README_EN.md @@ -1,4 +1,4 @@ -# [527. Word Abbreviation](https://leetcode.com/problems/word-abbreviation) +# [527. Word Abbreviation 🔒](https://leetcode.com/problems/word-abbreviation) [中文文档](/solution/0500-0599/0527.Word%20Abbreviation/README.md) diff --git a/solution/0500-0599/0531.Lonely Pixel I/README.md b/solution/0500-0599/0531.Lonely Pixel I/README.md index 326916f4073cd..0ccc0209665c8 100644 --- a/solution/0500-0599/0531.Lonely Pixel I/README.md +++ b/solution/0500-0599/0531.Lonely Pixel I/README.md @@ -1,4 +1,4 @@ -# [531. 孤独像素 I](https://leetcode.cn/problems/lonely-pixel-i) +# [531. 孤独像素 I 🔒](https://leetcode.cn/problems/lonely-pixel-i) [English Version](/solution/0500-0599/0531.Lonely%20Pixel%20I/README_EN.md) diff --git a/solution/0500-0599/0531.Lonely Pixel I/README_EN.md b/solution/0500-0599/0531.Lonely Pixel I/README_EN.md index 428668da7c7fe..14e621dc3589f 100644 --- a/solution/0500-0599/0531.Lonely Pixel I/README_EN.md +++ b/solution/0500-0599/0531.Lonely Pixel I/README_EN.md @@ -1,4 +1,4 @@ -# [531. Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i) +# [531. Lonely Pixel I 🔒](https://leetcode.com/problems/lonely-pixel-i) [中文文档](/solution/0500-0599/0531.Lonely%20Pixel%20I/README.md) diff --git a/solution/0500-0599/0533.Lonely Pixel II/README.md b/solution/0500-0599/0533.Lonely Pixel II/README.md index 489f71ecf2904..09d7cf3d3aba6 100644 --- a/solution/0500-0599/0533.Lonely Pixel II/README.md +++ b/solution/0500-0599/0533.Lonely Pixel II/README.md @@ -1,4 +1,4 @@ -# [533. 孤独像素 II](https://leetcode.cn/problems/lonely-pixel-ii) +# [533. 孤独像素 II 🔒](https://leetcode.cn/problems/lonely-pixel-ii) [English Version](/solution/0500-0599/0533.Lonely%20Pixel%20II/README_EN.md) diff --git a/solution/0500-0599/0533.Lonely Pixel II/README_EN.md b/solution/0500-0599/0533.Lonely Pixel II/README_EN.md index 606c4ebc2f4e2..7dc8da6dbcc80 100644 --- a/solution/0500-0599/0533.Lonely Pixel II/README_EN.md +++ b/solution/0500-0599/0533.Lonely Pixel II/README_EN.md @@ -1,4 +1,4 @@ -# [533. Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii) +# [533. Lonely Pixel II 🔒](https://leetcode.com/problems/lonely-pixel-ii) [中文文档](/solution/0500-0599/0533.Lonely%20Pixel%20II/README.md) diff --git a/solution/0500-0599/0534.Game Play Analysis III/README.md b/solution/0500-0599/0534.Game Play Analysis III/README.md index 6fef32d229524..bd831d47dc1a3 100644 --- a/solution/0500-0599/0534.Game Play Analysis III/README.md +++ b/solution/0500-0599/0534.Game Play Analysis III/README.md @@ -1,4 +1,4 @@ -# [534. 游戏玩法分析 III](https://leetcode.cn/problems/game-play-analysis-iii) +# [534. 游戏玩法分析 III 🔒](https://leetcode.cn/problems/game-play-analysis-iii) [English Version](/solution/0500-0599/0534.Game%20Play%20Analysis%20III/README_EN.md) diff --git a/solution/0500-0599/0534.Game Play Analysis III/README_EN.md b/solution/0500-0599/0534.Game Play Analysis III/README_EN.md index 7791b9a25091f..22381c489aad6 100644 --- a/solution/0500-0599/0534.Game Play Analysis III/README_EN.md +++ b/solution/0500-0599/0534.Game Play Analysis III/README_EN.md @@ -1,4 +1,4 @@ -# [534. Game Play Analysis III](https://leetcode.com/problems/game-play-analysis-iii) +# [534. Game Play Analysis III 🔒](https://leetcode.com/problems/game-play-analysis-iii) [中文文档](/solution/0500-0599/0534.Game%20Play%20Analysis%20III/README.md) diff --git a/solution/0500-0599/0536.Construct Binary Tree from String/README.md b/solution/0500-0599/0536.Construct Binary Tree from String/README.md index bc7b210343f08..3267436a7e92d 100644 --- a/solution/0500-0599/0536.Construct Binary Tree from String/README.md +++ b/solution/0500-0599/0536.Construct Binary Tree from String/README.md @@ -1,4 +1,4 @@ -# [536. 从字符串生成二叉树](https://leetcode.cn/problems/construct-binary-tree-from-string) +# [536. 从字符串生成二叉树 🔒](https://leetcode.cn/problems/construct-binary-tree-from-string) [English Version](/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README_EN.md) diff --git a/solution/0500-0599/0536.Construct Binary Tree from String/README_EN.md b/solution/0500-0599/0536.Construct Binary Tree from String/README_EN.md index 42d70dc1005a2..2566ac520273c 100644 --- a/solution/0500-0599/0536.Construct Binary Tree from String/README_EN.md +++ b/solution/0500-0599/0536.Construct Binary Tree from String/README_EN.md @@ -1,4 +1,4 @@ -# [536. Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string) +# [536. Construct Binary Tree from String 🔒](https://leetcode.com/problems/construct-binary-tree-from-string) [中文文档](/solution/0500-0599/0536.Construct%20Binary%20Tree%20from%20String/README.md) diff --git a/solution/0500-0599/0544.Output Contest Matches/README.md b/solution/0500-0599/0544.Output Contest Matches/README.md index 4322a1ca0883c..9f2fe5af8cf47 100644 --- a/solution/0500-0599/0544.Output Contest Matches/README.md +++ b/solution/0500-0599/0544.Output Contest Matches/README.md @@ -1,4 +1,4 @@ -# [544. 输出比赛匹配对](https://leetcode.cn/problems/output-contest-matches) +# [544. 输出比赛匹配对 🔒](https://leetcode.cn/problems/output-contest-matches) [English Version](/solution/0500-0599/0544.Output%20Contest%20Matches/README_EN.md) diff --git a/solution/0500-0599/0544.Output Contest Matches/README_EN.md b/solution/0500-0599/0544.Output Contest Matches/README_EN.md index 8aaf8c49da699..c8b01fcb8c896 100644 --- a/solution/0500-0599/0544.Output Contest Matches/README_EN.md +++ b/solution/0500-0599/0544.Output Contest Matches/README_EN.md @@ -1,4 +1,4 @@ -# [544. Output Contest Matches](https://leetcode.com/problems/output-contest-matches) +# [544. Output Contest Matches 🔒](https://leetcode.com/problems/output-contest-matches) [中文文档](/solution/0500-0599/0544.Output%20Contest%20Matches/README.md) diff --git a/solution/0500-0599/0545.Boundary of Binary Tree/README.md b/solution/0500-0599/0545.Boundary of Binary Tree/README.md index ca77de5a5b0ea..d77696b8e4f6f 100644 --- a/solution/0500-0599/0545.Boundary of Binary Tree/README.md +++ b/solution/0500-0599/0545.Boundary of Binary Tree/README.md @@ -1,4 +1,4 @@ -# [545. 二叉树的边界](https://leetcode.cn/problems/boundary-of-binary-tree) +# [545. 二叉树的边界 🔒](https://leetcode.cn/problems/boundary-of-binary-tree) [English Version](/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README_EN.md) diff --git a/solution/0500-0599/0545.Boundary of Binary Tree/README_EN.md b/solution/0500-0599/0545.Boundary of Binary Tree/README_EN.md index 69a24051d13b0..9cf41b2d3d004 100644 --- a/solution/0500-0599/0545.Boundary of Binary Tree/README_EN.md +++ b/solution/0500-0599/0545.Boundary of Binary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [545. Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree) +# [545. Boundary of Binary Tree 🔒](https://leetcode.com/problems/boundary-of-binary-tree) [中文文档](/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README.md) diff --git a/solution/0500-0599/0548.Split Array with Equal Sum/README.md b/solution/0500-0599/0548.Split Array with Equal Sum/README.md index 6e64f35d7a699..963597b923fb9 100644 --- a/solution/0500-0599/0548.Split Array with Equal Sum/README.md +++ b/solution/0500-0599/0548.Split Array with Equal Sum/README.md @@ -1,4 +1,4 @@ -# [548. 将数组分割成和相等的子数组](https://leetcode.cn/problems/split-array-with-equal-sum) +# [548. 将数组分割成和相等的子数组 🔒](https://leetcode.cn/problems/split-array-with-equal-sum) [English Version](/solution/0500-0599/0548.Split%20Array%20with%20Equal%20Sum/README_EN.md) diff --git a/solution/0500-0599/0548.Split Array with Equal Sum/README_EN.md b/solution/0500-0599/0548.Split Array with Equal Sum/README_EN.md index 0b09a79521dd3..739983c61998a 100644 --- a/solution/0500-0599/0548.Split Array with Equal Sum/README_EN.md +++ b/solution/0500-0599/0548.Split Array with Equal Sum/README_EN.md @@ -1,4 +1,4 @@ -# [548. Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum) +# [548. Split Array with Equal Sum 🔒](https://leetcode.com/problems/split-array-with-equal-sum) [中文文档](/solution/0500-0599/0548.Split%20Array%20with%20Equal%20Sum/README.md) diff --git a/solution/0500-0599/0549.Binary Tree Longest Consecutive Sequence II/README.md b/solution/0500-0599/0549.Binary Tree Longest Consecutive Sequence II/README.md index 626958a7204eb..d25733e0c1b80 100644 --- a/solution/0500-0599/0549.Binary Tree Longest Consecutive Sequence II/README.md +++ b/solution/0500-0599/0549.Binary Tree Longest Consecutive Sequence II/README.md @@ -1,4 +1,4 @@ -# [549. 二叉树最长连续序列 II](https://leetcode.cn/problems/binary-tree-longest-consecutive-sequence-ii) +# [549. 二叉树最长连续序列 II 🔒](https://leetcode.cn/problems/binary-tree-longest-consecutive-sequence-ii) [English Version](/solution/0500-0599/0549.Binary%20Tree%20Longest%20Consecutive%20Sequence%20II/README_EN.md) diff --git a/solution/0500-0599/0549.Binary Tree Longest Consecutive Sequence II/README_EN.md b/solution/0500-0599/0549.Binary Tree Longest Consecutive Sequence II/README_EN.md index 97ab2fcd6bce3..f5188860be9e7 100644 --- a/solution/0500-0599/0549.Binary Tree Longest Consecutive Sequence II/README_EN.md +++ b/solution/0500-0599/0549.Binary Tree Longest Consecutive Sequence II/README_EN.md @@ -1,4 +1,4 @@ -# [549. Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) +# [549. Binary Tree Longest Consecutive Sequence II 🔒](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii) [中文文档](/solution/0500-0599/0549.Binary%20Tree%20Longest%20Consecutive%20Sequence%20II/README.md) diff --git a/solution/0500-0599/0555.Split Concatenated Strings/README.md b/solution/0500-0599/0555.Split Concatenated Strings/README.md index 6524c3e2d1f47..cb4398c8c5def 100644 --- a/solution/0500-0599/0555.Split Concatenated Strings/README.md +++ b/solution/0500-0599/0555.Split Concatenated Strings/README.md @@ -1,4 +1,4 @@ -# [555. 分割连接字符串](https://leetcode.cn/problems/split-concatenated-strings) +# [555. 分割连接字符串 🔒](https://leetcode.cn/problems/split-concatenated-strings) [English Version](/solution/0500-0599/0555.Split%20Concatenated%20Strings/README_EN.md) diff --git a/solution/0500-0599/0555.Split Concatenated Strings/README_EN.md b/solution/0500-0599/0555.Split Concatenated Strings/README_EN.md index 043aaaca3c694..62a15f9f2d1c2 100644 --- a/solution/0500-0599/0555.Split Concatenated Strings/README_EN.md +++ b/solution/0500-0599/0555.Split Concatenated Strings/README_EN.md @@ -1,4 +1,4 @@ -# [555. Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings) +# [555. Split Concatenated Strings 🔒](https://leetcode.com/problems/split-concatenated-strings) [中文文档](/solution/0500-0599/0555.Split%20Concatenated%20Strings/README.md) diff --git a/solution/0500-0599/0562.Longest Line of Consecutive One in Matrix/README.md b/solution/0500-0599/0562.Longest Line of Consecutive One in Matrix/README.md index 3b68533105ea2..011b86f4f0331 100644 --- a/solution/0500-0599/0562.Longest Line of Consecutive One in Matrix/README.md +++ b/solution/0500-0599/0562.Longest Line of Consecutive One in Matrix/README.md @@ -1,4 +1,4 @@ -# [562. 矩阵中最长的连续 1 线段](https://leetcode.cn/problems/longest-line-of-consecutive-one-in-matrix) +# [562. 矩阵中最长的连续 1 线段 🔒](https://leetcode.cn/problems/longest-line-of-consecutive-one-in-matrix) [English Version](/solution/0500-0599/0562.Longest%20Line%20of%20Consecutive%20One%20in%20Matrix/README_EN.md) diff --git a/solution/0500-0599/0562.Longest Line of Consecutive One in Matrix/README_EN.md b/solution/0500-0599/0562.Longest Line of Consecutive One in Matrix/README_EN.md index 795f668b33c85..f46721384a6d6 100644 --- a/solution/0500-0599/0562.Longest Line of Consecutive One in Matrix/README_EN.md +++ b/solution/0500-0599/0562.Longest Line of Consecutive One in Matrix/README_EN.md @@ -1,4 +1,4 @@ -# [562. Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) +# [562. Longest Line of Consecutive One in Matrix 🔒](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix) [中文文档](/solution/0500-0599/0562.Longest%20Line%20of%20Consecutive%20One%20in%20Matrix/README.md) diff --git a/solution/0500-0599/0568.Maximum Vacation Days/README.md b/solution/0500-0599/0568.Maximum Vacation Days/README.md index 796a8a6037fc7..5f1692f967c6e 100644 --- a/solution/0500-0599/0568.Maximum Vacation Days/README.md +++ b/solution/0500-0599/0568.Maximum Vacation Days/README.md @@ -1,4 +1,4 @@ -# [568. 最大休假天数](https://leetcode.cn/problems/maximum-vacation-days) +# [568. 最大休假天数 🔒](https://leetcode.cn/problems/maximum-vacation-days) [English Version](/solution/0500-0599/0568.Maximum%20Vacation%20Days/README_EN.md) diff --git a/solution/0500-0599/0568.Maximum Vacation Days/README_EN.md b/solution/0500-0599/0568.Maximum Vacation Days/README_EN.md index ec3e6d2253e7d..b171b3b03af1d 100644 --- a/solution/0500-0599/0568.Maximum Vacation Days/README_EN.md +++ b/solution/0500-0599/0568.Maximum Vacation Days/README_EN.md @@ -1,4 +1,4 @@ -# [568. Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days) +# [568. Maximum Vacation Days 🔒](https://leetcode.com/problems/maximum-vacation-days) [中文文档](/solution/0500-0599/0568.Maximum%20Vacation%20Days/README.md) diff --git a/solution/0500-0599/0569.Median Employee Salary/README.md b/solution/0500-0599/0569.Median Employee Salary/README.md index d0cb08bcbdf8d..50f74d9e74c77 100644 --- a/solution/0500-0599/0569.Median Employee Salary/README.md +++ b/solution/0500-0599/0569.Median Employee Salary/README.md @@ -1,4 +1,4 @@ -# [569. 员工薪水中位数](https://leetcode.cn/problems/median-employee-salary) +# [569. 员工薪水中位数 🔒](https://leetcode.cn/problems/median-employee-salary) [English Version](/solution/0500-0599/0569.Median%20Employee%20Salary/README_EN.md) diff --git a/solution/0500-0599/0569.Median Employee Salary/README_EN.md b/solution/0500-0599/0569.Median Employee Salary/README_EN.md index b27384dc66a9c..6aaf59d613c44 100644 --- a/solution/0500-0599/0569.Median Employee Salary/README_EN.md +++ b/solution/0500-0599/0569.Median Employee Salary/README_EN.md @@ -1,4 +1,4 @@ -# [569. Median Employee Salary](https://leetcode.com/problems/median-employee-salary) +# [569. Median Employee Salary 🔒](https://leetcode.com/problems/median-employee-salary) [中文文档](/solution/0500-0599/0569.Median%20Employee%20Salary/README.md) diff --git a/solution/0500-0599/0571.Find Median Given Frequency of Numbers/README.md b/solution/0500-0599/0571.Find Median Given Frequency of Numbers/README.md index 35c8ff07c233b..15a19b3856ef1 100644 --- a/solution/0500-0599/0571.Find Median Given Frequency of Numbers/README.md +++ b/solution/0500-0599/0571.Find Median Given Frequency of Numbers/README.md @@ -1,4 +1,4 @@ -# [571. 给定数字的频率查询中位数](https://leetcode.cn/problems/find-median-given-frequency-of-numbers) +# [571. 给定数字的频率查询中位数 🔒](https://leetcode.cn/problems/find-median-given-frequency-of-numbers) [English Version](/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README_EN.md) diff --git a/solution/0500-0599/0571.Find Median Given Frequency of Numbers/README_EN.md b/solution/0500-0599/0571.Find Median Given Frequency of Numbers/README_EN.md index 880b939befc38..f57bf4007b068 100644 --- a/solution/0500-0599/0571.Find Median Given Frequency of Numbers/README_EN.md +++ b/solution/0500-0599/0571.Find Median Given Frequency of Numbers/README_EN.md @@ -1,4 +1,4 @@ -# [571. Find Median Given Frequency of Numbers](https://leetcode.com/problems/find-median-given-frequency-of-numbers) +# [571. Find Median Given Frequency of Numbers 🔒](https://leetcode.com/problems/find-median-given-frequency-of-numbers) [中文文档](/solution/0500-0599/0571.Find%20Median%20Given%20Frequency%20of%20Numbers/README.md) diff --git a/solution/0500-0599/0573.Squirrel Simulation/README.md b/solution/0500-0599/0573.Squirrel Simulation/README.md index 26714352a121c..351e9f49b9ede 100644 --- a/solution/0500-0599/0573.Squirrel Simulation/README.md +++ b/solution/0500-0599/0573.Squirrel Simulation/README.md @@ -1,4 +1,4 @@ -# [573. 松鼠模拟](https://leetcode.cn/problems/squirrel-simulation) +# [573. 松鼠模拟 🔒](https://leetcode.cn/problems/squirrel-simulation) [English Version](/solution/0500-0599/0573.Squirrel%20Simulation/README_EN.md) diff --git a/solution/0500-0599/0573.Squirrel Simulation/README_EN.md b/solution/0500-0599/0573.Squirrel Simulation/README_EN.md index 5bf6b3f7edb98..827f90a575a20 100644 --- a/solution/0500-0599/0573.Squirrel Simulation/README_EN.md +++ b/solution/0500-0599/0573.Squirrel Simulation/README_EN.md @@ -1,4 +1,4 @@ -# [573. Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation) +# [573. Squirrel Simulation 🔒](https://leetcode.com/problems/squirrel-simulation) [中文文档](/solution/0500-0599/0573.Squirrel%20Simulation/README.md) diff --git a/solution/0500-0599/0574.Winning Candidate/README.md b/solution/0500-0599/0574.Winning Candidate/README.md index 62129af348029..073d476f6bad5 100644 --- a/solution/0500-0599/0574.Winning Candidate/README.md +++ b/solution/0500-0599/0574.Winning Candidate/README.md @@ -1,4 +1,4 @@ -# [574. 当选者](https://leetcode.cn/problems/winning-candidate) +# [574. 当选者 🔒](https://leetcode.cn/problems/winning-candidate) [English Version](/solution/0500-0599/0574.Winning%20Candidate/README_EN.md) diff --git a/solution/0500-0599/0574.Winning Candidate/README_EN.md b/solution/0500-0599/0574.Winning Candidate/README_EN.md index 791b8ea4fcd9f..e8a0d7336b2a1 100644 --- a/solution/0500-0599/0574.Winning Candidate/README_EN.md +++ b/solution/0500-0599/0574.Winning Candidate/README_EN.md @@ -1,4 +1,4 @@ -# [574. Winning Candidate](https://leetcode.com/problems/winning-candidate) +# [574. Winning Candidate 🔒](https://leetcode.com/problems/winning-candidate) [中文文档](/solution/0500-0599/0574.Winning%20Candidate/README.md) diff --git a/solution/0500-0599/0578.Get Highest Answer Rate Question/README.md b/solution/0500-0599/0578.Get Highest Answer Rate Question/README.md index ca7cc2a8f13a1..f956940139e6f 100644 --- a/solution/0500-0599/0578.Get Highest Answer Rate Question/README.md +++ b/solution/0500-0599/0578.Get Highest Answer Rate Question/README.md @@ -1,4 +1,4 @@ -# [578. 查询回答率最高的问题](https://leetcode.cn/problems/get-highest-answer-rate-question) +# [578. 查询回答率最高的问题 🔒](https://leetcode.cn/problems/get-highest-answer-rate-question) [English Version](/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README_EN.md) diff --git a/solution/0500-0599/0578.Get Highest Answer Rate Question/README_EN.md b/solution/0500-0599/0578.Get Highest Answer Rate Question/README_EN.md index 022cf0d4dda8f..af64df25f83e9 100644 --- a/solution/0500-0599/0578.Get Highest Answer Rate Question/README_EN.md +++ b/solution/0500-0599/0578.Get Highest Answer Rate Question/README_EN.md @@ -1,4 +1,4 @@ -# [578. Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question) +# [578. Get Highest Answer Rate Question 🔒](https://leetcode.com/problems/get-highest-answer-rate-question) [中文文档](/solution/0500-0599/0578.Get%20Highest%20Answer%20Rate%20Question/README.md) diff --git a/solution/0500-0599/0579.Find Cumulative Salary of an Employee/README.md b/solution/0500-0599/0579.Find Cumulative Salary of an Employee/README.md index dff82126063cd..94683e2245fde 100644 --- a/solution/0500-0599/0579.Find Cumulative Salary of an Employee/README.md +++ b/solution/0500-0599/0579.Find Cumulative Salary of an Employee/README.md @@ -1,4 +1,4 @@ -# [579. 查询员工的累计薪水](https://leetcode.cn/problems/find-cumulative-salary-of-an-employee) +# [579. 查询员工的累计薪水 🔒](https://leetcode.cn/problems/find-cumulative-salary-of-an-employee) [English Version](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README_EN.md) diff --git a/solution/0500-0599/0579.Find Cumulative Salary of an Employee/README_EN.md b/solution/0500-0599/0579.Find Cumulative Salary of an Employee/README_EN.md index 4e73f47be51d6..6ba187d3a2cbe 100644 --- a/solution/0500-0599/0579.Find Cumulative Salary of an Employee/README_EN.md +++ b/solution/0500-0599/0579.Find Cumulative Salary of an Employee/README_EN.md @@ -1,4 +1,4 @@ -# [579. Find Cumulative Salary of an Employee](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) +# [579. Find Cumulative Salary of an Employee 🔒](https://leetcode.com/problems/find-cumulative-salary-of-an-employee) [中文文档](/solution/0500-0599/0579.Find%20Cumulative%20Salary%20of%20an%20Employee/README.md) diff --git a/solution/0500-0599/0580.Count Student Number in Departments/README.md b/solution/0500-0599/0580.Count Student Number in Departments/README.md index 94b75fb7666c4..60a19bdefb613 100644 --- a/solution/0500-0599/0580.Count Student Number in Departments/README.md +++ b/solution/0500-0599/0580.Count Student Number in Departments/README.md @@ -1,4 +1,4 @@ -# [580. 统计各专业学生人数](https://leetcode.cn/problems/count-student-number-in-departments) +# [580. 统计各专业学生人数 🔒](https://leetcode.cn/problems/count-student-number-in-departments) [English Version](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README_EN.md) diff --git a/solution/0500-0599/0580.Count Student Number in Departments/README_EN.md b/solution/0500-0599/0580.Count Student Number in Departments/README_EN.md index 67d04b7ffbff1..7c02af2c1dd21 100644 --- a/solution/0500-0599/0580.Count Student Number in Departments/README_EN.md +++ b/solution/0500-0599/0580.Count Student Number in Departments/README_EN.md @@ -1,4 +1,4 @@ -# [580. Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments) +# [580. Count Student Number in Departments 🔒](https://leetcode.com/problems/count-student-number-in-departments) [中文文档](/solution/0500-0599/0580.Count%20Student%20Number%20in%20Departments/README.md) diff --git a/solution/0500-0599/0582.Kill Process/README.md b/solution/0500-0599/0582.Kill Process/README.md index 96926dd72eb52..493c338f42dc9 100644 --- a/solution/0500-0599/0582.Kill Process/README.md +++ b/solution/0500-0599/0582.Kill Process/README.md @@ -1,4 +1,4 @@ -# [582. 杀掉进程](https://leetcode.cn/problems/kill-process) +# [582. 杀掉进程 🔒](https://leetcode.cn/problems/kill-process) [English Version](/solution/0500-0599/0582.Kill%20Process/README_EN.md) diff --git a/solution/0500-0599/0582.Kill Process/README_EN.md b/solution/0500-0599/0582.Kill Process/README_EN.md index cfc5b4b00eb10..bb8f6def80059 100644 --- a/solution/0500-0599/0582.Kill Process/README_EN.md +++ b/solution/0500-0599/0582.Kill Process/README_EN.md @@ -1,4 +1,4 @@ -# [582. Kill Process](https://leetcode.com/problems/kill-process) +# [582. Kill Process 🔒](https://leetcode.com/problems/kill-process) [中文文档](/solution/0500-0599/0582.Kill%20Process/README.md) diff --git a/solution/0500-0599/0588.Design In-Memory File System/README.md b/solution/0500-0599/0588.Design In-Memory File System/README.md index 2045e3d87271a..5726c8a1f9cc9 100644 --- a/solution/0500-0599/0588.Design In-Memory File System/README.md +++ b/solution/0500-0599/0588.Design In-Memory File System/README.md @@ -1,4 +1,4 @@ -# [588. 设计内存文件系统](https://leetcode.cn/problems/design-in-memory-file-system) +# [588. 设计内存文件系统 🔒](https://leetcode.cn/problems/design-in-memory-file-system) [English Version](/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README_EN.md) diff --git a/solution/0500-0599/0588.Design In-Memory File System/README_EN.md b/solution/0500-0599/0588.Design In-Memory File System/README_EN.md index 0f7ec92178e87..216f67d0480be 100644 --- a/solution/0500-0599/0588.Design In-Memory File System/README_EN.md +++ b/solution/0500-0599/0588.Design In-Memory File System/README_EN.md @@ -1,4 +1,4 @@ -# [588. Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) +# [588. Design In-Memory File System 🔒](https://leetcode.com/problems/design-in-memory-file-system) [中文文档](/solution/0500-0599/0588.Design%20In-Memory%20File%20System/README.md) diff --git a/solution/0500-0599/0597.Friend Requests I Overall Acceptance Rate/README.md b/solution/0500-0599/0597.Friend Requests I Overall Acceptance Rate/README.md index c66b550a858db..9066bc04dd2b7 100644 --- a/solution/0500-0599/0597.Friend Requests I Overall Acceptance Rate/README.md +++ b/solution/0500-0599/0597.Friend Requests I Overall Acceptance Rate/README.md @@ -1,4 +1,4 @@ -# [597. 好友申请 I：总体通过率](https://leetcode.cn/problems/friend-requests-i-overall-acceptance-rate) +# [597. 好友申请 I：总体通过率 🔒](https://leetcode.cn/problems/friend-requests-i-overall-acceptance-rate) [English Version](/solution/0500-0599/0597.Friend%20Requests%20I%20Overall%20Acceptance%20Rate/README_EN.md) diff --git a/solution/0500-0599/0597.Friend Requests I Overall Acceptance Rate/README_EN.md b/solution/0500-0599/0597.Friend Requests I Overall Acceptance Rate/README_EN.md index 41514a5bf5f2e..c63eb4ccd86a1 100644 --- a/solution/0500-0599/0597.Friend Requests I Overall Acceptance Rate/README_EN.md +++ b/solution/0500-0599/0597.Friend Requests I Overall Acceptance Rate/README_EN.md @@ -1,4 +1,4 @@ -# [597. Friend Requests I Overall Acceptance Rate](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) +# [597. Friend Requests I Overall Acceptance Rate 🔒](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate) [中文文档](/solution/0500-0599/0597.Friend%20Requests%20I%20Overall%20Acceptance%20Rate/README.md) diff --git a/solution/0600-0699/0603.Consecutive Available Seats/README.md b/solution/0600-0699/0603.Consecutive Available Seats/README.md index 414e58cd426d3..4577a5c7d993c 100644 --- a/solution/0600-0699/0603.Consecutive Available Seats/README.md +++ b/solution/0600-0699/0603.Consecutive Available Seats/README.md @@ -1,4 +1,4 @@ -# [603. 连续空余座位](https://leetcode.cn/problems/consecutive-available-seats) +# [603. 连续空余座位 🔒](https://leetcode.cn/problems/consecutive-available-seats) [English Version](/solution/0600-0699/0603.Consecutive%20Available%20Seats/README_EN.md) diff --git a/solution/0600-0699/0603.Consecutive Available Seats/README_EN.md b/solution/0600-0699/0603.Consecutive Available Seats/README_EN.md index cec7d19b2a477..0b3dfed92479e 100644 --- a/solution/0600-0699/0603.Consecutive Available Seats/README_EN.md +++ b/solution/0600-0699/0603.Consecutive Available Seats/README_EN.md @@ -1,4 +1,4 @@ -# [603. Consecutive Available Seats](https://leetcode.com/problems/consecutive-available-seats) +# [603. Consecutive Available Seats 🔒](https://leetcode.com/problems/consecutive-available-seats) [中文文档](/solution/0600-0699/0603.Consecutive%20Available%20Seats/README.md) diff --git a/solution/0600-0699/0604.Design Compressed String Iterator/README.md b/solution/0600-0699/0604.Design Compressed String Iterator/README.md index 3b34222cac45c..5543ac31087ed 100644 --- a/solution/0600-0699/0604.Design Compressed String Iterator/README.md +++ b/solution/0600-0699/0604.Design Compressed String Iterator/README.md @@ -1,4 +1,4 @@ -# [604. 迭代压缩字符串](https://leetcode.cn/problems/design-compressed-string-iterator) +# [604. 迭代压缩字符串 🔒](https://leetcode.cn/problems/design-compressed-string-iterator) [English Version](/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README_EN.md) diff --git a/solution/0600-0699/0604.Design Compressed String Iterator/README_EN.md b/solution/0600-0699/0604.Design Compressed String Iterator/README_EN.md index ca9f156c3a2fa..8ea45a1e0071f 100644 --- a/solution/0600-0699/0604.Design Compressed String Iterator/README_EN.md +++ b/solution/0600-0699/0604.Design Compressed String Iterator/README_EN.md @@ -1,4 +1,4 @@ -# [604. Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) +# [604. Design Compressed String Iterator 🔒](https://leetcode.com/problems/design-compressed-string-iterator) [中文文档](/solution/0600-0699/0604.Design%20Compressed%20String%20Iterator/README.md) diff --git a/solution/0600-0699/0612.Shortest Distance in a Plane/README.md b/solution/0600-0699/0612.Shortest Distance in a Plane/README.md index 5f5f5faa272f3..28665cde8dfb3 100644 --- a/solution/0600-0699/0612.Shortest Distance in a Plane/README.md +++ b/solution/0600-0699/0612.Shortest Distance in a Plane/README.md @@ -1,4 +1,4 @@ -# [612. 平面上的最近距离](https://leetcode.cn/problems/shortest-distance-in-a-plane) +# [612. 平面上的最近距离 🔒](https://leetcode.cn/problems/shortest-distance-in-a-plane) [English Version](/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README_EN.md) diff --git a/solution/0600-0699/0612.Shortest Distance in a Plane/README_EN.md b/solution/0600-0699/0612.Shortest Distance in a Plane/README_EN.md index d18c1c4f1bff0..ddedaf196d093 100644 --- a/solution/0600-0699/0612.Shortest Distance in a Plane/README_EN.md +++ b/solution/0600-0699/0612.Shortest Distance in a Plane/README_EN.md @@ -1,4 +1,4 @@ -# [612. Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane) +# [612. Shortest Distance in a Plane 🔒](https://leetcode.com/problems/shortest-distance-in-a-plane) [中文文档](/solution/0600-0699/0612.Shortest%20Distance%20in%20a%20Plane/README.md) diff --git a/solution/0600-0699/0613.Shortest Distance in a Line/README.md b/solution/0600-0699/0613.Shortest Distance in a Line/README.md index 417535b41bd59..a285d3f47febb 100644 --- a/solution/0600-0699/0613.Shortest Distance in a Line/README.md +++ b/solution/0600-0699/0613.Shortest Distance in a Line/README.md @@ -1,4 +1,4 @@ -# [613. 直线上的最近距离](https://leetcode.cn/problems/shortest-distance-in-a-line) +# [613. 直线上的最近距离 🔒](https://leetcode.cn/problems/shortest-distance-in-a-line) [English Version](/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README_EN.md) diff --git a/solution/0600-0699/0613.Shortest Distance in a Line/README_EN.md b/solution/0600-0699/0613.Shortest Distance in a Line/README_EN.md index 6b8e15bc55dfd..a919d23ad8aaa 100644 --- a/solution/0600-0699/0613.Shortest Distance in a Line/README_EN.md +++ b/solution/0600-0699/0613.Shortest Distance in a Line/README_EN.md @@ -1,4 +1,4 @@ -# [613. Shortest Distance in a Line](https://leetcode.com/problems/shortest-distance-in-a-line) +# [613. Shortest Distance in a Line 🔒](https://leetcode.com/problems/shortest-distance-in-a-line) [中文文档](/solution/0600-0699/0613.Shortest%20Distance%20in%20a%20Line/README.md) diff --git a/solution/0600-0699/0614.Second Degree Follower/README.md b/solution/0600-0699/0614.Second Degree Follower/README.md index bf01e800c05b1..ba81543f8aada 100644 --- a/solution/0600-0699/0614.Second Degree Follower/README.md +++ b/solution/0600-0699/0614.Second Degree Follower/README.md @@ -1,4 +1,4 @@ -# [614. 二级关注者](https://leetcode.cn/problems/second-degree-follower) +# [614. 二级关注者 🔒](https://leetcode.cn/problems/second-degree-follower) [English Version](/solution/0600-0699/0614.Second%20Degree%20Follower/README_EN.md) diff --git a/solution/0600-0699/0614.Second Degree Follower/README_EN.md b/solution/0600-0699/0614.Second Degree Follower/README_EN.md index 926bab36177b5..f4d78ff569985 100644 --- a/solution/0600-0699/0614.Second Degree Follower/README_EN.md +++ b/solution/0600-0699/0614.Second Degree Follower/README_EN.md @@ -1,4 +1,4 @@ -# [614. Second Degree Follower](https://leetcode.com/problems/second-degree-follower) +# [614. Second Degree Follower 🔒](https://leetcode.com/problems/second-degree-follower) [中文文档](/solution/0600-0699/0614.Second%20Degree%20Follower/README.md) diff --git a/solution/0600-0699/0615.Average Salary Departments VS Company/README.md b/solution/0600-0699/0615.Average Salary Departments VS Company/README.md index 81f8d02517441..abba58957d1e0 100644 --- a/solution/0600-0699/0615.Average Salary Departments VS Company/README.md +++ b/solution/0600-0699/0615.Average Salary Departments VS Company/README.md @@ -1,4 +1,4 @@ -# [615. 平均工资：部门与公司比较](https://leetcode.cn/problems/average-salary-departments-vs-company) +# [615. 平均工资：部门与公司比较 🔒](https://leetcode.cn/problems/average-salary-departments-vs-company) [English Version](/solution/0600-0699/0615.Average%20Salary%20Departments%20VS%20Company/README_EN.md) diff --git a/solution/0600-0699/0615.Average Salary Departments VS Company/README_EN.md b/solution/0600-0699/0615.Average Salary Departments VS Company/README_EN.md index e1e23b10b3220..5edb7adf955be 100644 --- a/solution/0600-0699/0615.Average Salary Departments VS Company/README_EN.md +++ b/solution/0600-0699/0615.Average Salary Departments VS Company/README_EN.md @@ -1,4 +1,4 @@ -# [615. Average Salary Departments VS Company](https://leetcode.com/problems/average-salary-departments-vs-company) +# [615. Average Salary Departments VS Company 🔒](https://leetcode.com/problems/average-salary-departments-vs-company) [中文文档](/solution/0600-0699/0615.Average%20Salary%20Departments%20VS%20Company/README.md) diff --git a/solution/0600-0699/0616.Add Bold Tag in String/README.md b/solution/0600-0699/0616.Add Bold Tag in String/README.md index e98df24571b73..e7cbf56cd789a 100644 --- a/solution/0600-0699/0616.Add Bold Tag in String/README.md +++ b/solution/0600-0699/0616.Add Bold Tag in String/README.md @@ -1,4 +1,4 @@ -# [616. 给字符串添加加粗标签](https://leetcode.cn/problems/add-bold-tag-in-string) +# [616. 给字符串添加加粗标签 🔒](https://leetcode.cn/problems/add-bold-tag-in-string) [English Version](/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README_EN.md) diff --git a/solution/0600-0699/0616.Add Bold Tag in String/README_EN.md b/solution/0600-0699/0616.Add Bold Tag in String/README_EN.md index 5096e5ecfab2c..edcda78355bb8 100644 --- a/solution/0600-0699/0616.Add Bold Tag in String/README_EN.md +++ b/solution/0600-0699/0616.Add Bold Tag in String/README_EN.md @@ -1,4 +1,4 @@ -# [616. Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string) +# [616. Add Bold Tag in String 🔒](https://leetcode.com/problems/add-bold-tag-in-string) [中文文档](/solution/0600-0699/0616.Add%20Bold%20Tag%20in%20String/README.md) diff --git a/solution/0600-0699/0618.Students Report By Geography/README.md b/solution/0600-0699/0618.Students Report By Geography/README.md index 494414bd0fa1f..bc3ea902b6edc 100644 --- a/solution/0600-0699/0618.Students Report By Geography/README.md +++ b/solution/0600-0699/0618.Students Report By Geography/README.md @@ -1,4 +1,4 @@ -# [618. 学生地理信息报告](https://leetcode.cn/problems/students-report-by-geography) +# [618. 学生地理信息报告 🔒](https://leetcode.cn/problems/students-report-by-geography) [English Version](/solution/0600-0699/0618.Students%20Report%20By%20Geography/README_EN.md) diff --git a/solution/0600-0699/0618.Students Report By Geography/README_EN.md b/solution/0600-0699/0618.Students Report By Geography/README_EN.md index d65f382163802..266463f7b9dcc 100644 --- a/solution/0600-0699/0618.Students Report By Geography/README_EN.md +++ b/solution/0600-0699/0618.Students Report By Geography/README_EN.md @@ -1,4 +1,4 @@ -# [618. Students Report By Geography](https://leetcode.com/problems/students-report-by-geography) +# [618. Students Report By Geography 🔒](https://leetcode.com/problems/students-report-by-geography) [中文文档](/solution/0600-0699/0618.Students%20Report%20By%20Geography/README.md) diff --git a/solution/0600-0699/0624.Maximum Distance in Arrays/README.md b/solution/0600-0699/0624.Maximum Distance in Arrays/README.md index b1b0cc6a8d847..f657db5f78e36 100644 --- a/solution/0600-0699/0624.Maximum Distance in Arrays/README.md +++ b/solution/0600-0699/0624.Maximum Distance in Arrays/README.md @@ -1,4 +1,4 @@ -# [624. 数组列表中的最大距离](https://leetcode.cn/problems/maximum-distance-in-arrays) +# [624. 数组列表中的最大距离 🔒](https://leetcode.cn/problems/maximum-distance-in-arrays) [English Version](/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README_EN.md) diff --git a/solution/0600-0699/0624.Maximum Distance in Arrays/README_EN.md b/solution/0600-0699/0624.Maximum Distance in Arrays/README_EN.md index 5bdad3214f12c..856cffc306720 100644 --- a/solution/0600-0699/0624.Maximum Distance in Arrays/README_EN.md +++ b/solution/0600-0699/0624.Maximum Distance in Arrays/README_EN.md @@ -1,4 +1,4 @@ -# [624. Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) +# [624. Maximum Distance in Arrays 🔒](https://leetcode.com/problems/maximum-distance-in-arrays) [中文文档](/solution/0600-0699/0624.Maximum%20Distance%20in%20Arrays/README.md) diff --git a/solution/0600-0699/0625.Minimum Factorization/README.md b/solution/0600-0699/0625.Minimum Factorization/README.md index 509ba1bb77199..cc4db1b0bbcb0 100644 --- a/solution/0600-0699/0625.Minimum Factorization/README.md +++ b/solution/0600-0699/0625.Minimum Factorization/README.md @@ -1,4 +1,4 @@ -# [625. 最小因式分解](https://leetcode.cn/problems/minimum-factorization) +# [625. 最小因式分解 🔒](https://leetcode.cn/problems/minimum-factorization) [English Version](/solution/0600-0699/0625.Minimum%20Factorization/README_EN.md) diff --git a/solution/0600-0699/0625.Minimum Factorization/README_EN.md b/solution/0600-0699/0625.Minimum Factorization/README_EN.md index d9302214969ed..cd5c6ef8eb488 100644 --- a/solution/0600-0699/0625.Minimum Factorization/README_EN.md +++ b/solution/0600-0699/0625.Minimum Factorization/README_EN.md @@ -1,4 +1,4 @@ -# [625. Minimum Factorization](https://leetcode.com/problems/minimum-factorization) +# [625. Minimum Factorization 🔒](https://leetcode.com/problems/minimum-factorization) [中文文档](/solution/0600-0699/0625.Minimum%20Factorization/README.md) diff --git a/solution/0600-0699/0631.Design Excel Sum Formula/README.md b/solution/0600-0699/0631.Design Excel Sum Formula/README.md index 86bf44031873d..3b697b268b46c 100644 --- a/solution/0600-0699/0631.Design Excel Sum Formula/README.md +++ b/solution/0600-0699/0631.Design Excel Sum Formula/README.md @@ -1,4 +1,4 @@ -# [631. 设计 Excel 求和公式](https://leetcode.cn/problems/design-excel-sum-formula) +# [631. 设计 Excel 求和公式 🔒](https://leetcode.cn/problems/design-excel-sum-formula) [English Version](/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README_EN.md) diff --git a/solution/0600-0699/0631.Design Excel Sum Formula/README_EN.md b/solution/0600-0699/0631.Design Excel Sum Formula/README_EN.md index 89a1c6e43801b..7105df7dbb47e 100644 --- a/solution/0600-0699/0631.Design Excel Sum Formula/README_EN.md +++ b/solution/0600-0699/0631.Design Excel Sum Formula/README_EN.md @@ -1,4 +1,4 @@ -# [631. Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula) +# [631. Design Excel Sum Formula 🔒](https://leetcode.com/problems/design-excel-sum-formula) [中文文档](/solution/0600-0699/0631.Design%20Excel%20Sum%20Formula/README.md) diff --git a/solution/0600-0699/0634.Find the Derangement of An Array/README.md b/solution/0600-0699/0634.Find the Derangement of An Array/README.md index 6b4ba7e4a775c..fba661636a7e2 100644 --- a/solution/0600-0699/0634.Find the Derangement of An Array/README.md +++ b/solution/0600-0699/0634.Find the Derangement of An Array/README.md @@ -1,4 +1,4 @@ -# [634. 寻找数组的错位排列](https://leetcode.cn/problems/find-the-derangement-of-an-array) +# [634. 寻找数组的错位排列 🔒](https://leetcode.cn/problems/find-the-derangement-of-an-array) [English Version](/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README_EN.md) diff --git a/solution/0600-0699/0634.Find the Derangement of An Array/README_EN.md b/solution/0600-0699/0634.Find the Derangement of An Array/README_EN.md index 947eb31deda77..2d822a4f70d26 100644 --- a/solution/0600-0699/0634.Find the Derangement of An Array/README_EN.md +++ b/solution/0600-0699/0634.Find the Derangement of An Array/README_EN.md @@ -1,4 +1,4 @@ -# [634. Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array) +# [634. Find the Derangement of An Array 🔒](https://leetcode.com/problems/find-the-derangement-of-an-array) [中文文档](/solution/0600-0699/0634.Find%20the%20Derangement%20of%20An%20Array/README.md) diff --git a/solution/0600-0699/0635.Design Log Storage System/README.md b/solution/0600-0699/0635.Design Log Storage System/README.md index 5b99b3d57dfe5..dcf057483890c 100644 --- a/solution/0600-0699/0635.Design Log Storage System/README.md +++ b/solution/0600-0699/0635.Design Log Storage System/README.md @@ -1,4 +1,4 @@ -# [635. 设计日志存储系统](https://leetcode.cn/problems/design-log-storage-system) +# [635. 设计日志存储系统 🔒](https://leetcode.cn/problems/design-log-storage-system) [English Version](/solution/0600-0699/0635.Design%20Log%20Storage%20System/README_EN.md) diff --git a/solution/0600-0699/0635.Design Log Storage System/README_EN.md b/solution/0600-0699/0635.Design Log Storage System/README_EN.md index 14db3be2ec649..60285893f8710 100644 --- a/solution/0600-0699/0635.Design Log Storage System/README_EN.md +++ b/solution/0600-0699/0635.Design Log Storage System/README_EN.md @@ -1,4 +1,4 @@ -# [635. Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) +# [635. Design Log Storage System 🔒](https://leetcode.com/problems/design-log-storage-system) [中文文档](/solution/0600-0699/0635.Design%20Log%20Storage%20System/README.md) diff --git a/solution/0600-0699/0642.Design Search Autocomplete System/README.md b/solution/0600-0699/0642.Design Search Autocomplete System/README.md index 258380d91e324..495e73d07398f 100644 --- a/solution/0600-0699/0642.Design Search Autocomplete System/README.md +++ b/solution/0600-0699/0642.Design Search Autocomplete System/README.md @@ -1,4 +1,4 @@ -# [642. 设计搜索自动补全系统](https://leetcode.cn/problems/design-search-autocomplete-system) +# [642. 设计搜索自动补全系统 🔒](https://leetcode.cn/problems/design-search-autocomplete-system) [English Version](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README_EN.md) diff --git a/solution/0600-0699/0642.Design Search Autocomplete System/README_EN.md b/solution/0600-0699/0642.Design Search Autocomplete System/README_EN.md index 83af6aef84143..79c43a13554e1 100644 --- a/solution/0600-0699/0642.Design Search Autocomplete System/README_EN.md +++ b/solution/0600-0699/0642.Design Search Autocomplete System/README_EN.md @@ -1,4 +1,4 @@ -# [642. Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) +# [642. Design Search Autocomplete System 🔒](https://leetcode.com/problems/design-search-autocomplete-system) [中文文档](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README.md) diff --git a/solution/0600-0699/0644.Maximum Average Subarray II/README.md b/solution/0600-0699/0644.Maximum Average Subarray II/README.md index 862a05df3715e..9b2f6a17054d8 100644 --- a/solution/0600-0699/0644.Maximum Average Subarray II/README.md +++ b/solution/0600-0699/0644.Maximum Average Subarray II/README.md @@ -1,4 +1,4 @@ -# [644. 子数组最大平均数 II](https://leetcode.cn/problems/maximum-average-subarray-ii) +# [644. 子数组最大平均数 II 🔒](https://leetcode.cn/problems/maximum-average-subarray-ii) [English Version](/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README_EN.md) diff --git a/solution/0600-0699/0644.Maximum Average Subarray II/README_EN.md b/solution/0600-0699/0644.Maximum Average Subarray II/README_EN.md index 7fb9c8ee9fb25..7207c61a0ff0a 100644 --- a/solution/0600-0699/0644.Maximum Average Subarray II/README_EN.md +++ b/solution/0600-0699/0644.Maximum Average Subarray II/README_EN.md @@ -1,4 +1,4 @@ -# [644. Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii) +# [644. Maximum Average Subarray II 🔒](https://leetcode.com/problems/maximum-average-subarray-ii) [中文文档](/solution/0600-0699/0644.Maximum%20Average%20Subarray%20II/README.md) diff --git a/solution/0600-0699/0651.4 Keys Keyboard/README.md b/solution/0600-0699/0651.4 Keys Keyboard/README.md index 7cc61b5e15cfc..b88dc3d72185d 100644 --- a/solution/0600-0699/0651.4 Keys Keyboard/README.md +++ b/solution/0600-0699/0651.4 Keys Keyboard/README.md @@ -1,4 +1,4 @@ -# [651. 四个键的键盘](https://leetcode.cn/problems/4-keys-keyboard) +# [651. 四个键的键盘 🔒](https://leetcode.cn/problems/4-keys-keyboard) [English Version](/solution/0600-0699/0651.4%20Keys%20Keyboard/README_EN.md) diff --git a/solution/0600-0699/0651.4 Keys Keyboard/README_EN.md b/solution/0600-0699/0651.4 Keys Keyboard/README_EN.md index 432e97abdb5f6..34cc8fc0c1889 100644 --- a/solution/0600-0699/0651.4 Keys Keyboard/README_EN.md +++ b/solution/0600-0699/0651.4 Keys Keyboard/README_EN.md @@ -1,4 +1,4 @@ -# [651. 4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard) +# [651. 4 Keys Keyboard 🔒](https://leetcode.com/problems/4-keys-keyboard) [中文文档](/solution/0600-0699/0651.4%20Keys%20Keyboard/README.md) diff --git a/solution/0600-0699/0656.Coin Path/README.md b/solution/0600-0699/0656.Coin Path/README.md index 0092a9135ebe4..be863fdb15027 100644 --- a/solution/0600-0699/0656.Coin Path/README.md +++ b/solution/0600-0699/0656.Coin Path/README.md @@ -1,4 +1,4 @@ -# [656. 金币路径](https://leetcode.cn/problems/coin-path) +# [656. 金币路径 🔒](https://leetcode.cn/problems/coin-path) [English Version](/solution/0600-0699/0656.Coin%20Path/README_EN.md) diff --git a/solution/0600-0699/0656.Coin Path/README_EN.md b/solution/0600-0699/0656.Coin Path/README_EN.md index 60be21871637d..537fba00d55b5 100644 --- a/solution/0600-0699/0656.Coin Path/README_EN.md +++ b/solution/0600-0699/0656.Coin Path/README_EN.md @@ -1,4 +1,4 @@ -# [656. Coin Path](https://leetcode.com/problems/coin-path) +# [656. Coin Path 🔒](https://leetcode.com/problems/coin-path) [中文文档](/solution/0600-0699/0656.Coin%20Path/README.md) diff --git a/solution/0600-0699/0660.Remove 9/README.md b/solution/0600-0699/0660.Remove 9/README.md index e36a9cb5512de..8eff21f4572f1 100644 --- a/solution/0600-0699/0660.Remove 9/README.md +++ b/solution/0600-0699/0660.Remove 9/README.md @@ -1,4 +1,4 @@ -# [660. 移除 9](https://leetcode.cn/problems/remove-9) +# [660. 移除 9 🔒](https://leetcode.cn/problems/remove-9) [English Version](/solution/0600-0699/0660.Remove%209/README_EN.md) diff --git a/solution/0600-0699/0660.Remove 9/README_EN.md b/solution/0600-0699/0660.Remove 9/README_EN.md index b9aa56498bab6..66ef7912f1e6a 100644 --- a/solution/0600-0699/0660.Remove 9/README_EN.md +++ b/solution/0600-0699/0660.Remove 9/README_EN.md @@ -1,4 +1,4 @@ -# [660. Remove 9](https://leetcode.com/problems/remove-9) +# [660. Remove 9 🔒](https://leetcode.com/problems/remove-9) [中文文档](/solution/0600-0699/0660.Remove%209/README.md) diff --git a/solution/0600-0699/0663.Equal Tree Partition/README.md b/solution/0600-0699/0663.Equal Tree Partition/README.md index 47d46db6b0b34..6d61aa3e3fb71 100644 --- a/solution/0600-0699/0663.Equal Tree Partition/README.md +++ b/solution/0600-0699/0663.Equal Tree Partition/README.md @@ -1,4 +1,4 @@ -# [663. 均匀树划分](https://leetcode.cn/problems/equal-tree-partition) +# [663. 均匀树划分 🔒](https://leetcode.cn/problems/equal-tree-partition) [English Version](/solution/0600-0699/0663.Equal%20Tree%20Partition/README_EN.md) diff --git a/solution/0600-0699/0663.Equal Tree Partition/README_EN.md b/solution/0600-0699/0663.Equal Tree Partition/README_EN.md index 0be0ee88e4c16..f46f21dbf96a0 100644 --- a/solution/0600-0699/0663.Equal Tree Partition/README_EN.md +++ b/solution/0600-0699/0663.Equal Tree Partition/README_EN.md @@ -1,4 +1,4 @@ -# [663. Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition) +# [663. Equal Tree Partition 🔒](https://leetcode.com/problems/equal-tree-partition) [中文文档](/solution/0600-0699/0663.Equal%20Tree%20Partition/README.md) diff --git a/solution/0600-0699/0666.Path Sum IV/README.md b/solution/0600-0699/0666.Path Sum IV/README.md index cdc3756a95a0f..39cce47579550 100644 --- a/solution/0600-0699/0666.Path Sum IV/README.md +++ b/solution/0600-0699/0666.Path Sum IV/README.md @@ -1,4 +1,4 @@ -# [666. 路径总和 IV](https://leetcode.cn/problems/path-sum-iv) +# [666. 路径总和 IV 🔒](https://leetcode.cn/problems/path-sum-iv) [English Version](/solution/0600-0699/0666.Path%20Sum%20IV/README_EN.md) diff --git a/solution/0600-0699/0666.Path Sum IV/README_EN.md b/solution/0600-0699/0666.Path Sum IV/README_EN.md index 248edc7cf07e3..673d55bc95537 100644 --- a/solution/0600-0699/0666.Path Sum IV/README_EN.md +++ b/solution/0600-0699/0666.Path Sum IV/README_EN.md @@ -1,4 +1,4 @@ -# [666. Path Sum IV](https://leetcode.com/problems/path-sum-iv) +# [666. Path Sum IV 🔒](https://leetcode.com/problems/path-sum-iv) [中文文档](/solution/0600-0699/0666.Path%20Sum%20IV/README.md) diff --git a/solution/0600-0699/0681.Next Closest Time/README.md b/solution/0600-0699/0681.Next Closest Time/README.md index 4b2ca60d4f754..5668486328b04 100644 --- a/solution/0600-0699/0681.Next Closest Time/README.md +++ b/solution/0600-0699/0681.Next Closest Time/README.md @@ -1,4 +1,4 @@ -# [681. 最近时刻](https://leetcode.cn/problems/next-closest-time) +# [681. 最近时刻 🔒](https://leetcode.cn/problems/next-closest-time) [English Version](/solution/0600-0699/0681.Next%20Closest%20Time/README_EN.md) diff --git a/solution/0600-0699/0681.Next Closest Time/README_EN.md b/solution/0600-0699/0681.Next Closest Time/README_EN.md index 8c1d74834adb9..629230bf68e14 100644 --- a/solution/0600-0699/0681.Next Closest Time/README_EN.md +++ b/solution/0600-0699/0681.Next Closest Time/README_EN.md @@ -1,4 +1,4 @@ -# [681. Next Closest Time](https://leetcode.com/problems/next-closest-time) +# [681. Next Closest Time 🔒](https://leetcode.com/problems/next-closest-time) [中文文档](/solution/0600-0699/0681.Next%20Closest%20Time/README.md) diff --git a/solution/0600-0699/0683.K Empty Slots/README.md b/solution/0600-0699/0683.K Empty Slots/README.md index 8abee1a8b56b3..42408198a75b3 100644 --- a/solution/0600-0699/0683.K Empty Slots/README.md +++ b/solution/0600-0699/0683.K Empty Slots/README.md @@ -1,4 +1,4 @@ -# [683. K 个关闭的灯泡](https://leetcode.cn/problems/k-empty-slots) +# [683. K 个关闭的灯泡 🔒](https://leetcode.cn/problems/k-empty-slots) [English Version](/solution/0600-0699/0683.K%20Empty%20Slots/README_EN.md) diff --git a/solution/0600-0699/0683.K Empty Slots/README_EN.md b/solution/0600-0699/0683.K Empty Slots/README_EN.md index dcd155515a22c..7d3458f13e410 100644 --- a/solution/0600-0699/0683.K Empty Slots/README_EN.md +++ b/solution/0600-0699/0683.K Empty Slots/README_EN.md @@ -1,4 +1,4 @@ -# [683. K Empty Slots](https://leetcode.com/problems/k-empty-slots) +# [683. K Empty Slots 🔒](https://leetcode.com/problems/k-empty-slots) [中文文档](/solution/0600-0699/0683.K%20Empty%20Slots/README.md) diff --git a/solution/0600-0699/0694.Number of Distinct Islands/README.md b/solution/0600-0699/0694.Number of Distinct Islands/README.md index 837a659ecf9a1..5559ba423e514 100644 --- a/solution/0600-0699/0694.Number of Distinct Islands/README.md +++ b/solution/0600-0699/0694.Number of Distinct Islands/README.md @@ -1,4 +1,4 @@ -# [694. 不同岛屿的数量](https://leetcode.cn/problems/number-of-distinct-islands) +# [694. 不同岛屿的数量 🔒](https://leetcode.cn/problems/number-of-distinct-islands) [English Version](/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/README_EN.md) diff --git a/solution/0600-0699/0694.Number of Distinct Islands/README_EN.md b/solution/0600-0699/0694.Number of Distinct Islands/README_EN.md index f06e47a846294..b8f38ba41de41 100644 --- a/solution/0600-0699/0694.Number of Distinct Islands/README_EN.md +++ b/solution/0600-0699/0694.Number of Distinct Islands/README_EN.md @@ -1,4 +1,4 @@ -# [694. Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands) +# [694. Number of Distinct Islands 🔒](https://leetcode.com/problems/number-of-distinct-islands) [中文文档](/solution/0600-0699/0694.Number%20of%20Distinct%20Islands/README.md) diff --git a/solution/0700-0799/0702.Search in a Sorted Array of Unknown Size/README.md b/solution/0700-0799/0702.Search in a Sorted Array of Unknown Size/README.md index e022c1ac68867..9284931acb7be 100644 --- a/solution/0700-0799/0702.Search in a Sorted Array of Unknown Size/README.md +++ b/solution/0700-0799/0702.Search in a Sorted Array of Unknown Size/README.md @@ -1,4 +1,4 @@ -# [702. 搜索长度未知的有序数组](https://leetcode.cn/problems/search-in-a-sorted-array-of-unknown-size) +# [702. 搜索长度未知的有序数组 🔒](https://leetcode.cn/problems/search-in-a-sorted-array-of-unknown-size) [English Version](/solution/0700-0799/0702.Search%20in%20a%20Sorted%20Array%20of%20Unknown%20Size/README_EN.md) diff --git a/solution/0700-0799/0702.Search in a Sorted Array of Unknown Size/README_EN.md b/solution/0700-0799/0702.Search in a Sorted Array of Unknown Size/README_EN.md index f1add21750bb0..e9fd42c59c836 100644 --- a/solution/0700-0799/0702.Search in a Sorted Array of Unknown Size/README_EN.md +++ b/solution/0700-0799/0702.Search in a Sorted Array of Unknown Size/README_EN.md @@ -1,4 +1,4 @@ -# [702. Search in a Sorted Array of Unknown Size](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) +# [702. Search in a Sorted Array of Unknown Size 🔒](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size) [中文文档](/solution/0700-0799/0702.Search%20in%20a%20Sorted%20Array%20of%20Unknown%20Size/README.md) diff --git a/solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README.md b/solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README.md index c61c993edb050..72872ab826e21 100644 --- a/solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README.md +++ b/solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README.md @@ -1,4 +1,4 @@ -# [708. 循环有序列表的插入](https://leetcode.cn/problems/insert-into-a-sorted-circular-linked-list) +# [708. 循环有序列表的插入 🔒](https://leetcode.cn/problems/insert-into-a-sorted-circular-linked-list) [English Version](/solution/0700-0799/0708.Insert%20into%20a%20Sorted%20Circular%20Linked%20List/README_EN.md) diff --git a/solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README_EN.md b/solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README_EN.md index 046a121976c7a..9c09e580000c3 100644 --- a/solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README_EN.md +++ b/solution/0700-0799/0708.Insert into a Sorted Circular Linked List/README_EN.md @@ -1,4 +1,4 @@ -# [708. Insert into a Sorted Circular Linked List](https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list) +# [708. Insert into a Sorted Circular Linked List 🔒](https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list) [中文文档](/solution/0700-0799/0708.Insert%20into%20a%20Sorted%20Circular%20Linked%20List/README.md) diff --git a/solution/0700-0799/0711.Number of Distinct Islands II/README.md b/solution/0700-0799/0711.Number of Distinct Islands II/README.md index fbfa2c41be7df..1bb9d8f7943e1 100644 --- a/solution/0700-0799/0711.Number of Distinct Islands II/README.md +++ b/solution/0700-0799/0711.Number of Distinct Islands II/README.md @@ -1,4 +1,4 @@ -# [711. 不同岛屿的数量 II](https://leetcode.cn/problems/number-of-distinct-islands-ii) +# [711. 不同岛屿的数量 II 🔒](https://leetcode.cn/problems/number-of-distinct-islands-ii) [English Version](/solution/0700-0799/0711.Number%20of%20Distinct%20Islands%20II/README_EN.md) diff --git a/solution/0700-0799/0711.Number of Distinct Islands II/README_EN.md b/solution/0700-0799/0711.Number of Distinct Islands II/README_EN.md index d8b062b3ffbbc..1968fa39263b8 100644 --- a/solution/0700-0799/0711.Number of Distinct Islands II/README_EN.md +++ b/solution/0700-0799/0711.Number of Distinct Islands II/README_EN.md @@ -1,4 +1,4 @@ -# [711. Number of Distinct Islands II](https://leetcode.com/problems/number-of-distinct-islands-ii) +# [711. Number of Distinct Islands II 🔒](https://leetcode.com/problems/number-of-distinct-islands-ii) [中文文档](/solution/0700-0799/0711.Number%20of%20Distinct%20Islands%20II/README.md) diff --git a/solution/0700-0799/0716.Max Stack/README.md b/solution/0700-0799/0716.Max Stack/README.md index 1a9d747468634..bb559c5567cd2 100644 --- a/solution/0700-0799/0716.Max Stack/README.md +++ b/solution/0700-0799/0716.Max Stack/README.md @@ -1,4 +1,4 @@ -# [716. 最大栈](https://leetcode.cn/problems/max-stack) +# [716. 最大栈 🔒](https://leetcode.cn/problems/max-stack) [English Version](/solution/0700-0799/0716.Max%20Stack/README_EN.md) diff --git a/solution/0700-0799/0716.Max Stack/README_EN.md b/solution/0700-0799/0716.Max Stack/README_EN.md index bd9e224a84301..2a6723fe221cd 100644 --- a/solution/0700-0799/0716.Max Stack/README_EN.md +++ b/solution/0700-0799/0716.Max Stack/README_EN.md @@ -1,4 +1,4 @@ -# [716. Max Stack](https://leetcode.com/problems/max-stack) +# [716. Max Stack 🔒](https://leetcode.com/problems/max-stack) [中文文档](/solution/0700-0799/0716.Max%20Stack/README.md) diff --git a/solution/0700-0799/0723.Candy Crush/README.md b/solution/0700-0799/0723.Candy Crush/README.md index b20dcc612e283..8951a43512f7a 100644 --- a/solution/0700-0799/0723.Candy Crush/README.md +++ b/solution/0700-0799/0723.Candy Crush/README.md @@ -1,4 +1,4 @@ -# [723. 粉碎糖果](https://leetcode.cn/problems/candy-crush) +# [723. 粉碎糖果 🔒](https://leetcode.cn/problems/candy-crush) [English Version](/solution/0700-0799/0723.Candy%20Crush/README_EN.md) diff --git a/solution/0700-0799/0723.Candy Crush/README_EN.md b/solution/0700-0799/0723.Candy Crush/README_EN.md index 846670c8e60a7..7ec1ecf53c126 100644 --- a/solution/0700-0799/0723.Candy Crush/README_EN.md +++ b/solution/0700-0799/0723.Candy Crush/README_EN.md @@ -1,4 +1,4 @@ -# [723. Candy Crush](https://leetcode.com/problems/candy-crush) +# [723. Candy Crush 🔒](https://leetcode.com/problems/candy-crush) [中文文档](/solution/0700-0799/0723.Candy%20Crush/README.md) diff --git a/solution/0700-0799/0727.Minimum Window Subsequence/README.md b/solution/0700-0799/0727.Minimum Window Subsequence/README.md index 3347a6b5926e3..42b0a99898cec 100644 --- a/solution/0700-0799/0727.Minimum Window Subsequence/README.md +++ b/solution/0700-0799/0727.Minimum Window Subsequence/README.md @@ -1,4 +1,4 @@ -# [727. 最小窗口子序列](https://leetcode.cn/problems/minimum-window-subsequence) +# [727. 最小窗口子序列 🔒](https://leetcode.cn/problems/minimum-window-subsequence) [English Version](/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README_EN.md) diff --git a/solution/0700-0799/0727.Minimum Window Subsequence/README_EN.md b/solution/0700-0799/0727.Minimum Window Subsequence/README_EN.md index 19d630f0bceb5..0d796b176eb15 100644 --- a/solution/0700-0799/0727.Minimum Window Subsequence/README_EN.md +++ b/solution/0700-0799/0727.Minimum Window Subsequence/README_EN.md @@ -1,4 +1,4 @@ -# [727. Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence) +# [727. Minimum Window Subsequence 🔒](https://leetcode.com/problems/minimum-window-subsequence) [中文文档](/solution/0700-0799/0727.Minimum%20Window%20Subsequence/README.md) diff --git a/solution/0700-0799/0734.Sentence Similarity/README.md b/solution/0700-0799/0734.Sentence Similarity/README.md index cd9fd0f7a4de4..90271604d12d1 100644 --- a/solution/0700-0799/0734.Sentence Similarity/README.md +++ b/solution/0700-0799/0734.Sentence Similarity/README.md @@ -1,4 +1,4 @@ -# [734. 句子相似性](https://leetcode.cn/problems/sentence-similarity) +# [734. 句子相似性 🔒](https://leetcode.cn/problems/sentence-similarity) [English Version](/solution/0700-0799/0734.Sentence%20Similarity/README_EN.md) diff --git a/solution/0700-0799/0734.Sentence Similarity/README_EN.md b/solution/0700-0799/0734.Sentence Similarity/README_EN.md index 88924933ebc72..ad643aa25ebda 100644 --- a/solution/0700-0799/0734.Sentence Similarity/README_EN.md +++ b/solution/0700-0799/0734.Sentence Similarity/README_EN.md @@ -1,4 +1,4 @@ -# [734. Sentence Similarity](https://leetcode.com/problems/sentence-similarity) +# [734. Sentence Similarity 🔒](https://leetcode.com/problems/sentence-similarity) [中文文档](/solution/0700-0799/0734.Sentence%20Similarity/README.md) diff --git a/solution/0700-0799/0737.Sentence Similarity II/README.md b/solution/0700-0799/0737.Sentence Similarity II/README.md index d3e40c243bca3..b638722d9be44 100644 --- a/solution/0700-0799/0737.Sentence Similarity II/README.md +++ b/solution/0700-0799/0737.Sentence Similarity II/README.md @@ -1,4 +1,4 @@ -# [737. 句子相似性 II](https://leetcode.cn/problems/sentence-similarity-ii) +# [737. 句子相似性 II 🔒](https://leetcode.cn/problems/sentence-similarity-ii) [English Version](/solution/0700-0799/0737.Sentence%20Similarity%20II/README_EN.md) diff --git a/solution/0700-0799/0737.Sentence Similarity II/README_EN.md b/solution/0700-0799/0737.Sentence Similarity II/README_EN.md index 98b758dc3e977..21c96d2798390 100644 --- a/solution/0700-0799/0737.Sentence Similarity II/README_EN.md +++ b/solution/0700-0799/0737.Sentence Similarity II/README_EN.md @@ -1,4 +1,4 @@ -# [737. Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii) +# [737. Sentence Similarity II 🔒](https://leetcode.com/problems/sentence-similarity-ii) [中文文档](/solution/0700-0799/0737.Sentence%20Similarity%20II/README.md) diff --git a/solution/0700-0799/0742.Closest Leaf in a Binary Tree/README.md b/solution/0700-0799/0742.Closest Leaf in a Binary Tree/README.md index 8ada57a3b7354..307ef188078bf 100644 --- a/solution/0700-0799/0742.Closest Leaf in a Binary Tree/README.md +++ b/solution/0700-0799/0742.Closest Leaf in a Binary Tree/README.md @@ -1,4 +1,4 @@ -# [742. 二叉树最近的叶节点](https://leetcode.cn/problems/closest-leaf-in-a-binary-tree) +# [742. 二叉树最近的叶节点 🔒](https://leetcode.cn/problems/closest-leaf-in-a-binary-tree) [English Version](/solution/0700-0799/0742.Closest%20Leaf%20in%20a%20Binary%20Tree/README_EN.md) diff --git a/solution/0700-0799/0742.Closest Leaf in a Binary Tree/README_EN.md b/solution/0700-0799/0742.Closest Leaf in a Binary Tree/README_EN.md index 92021e0fa4d60..42f3bfabb29df 100644 --- a/solution/0700-0799/0742.Closest Leaf in a Binary Tree/README_EN.md +++ b/solution/0700-0799/0742.Closest Leaf in a Binary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [742. Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) +# [742. Closest Leaf in a Binary Tree 🔒](https://leetcode.com/problems/closest-leaf-in-a-binary-tree) [中文文档](/solution/0700-0799/0742.Closest%20Leaf%20in%20a%20Binary%20Tree/README.md) diff --git a/solution/0700-0799/0750.Number Of Corner Rectangles/README.md b/solution/0700-0799/0750.Number Of Corner Rectangles/README.md index 72135e8d9a3d9..acb792cb78e62 100644 --- a/solution/0700-0799/0750.Number Of Corner Rectangles/README.md +++ b/solution/0700-0799/0750.Number Of Corner Rectangles/README.md @@ -1,4 +1,4 @@ -# [750. 角矩形的数量](https://leetcode.cn/problems/number-of-corner-rectangles) +# [750. 角矩形的数量 🔒](https://leetcode.cn/problems/number-of-corner-rectangles) [English Version](/solution/0700-0799/0750.Number%20Of%20Corner%20Rectangles/README_EN.md) diff --git a/solution/0700-0799/0750.Number Of Corner Rectangles/README_EN.md b/solution/0700-0799/0750.Number Of Corner Rectangles/README_EN.md index ac79cfb4908f2..d1f5bf1dc7c95 100644 --- a/solution/0700-0799/0750.Number Of Corner Rectangles/README_EN.md +++ b/solution/0700-0799/0750.Number Of Corner Rectangles/README_EN.md @@ -1,4 +1,4 @@ -# [750. Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles) +# [750. Number Of Corner Rectangles 🔒](https://leetcode.com/problems/number-of-corner-rectangles) [中文文档](/solution/0700-0799/0750.Number%20Of%20Corner%20Rectangles/README.md) diff --git a/solution/0700-0799/0751.IP to CIDR/README.md b/solution/0700-0799/0751.IP to CIDR/README.md index 6b9c0a673c5f0..ba592ffd4d95f 100644 --- a/solution/0700-0799/0751.IP to CIDR/README.md +++ b/solution/0700-0799/0751.IP to CIDR/README.md @@ -1,4 +1,4 @@ -# [751. IP 到 CIDR](https://leetcode.cn/problems/ip-to-cidr) +# [751. IP 到 CIDR 🔒](https://leetcode.cn/problems/ip-to-cidr) [English Version](/solution/0700-0799/0751.IP%20to%20CIDR/README_EN.md) diff --git a/solution/0700-0799/0751.IP to CIDR/README_EN.md b/solution/0700-0799/0751.IP to CIDR/README_EN.md index b47bbdf642bfb..8b80504b4e228 100644 --- a/solution/0700-0799/0751.IP to CIDR/README_EN.md +++ b/solution/0700-0799/0751.IP to CIDR/README_EN.md @@ -1,4 +1,4 @@ -# [751. IP to CIDR](https://leetcode.com/problems/ip-to-cidr) +# [751. IP to CIDR 🔒](https://leetcode.com/problems/ip-to-cidr) [中文文档](/solution/0700-0799/0751.IP%20to%20CIDR/README.md) diff --git a/solution/0700-0799/0755.Pour Water/README.md b/solution/0700-0799/0755.Pour Water/README.md index 632d32e7a1545..c59e1034eb0d8 100644 --- a/solution/0700-0799/0755.Pour Water/README.md +++ b/solution/0700-0799/0755.Pour Water/README.md @@ -1,4 +1,4 @@ -# [755. 倒水](https://leetcode.cn/problems/pour-water) +# [755. 倒水 🔒](https://leetcode.cn/problems/pour-water) [English Version](/solution/0700-0799/0755.Pour%20Water/README_EN.md) diff --git a/solution/0700-0799/0755.Pour Water/README_EN.md b/solution/0700-0799/0755.Pour Water/README_EN.md index 8df49e72dd30f..73fc1923bded8 100644 --- a/solution/0700-0799/0755.Pour Water/README_EN.md +++ b/solution/0700-0799/0755.Pour Water/README_EN.md @@ -1,4 +1,4 @@ -# [755. Pour Water](https://leetcode.com/problems/pour-water) +# [755. Pour Water 🔒](https://leetcode.com/problems/pour-water) [中文文档](/solution/0700-0799/0755.Pour%20Water/README.md) diff --git a/solution/0700-0799/0758.Bold Words in String/README.md b/solution/0700-0799/0758.Bold Words in String/README.md index 35f19157e2662..1238fe10e573c 100644 --- a/solution/0700-0799/0758.Bold Words in String/README.md +++ b/solution/0700-0799/0758.Bold Words in String/README.md @@ -1,4 +1,4 @@ -# [758. 字符串中的加粗单词](https://leetcode.cn/problems/bold-words-in-string) +# [758. 字符串中的加粗单词 🔒](https://leetcode.cn/problems/bold-words-in-string) [English Version](/solution/0700-0799/0758.Bold%20Words%20in%20String/README_EN.md) diff --git a/solution/0700-0799/0758.Bold Words in String/README_EN.md b/solution/0700-0799/0758.Bold Words in String/README_EN.md index 20f79d2724cc5..a167dc704d7f0 100644 --- a/solution/0700-0799/0758.Bold Words in String/README_EN.md +++ b/solution/0700-0799/0758.Bold Words in String/README_EN.md @@ -1,4 +1,4 @@ -# [758. Bold Words in String](https://leetcode.com/problems/bold-words-in-string) +# [758. Bold Words in String 🔒](https://leetcode.com/problems/bold-words-in-string) [中文文档](/solution/0700-0799/0758.Bold%20Words%20in%20String/README.md) diff --git a/solution/0700-0799/0759.Employee Free Time/README.md b/solution/0700-0799/0759.Employee Free Time/README.md index 405da902660a8..0789656dfbecd 100644 --- a/solution/0700-0799/0759.Employee Free Time/README.md +++ b/solution/0700-0799/0759.Employee Free Time/README.md @@ -1,4 +1,4 @@ -# [759. 员工空闲时间](https://leetcode.cn/problems/employee-free-time) +# [759. 员工空闲时间 🔒](https://leetcode.cn/problems/employee-free-time) [English Version](/solution/0700-0799/0759.Employee%20Free%20Time/README_EN.md) diff --git a/solution/0700-0799/0759.Employee Free Time/README_EN.md b/solution/0700-0799/0759.Employee Free Time/README_EN.md index f94a33705c5ff..39a06c1e4abae 100644 --- a/solution/0700-0799/0759.Employee Free Time/README_EN.md +++ b/solution/0700-0799/0759.Employee Free Time/README_EN.md @@ -1,4 +1,4 @@ -# [759. Employee Free Time](https://leetcode.com/problems/employee-free-time) +# [759. Employee Free Time 🔒](https://leetcode.com/problems/employee-free-time) [中文文档](/solution/0700-0799/0759.Employee%20Free%20Time/README.md) diff --git a/solution/0700-0799/0760.Find Anagram Mappings/README.md b/solution/0700-0799/0760.Find Anagram Mappings/README.md index b0d43f5f95570..81b2f97e9154e 100644 --- a/solution/0700-0799/0760.Find Anagram Mappings/README.md +++ b/solution/0700-0799/0760.Find Anagram Mappings/README.md @@ -1,4 +1,4 @@ -# [760. 找出变位映射](https://leetcode.cn/problems/find-anagram-mappings) +# [760. 找出变位映射 🔒](https://leetcode.cn/problems/find-anagram-mappings) [English Version](/solution/0700-0799/0760.Find%20Anagram%20Mappings/README_EN.md) diff --git a/solution/0700-0799/0760.Find Anagram Mappings/README_EN.md b/solution/0700-0799/0760.Find Anagram Mappings/README_EN.md index 57cf9575b1b1b..6379d37dda925 100644 --- a/solution/0700-0799/0760.Find Anagram Mappings/README_EN.md +++ b/solution/0700-0799/0760.Find Anagram Mappings/README_EN.md @@ -1,4 +1,4 @@ -# [760. Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings) +# [760. Find Anagram Mappings 🔒](https://leetcode.com/problems/find-anagram-mappings) [中文文档](/solution/0700-0799/0760.Find%20Anagram%20Mappings/README.md) diff --git a/solution/0700-0799/0772.Basic Calculator III/README.md b/solution/0700-0799/0772.Basic Calculator III/README.md index f40e30cd041db..fabe65ebfe057 100644 --- a/solution/0700-0799/0772.Basic Calculator III/README.md +++ b/solution/0700-0799/0772.Basic Calculator III/README.md @@ -1,4 +1,4 @@ -# [772. 基本计算器 III](https://leetcode.cn/problems/basic-calculator-iii) +# [772. 基本计算器 III 🔒](https://leetcode.cn/problems/basic-calculator-iii) [English Version](/solution/0700-0799/0772.Basic%20Calculator%20III/README_EN.md) diff --git a/solution/0700-0799/0772.Basic Calculator III/README_EN.md b/solution/0700-0799/0772.Basic Calculator III/README_EN.md index 389afb6017d2b..a528a93d13b1a 100644 --- a/solution/0700-0799/0772.Basic Calculator III/README_EN.md +++ b/solution/0700-0799/0772.Basic Calculator III/README_EN.md @@ -1,4 +1,4 @@ -# [772. Basic Calculator III](https://leetcode.com/problems/basic-calculator-iii) +# [772. Basic Calculator III 🔒](https://leetcode.com/problems/basic-calculator-iii) [中文文档](/solution/0700-0799/0772.Basic%20Calculator%20III/README.md) diff --git a/solution/0700-0799/0774.Minimize Max Distance to Gas Station/README.md b/solution/0700-0799/0774.Minimize Max Distance to Gas Station/README.md index c0d23ab97146f..891d850150b2f 100644 --- a/solution/0700-0799/0774.Minimize Max Distance to Gas Station/README.md +++ b/solution/0700-0799/0774.Minimize Max Distance to Gas Station/README.md @@ -1,4 +1,4 @@ -# [774. 最小化去加油站的最大距离](https://leetcode.cn/problems/minimize-max-distance-to-gas-station) +# [774. 最小化去加油站的最大距离 🔒](https://leetcode.cn/problems/minimize-max-distance-to-gas-station) [English Version](/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README_EN.md) diff --git a/solution/0700-0799/0774.Minimize Max Distance to Gas Station/README_EN.md b/solution/0700-0799/0774.Minimize Max Distance to Gas Station/README_EN.md index 238c8d7b71a5e..3b7b3b23fef1b 100644 --- a/solution/0700-0799/0774.Minimize Max Distance to Gas Station/README_EN.md +++ b/solution/0700-0799/0774.Minimize Max Distance to Gas Station/README_EN.md @@ -1,4 +1,4 @@ -# [774. Minimize Max Distance to Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station) +# [774. Minimize Max Distance to Gas Station 🔒](https://leetcode.com/problems/minimize-max-distance-to-gas-station) [中文文档](/solution/0700-0799/0774.Minimize%20Max%20Distance%20to%20Gas%20Station/README.md) diff --git a/solution/0700-0799/0776.Split BST/README.md b/solution/0700-0799/0776.Split BST/README.md index b4366e9fb47c9..b7ac6c8689134 100644 --- a/solution/0700-0799/0776.Split BST/README.md +++ b/solution/0700-0799/0776.Split BST/README.md @@ -1,4 +1,4 @@ -# [776. 拆分二叉搜索树](https://leetcode.cn/problems/split-bst) +# [776. 拆分二叉搜索树 🔒](https://leetcode.cn/problems/split-bst) [English Version](/solution/0700-0799/0776.Split%20BST/README_EN.md) diff --git a/solution/0700-0799/0776.Split BST/README_EN.md b/solution/0700-0799/0776.Split BST/README_EN.md index 5bf3694cc355b..30cb5422514ee 100644 --- a/solution/0700-0799/0776.Split BST/README_EN.md +++ b/solution/0700-0799/0776.Split BST/README_EN.md @@ -1,4 +1,4 @@ -# [776. Split BST](https://leetcode.com/problems/split-bst) +# [776. Split BST 🔒](https://leetcode.com/problems/split-bst) [中文文档](/solution/0700-0799/0776.Split%20BST/README.md) diff --git a/solution/0800-0899/0800.Similar RGB Color/README.md b/solution/0800-0899/0800.Similar RGB Color/README.md index 7f0eadebc371e..6929c7bf719f7 100644 --- a/solution/0800-0899/0800.Similar RGB Color/README.md +++ b/solution/0800-0899/0800.Similar RGB Color/README.md @@ -1,4 +1,4 @@ -# [800. 相似 RGB 颜色](https://leetcode.cn/problems/similar-rgb-color) +# [800. 相似 RGB 颜色 🔒](https://leetcode.cn/problems/similar-rgb-color) [English Version](/solution/0800-0899/0800.Similar%20RGB%20Color/README_EN.md) diff --git a/solution/0800-0899/0800.Similar RGB Color/README_EN.md b/solution/0800-0899/0800.Similar RGB Color/README_EN.md index 2401813ea7c03..c116eb3edf3d9 100644 --- a/solution/0800-0899/0800.Similar RGB Color/README_EN.md +++ b/solution/0800-0899/0800.Similar RGB Color/README_EN.md @@ -1,4 +1,4 @@ -# [800. Similar RGB Color](https://leetcode.com/problems/similar-rgb-color) +# [800. Similar RGB Color 🔒](https://leetcode.com/problems/similar-rgb-color) [中文文档](/solution/0800-0899/0800.Similar%20RGB%20Color/README.md) diff --git a/solution/1000-1099/1055.Shortest Way to Form String/README.md b/solution/1000-1099/1055.Shortest Way to Form String/README.md index f96e3bcc8d273..742845c80e0b4 100644 --- a/solution/1000-1099/1055.Shortest Way to Form String/README.md +++ b/solution/1000-1099/1055.Shortest Way to Form String/README.md @@ -1,4 +1,4 @@ -# [1055. 形成字符串的最短路径](https://leetcode.cn/problems/shortest-way-to-form-string) +# [1055. 形成字符串的最短路径 🔒](https://leetcode.cn/problems/shortest-way-to-form-string) [English Version](/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README_EN.md) diff --git a/solution/1000-1099/1055.Shortest Way to Form String/README_EN.md b/solution/1000-1099/1055.Shortest Way to Form String/README_EN.md index 8d33ec409be8f..2622275eb1871 100644 --- a/solution/1000-1099/1055.Shortest Way to Form String/README_EN.md +++ b/solution/1000-1099/1055.Shortest Way to Form String/README_EN.md @@ -1,4 +1,4 @@ -# [1055. Shortest Way to Form String](https://leetcode.com/problems/shortest-way-to-form-string) +# [1055. Shortest Way to Form String 🔒](https://leetcode.com/problems/shortest-way-to-form-string) [中文文档](/solution/1000-1099/1055.Shortest%20Way%20to%20Form%20String/README.md) diff --git a/solution/1000-1099/1056.Confusing Number/README.md b/solution/1000-1099/1056.Confusing Number/README.md index 51fd579e93ef7..a66633361adbc 100644 --- a/solution/1000-1099/1056.Confusing Number/README.md +++ b/solution/1000-1099/1056.Confusing Number/README.md @@ -1,4 +1,4 @@ -# [1056. 易混淆数](https://leetcode.cn/problems/confusing-number) +# [1056. 易混淆数 🔒](https://leetcode.cn/problems/confusing-number) [English Version](/solution/1000-1099/1056.Confusing%20Number/README_EN.md) diff --git a/solution/1000-1099/1056.Confusing Number/README_EN.md b/solution/1000-1099/1056.Confusing Number/README_EN.md index f37a095d593f8..ed5bd827e1a1b 100644 --- a/solution/1000-1099/1056.Confusing Number/README_EN.md +++ b/solution/1000-1099/1056.Confusing Number/README_EN.md @@ -1,4 +1,4 @@ -# [1056. Confusing Number](https://leetcode.com/problems/confusing-number) +# [1056. Confusing Number 🔒](https://leetcode.com/problems/confusing-number) [中文文档](/solution/1000-1099/1056.Confusing%20Number/README.md) diff --git a/solution/1000-1099/1057.Campus Bikes/README.md b/solution/1000-1099/1057.Campus Bikes/README.md index ab377ae875759..50dc2524d1d25 100644 --- a/solution/1000-1099/1057.Campus Bikes/README.md +++ b/solution/1000-1099/1057.Campus Bikes/README.md @@ -1,4 +1,4 @@ -# [1057. 校园自行车分配](https://leetcode.cn/problems/campus-bikes) +# [1057. 校园自行车分配 🔒](https://leetcode.cn/problems/campus-bikes) [English Version](/solution/1000-1099/1057.Campus%20Bikes/README_EN.md) diff --git a/solution/1000-1099/1057.Campus Bikes/README_EN.md b/solution/1000-1099/1057.Campus Bikes/README_EN.md index ada92b0cad7b5..772ae5c169e81 100644 --- a/solution/1000-1099/1057.Campus Bikes/README_EN.md +++ b/solution/1000-1099/1057.Campus Bikes/README_EN.md @@ -1,4 +1,4 @@ -# [1057. Campus Bikes](https://leetcode.com/problems/campus-bikes) +# [1057. Campus Bikes 🔒](https://leetcode.com/problems/campus-bikes) [中文文档](/solution/1000-1099/1057.Campus%20Bikes/README.md) diff --git a/solution/1000-1099/1058.Minimize Rounding Error to Meet Target/README.md b/solution/1000-1099/1058.Minimize Rounding Error to Meet Target/README.md index 7560dede232ba..262179b8b9bb3 100644 --- a/solution/1000-1099/1058.Minimize Rounding Error to Meet Target/README.md +++ b/solution/1000-1099/1058.Minimize Rounding Error to Meet Target/README.md @@ -1,4 +1,4 @@ -# [1058. 最小化舍入误差以满足目标](https://leetcode.cn/problems/minimize-rounding-error-to-meet-target) +# [1058. 最小化舍入误差以满足目标 🔒](https://leetcode.cn/problems/minimize-rounding-error-to-meet-target) [English Version](/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README_EN.md) diff --git a/solution/1000-1099/1058.Minimize Rounding Error to Meet Target/README_EN.md b/solution/1000-1099/1058.Minimize Rounding Error to Meet Target/README_EN.md index 124544483251f..4eff7501f62b5 100644 --- a/solution/1000-1099/1058.Minimize Rounding Error to Meet Target/README_EN.md +++ b/solution/1000-1099/1058.Minimize Rounding Error to Meet Target/README_EN.md @@ -1,4 +1,4 @@ -# [1058. Minimize Rounding Error to Meet Target](https://leetcode.com/problems/minimize-rounding-error-to-meet-target) +# [1058. Minimize Rounding Error to Meet Target 🔒](https://leetcode.com/problems/minimize-rounding-error-to-meet-target) [中文文档](/solution/1000-1099/1058.Minimize%20Rounding%20Error%20to%20Meet%20Target/README.md) diff --git a/solution/1000-1099/1059.All Paths from Source Lead to Destination/README.md b/solution/1000-1099/1059.All Paths from Source Lead to Destination/README.md index 52cce50bd3522..edc28e9db4c06 100644 --- a/solution/1000-1099/1059.All Paths from Source Lead to Destination/README.md +++ b/solution/1000-1099/1059.All Paths from Source Lead to Destination/README.md @@ -1,4 +1,4 @@ -# [1059. 从始点到终点的所有路径](https://leetcode.cn/problems/all-paths-from-source-lead-to-destination) +# [1059. 从始点到终点的所有路径 🔒](https://leetcode.cn/problems/all-paths-from-source-lead-to-destination) [English Version](/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README_EN.md) diff --git a/solution/1000-1099/1059.All Paths from Source Lead to Destination/README_EN.md b/solution/1000-1099/1059.All Paths from Source Lead to Destination/README_EN.md index d77c388bb8851..aa2fd42279d4a 100644 --- a/solution/1000-1099/1059.All Paths from Source Lead to Destination/README_EN.md +++ b/solution/1000-1099/1059.All Paths from Source Lead to Destination/README_EN.md @@ -1,4 +1,4 @@ -# [1059. All Paths from Source Lead to Destination](https://leetcode.com/problems/all-paths-from-source-lead-to-destination) +# [1059. All Paths from Source Lead to Destination 🔒](https://leetcode.com/problems/all-paths-from-source-lead-to-destination) [中文文档](/solution/1000-1099/1059.All%20Paths%20from%20Source%20Lead%20to%20Destination/README.md) diff --git a/solution/1000-1099/1060.Missing Element in Sorted Array/README.md b/solution/1000-1099/1060.Missing Element in Sorted Array/README.md index 97addd441ef62..4f6f4de91947a 100644 --- a/solution/1000-1099/1060.Missing Element in Sorted Array/README.md +++ b/solution/1000-1099/1060.Missing Element in Sorted Array/README.md @@ -1,4 +1,4 @@ -# [1060. 有序数组中的缺失元素](https://leetcode.cn/problems/missing-element-in-sorted-array) +# [1060. 有序数组中的缺失元素 🔒](https://leetcode.cn/problems/missing-element-in-sorted-array) [English Version](/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README_EN.md) diff --git a/solution/1000-1099/1060.Missing Element in Sorted Array/README_EN.md b/solution/1000-1099/1060.Missing Element in Sorted Array/README_EN.md index 0b79ca31e7505..2110a7157a8cf 100644 --- a/solution/1000-1099/1060.Missing Element in Sorted Array/README_EN.md +++ b/solution/1000-1099/1060.Missing Element in Sorted Array/README_EN.md @@ -1,4 +1,4 @@ -# [1060. Missing Element in Sorted Array](https://leetcode.com/problems/missing-element-in-sorted-array) +# [1060. Missing Element in Sorted Array 🔒](https://leetcode.com/problems/missing-element-in-sorted-array) [中文文档](/solution/1000-1099/1060.Missing%20Element%20in%20Sorted%20Array/README.md) diff --git a/solution/1000-1099/1062.Longest Repeating Substring/README.md b/solution/1000-1099/1062.Longest Repeating Substring/README.md index dc67cf8cb5234..e78b087107f34 100644 --- a/solution/1000-1099/1062.Longest Repeating Substring/README.md +++ b/solution/1000-1099/1062.Longest Repeating Substring/README.md @@ -1,4 +1,4 @@ -# [1062. 最长重复子串](https://leetcode.cn/problems/longest-repeating-substring) +# [1062. 最长重复子串 🔒](https://leetcode.cn/problems/longest-repeating-substring) [English Version](/solution/1000-1099/1062.Longest%20Repeating%20Substring/README_EN.md) @@ -52,7 +52,7 @@ ### 方法一：动态规划 -定义 $dp[i][j]$ 表示以 $s[i]$ 和 $s[j]$ 结尾的最长重复子串的长度。状态转移方程为： +定义 $dp[i][j]$ 表示以 $s[i]$ 和 $s[j]$ 结尾的最长重复子串 🔒 的长度。状态转移方程为： $$ dp[i][j]= @@ -69,7 +69,7 @@ $$ 相似题目： -- [1044. 最长重复子串](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md) +- [1044. 最长重复子串 🔒](https://github.com/doocs/leetcode/blob/main/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md) diff --git a/solution/1000-1099/1062.Longest Repeating Substring/README_EN.md b/solution/1000-1099/1062.Longest Repeating Substring/README_EN.md index de5fffbfff0ac..ff7d6045ef274 100644 --- a/solution/1000-1099/1062.Longest Repeating Substring/README_EN.md +++ b/solution/1000-1099/1062.Longest Repeating Substring/README_EN.md @@ -1,4 +1,4 @@ -# [1062. Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring) +# [1062. Longest Repeating Substring 🔒](https://leetcode.com/problems/longest-repeating-substring) [中文文档](/solution/1000-1099/1062.Longest%20Repeating%20Substring/README.md) diff --git a/solution/1000-1099/1063.Number of Valid Subarrays/README.md b/solution/1000-1099/1063.Number of Valid Subarrays/README.md index bd05cad1eff55..39b27436bf402 100644 --- a/solution/1000-1099/1063.Number of Valid Subarrays/README.md +++ b/solution/1000-1099/1063.Number of Valid Subarrays/README.md @@ -1,4 +1,4 @@ -# [1063. 有效子数组的数目](https://leetcode.cn/problems/number-of-valid-subarrays) +# [1063. 有效子数组的数目 🔒](https://leetcode.cn/problems/number-of-valid-subarrays) [English Version](/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README_EN.md) diff --git a/solution/1000-1099/1063.Number of Valid Subarrays/README_EN.md b/solution/1000-1099/1063.Number of Valid Subarrays/README_EN.md index 6fe888dd1985c..12a24aab8fe0d 100644 --- a/solution/1000-1099/1063.Number of Valid Subarrays/README_EN.md +++ b/solution/1000-1099/1063.Number of Valid Subarrays/README_EN.md @@ -1,4 +1,4 @@ -# [1063. Number of Valid Subarrays](https://leetcode.com/problems/number-of-valid-subarrays) +# [1063. Number of Valid Subarrays 🔒](https://leetcode.com/problems/number-of-valid-subarrays) [中文文档](/solution/1000-1099/1063.Number%20of%20Valid%20Subarrays/README.md) diff --git a/solution/1000-1099/1064.Fixed Point/README.md b/solution/1000-1099/1064.Fixed Point/README.md index 8a0186a29e07e..2d3dd1fb44aaa 100644 --- a/solution/1000-1099/1064.Fixed Point/README.md +++ b/solution/1000-1099/1064.Fixed Point/README.md @@ -1,4 +1,4 @@ -# [1064. 不动点](https://leetcode.cn/problems/fixed-point) +# [1064. 不动点 🔒](https://leetcode.cn/problems/fixed-point) [English Version](/solution/1000-1099/1064.Fixed%20Point/README_EN.md) @@ -55,9 +55,9 @@ 题目给定的数组是按升序排列的，因此我们可以使用二分查找的方法找出最小的满足 $arr[i]$ 等于 $i$ 的下标 $i$。 -我们定义二分查找的左边界 $left=0$，右边界 $right=n-1$。每一次，我们找到当前的中间位置 $mid$，如果中间位置满足 $arr[mid] \geq mid$，那么我们就确定了最小的不动点的位置一定不会出现在下标大于 $mid$ 的位置，因此我们令 $right=mid$；如果中间位置满足 $arr[mid] \lt mid$，那么最小的不动点一定出现在下标大于 $mid$ 的位置，因此我们令 $left=mid+1$。 +我们定义二分查找的左边界 $left=0$，右边界 $right=n-1$。每一次，我们找到当前的中间位置 $mid$，如果中间位置满足 $arr[mid] \geq mid$，那么我们就确定了最小的不动点 🔒 的位置一定不会出现在下标大于 $mid$ 的位置，因此我们令 $right=mid$；如果中间位置满足 $arr[mid] \lt mid$，那么最小的不动点 🔒 一定出现在下标大于 $mid$ 的位置，因此我们令 $left=mid+1$。 -最后，如果我们没有找到最小的不动点，那么我们返回 $-1$。 +最后，如果我们没有找到最小的不动点 🔒，那么我们返回 $-1$。 时间复杂度 $O(\log n)$，其中 $n$ 是数组的长度。空间复杂度 $O(1)$。 diff --git a/solution/1000-1099/1064.Fixed Point/README_EN.md b/solution/1000-1099/1064.Fixed Point/README_EN.md index e99bc9932d4eb..5e7fe69ae4fc9 100644 --- a/solution/1000-1099/1064.Fixed Point/README_EN.md +++ b/solution/1000-1099/1064.Fixed Point/README_EN.md @@ -1,4 +1,4 @@ -# [1064. Fixed Point](https://leetcode.com/problems/fixed-point) +# [1064. Fixed Point 🔒](https://leetcode.com/problems/fixed-point) [中文文档](/solution/1000-1099/1064.Fixed%20Point/README.md) diff --git a/solution/1000-1099/1065.Index Pairs of a String/README.md b/solution/1000-1099/1065.Index Pairs of a String/README.md index 61cba75de99b7..cf6c7c3b1c051 100644 --- a/solution/1000-1099/1065.Index Pairs of a String/README.md +++ b/solution/1000-1099/1065.Index Pairs of a String/README.md @@ -1,4 +1,4 @@ -# [1065. 字符串的索引对](https://leetcode.cn/problems/index-pairs-of-a-string) +# [1065. 字符串的索引对 🔒](https://leetcode.cn/problems/index-pairs-of-a-string) [English Version](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README_EN.md) diff --git a/solution/1000-1099/1065.Index Pairs of a String/README_EN.md b/solution/1000-1099/1065.Index Pairs of a String/README_EN.md index 9dd0ab69ba052..692c4282c9ef4 100644 --- a/solution/1000-1099/1065.Index Pairs of a String/README_EN.md +++ b/solution/1000-1099/1065.Index Pairs of a String/README_EN.md @@ -1,4 +1,4 @@ -# [1065. Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string) +# [1065. Index Pairs of a String 🔒](https://leetcode.com/problems/index-pairs-of-a-string) [中文文档](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md) diff --git a/solution/1000-1099/1066.Campus Bikes II/README.md b/solution/1000-1099/1066.Campus Bikes II/README.md index f91ea281b65d2..a8d84c090af6c 100644 --- a/solution/1000-1099/1066.Campus Bikes II/README.md +++ b/solution/1000-1099/1066.Campus Bikes II/README.md @@ -1,4 +1,4 @@ -# [1066. 校园自行车分配 II](https://leetcode.cn/problems/campus-bikes-ii) +# [1066. 校园自行车分配 II 🔒](https://leetcode.cn/problems/campus-bikes-ii) [English Version](/solution/1000-1099/1066.Campus%20Bikes%20II/README_EN.md) diff --git a/solution/1000-1099/1066.Campus Bikes II/README_EN.md b/solution/1000-1099/1066.Campus Bikes II/README_EN.md index eb13994d8c343..9edf3eb238e88 100644 --- a/solution/1000-1099/1066.Campus Bikes II/README_EN.md +++ b/solution/1000-1099/1066.Campus Bikes II/README_EN.md @@ -1,4 +1,4 @@ -# [1066. Campus Bikes II](https://leetcode.com/problems/campus-bikes-ii) +# [1066. Campus Bikes II 🔒](https://leetcode.com/problems/campus-bikes-ii) [中文文档](/solution/1000-1099/1066.Campus%20Bikes%20II/README.md) diff --git a/solution/1000-1099/1067.Digit Count in Range/README.md b/solution/1000-1099/1067.Digit Count in Range/README.md index 877d48271f5a7..ba0cb3ce7bd08 100644 --- a/solution/1000-1099/1067.Digit Count in Range/README.md +++ b/solution/1000-1099/1067.Digit Count in Range/README.md @@ -1,4 +1,4 @@ -# [1067. 范围内的数字计数](https://leetcode.cn/problems/digit-count-in-range) +# [1067. 范围内的数字计数 🔒](https://leetcode.cn/problems/digit-count-in-range) [English Version](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README_EN.md) diff --git a/solution/1000-1099/1067.Digit Count in Range/README_EN.md b/solution/1000-1099/1067.Digit Count in Range/README_EN.md index c047b7ee47f6d..2197da13ea8e2 100644 --- a/solution/1000-1099/1067.Digit Count in Range/README_EN.md +++ b/solution/1000-1099/1067.Digit Count in Range/README_EN.md @@ -1,4 +1,4 @@ -# [1067. Digit Count in Range](https://leetcode.com/problems/digit-count-in-range) +# [1067. Digit Count in Range 🔒](https://leetcode.com/problems/digit-count-in-range) [中文文档](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README.md) diff --git a/solution/1000-1099/1069.Product Sales Analysis II/README.md b/solution/1000-1099/1069.Product Sales Analysis II/README.md index 15f202108a293..d38115a61996c 100644 --- a/solution/1000-1099/1069.Product Sales Analysis II/README.md +++ b/solution/1000-1099/1069.Product Sales Analysis II/README.md @@ -1,4 +1,4 @@ -# [1069. 产品销售分析 II](https://leetcode.cn/problems/product-sales-analysis-ii) +# [1069. 产品销售分析 II 🔒](https://leetcode.cn/problems/product-sales-analysis-ii) [English Version](/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README_EN.md) diff --git a/solution/1000-1099/1069.Product Sales Analysis II/README_EN.md b/solution/1000-1099/1069.Product Sales Analysis II/README_EN.md index e8a459194be33..92c51da5a10cb 100644 --- a/solution/1000-1099/1069.Product Sales Analysis II/README_EN.md +++ b/solution/1000-1099/1069.Product Sales Analysis II/README_EN.md @@ -1,4 +1,4 @@ -# [1069. Product Sales Analysis II](https://leetcode.com/problems/product-sales-analysis-ii) +# [1069. Product Sales Analysis II 🔒](https://leetcode.com/problems/product-sales-analysis-ii) [中文文档](/solution/1000-1099/1069.Product%20Sales%20Analysis%20II/README.md) diff --git a/solution/1000-1099/1076.Project Employees II/README.md b/solution/1000-1099/1076.Project Employees II/README.md index 365f01990c04d..e37c935242845 100644 --- a/solution/1000-1099/1076.Project Employees II/README.md +++ b/solution/1000-1099/1076.Project Employees II/README.md @@ -1,4 +1,4 @@ -# [1076. 项目员工 II](https://leetcode.cn/problems/project-employees-ii) +# [1076. 项目员工 II 🔒](https://leetcode.cn/problems/project-employees-ii) [English Version](/solution/1000-1099/1076.Project%20Employees%20II/README_EN.md) diff --git a/solution/1000-1099/1076.Project Employees II/README_EN.md b/solution/1000-1099/1076.Project Employees II/README_EN.md index d1ed99c1a4fa7..82d3714e93a6e 100644 --- a/solution/1000-1099/1076.Project Employees II/README_EN.md +++ b/solution/1000-1099/1076.Project Employees II/README_EN.md @@ -1,4 +1,4 @@ -# [1076. Project Employees II](https://leetcode.com/problems/project-employees-ii) +# [1076. Project Employees II 🔒](https://leetcode.com/problems/project-employees-ii) [中文文档](/solution/1000-1099/1076.Project%20Employees%20II/README.md) diff --git a/solution/1000-1099/1077.Project Employees III/README.md b/solution/1000-1099/1077.Project Employees III/README.md index c50912b6e7b1c..eab739961e7ec 100644 --- a/solution/1000-1099/1077.Project Employees III/README.md +++ b/solution/1000-1099/1077.Project Employees III/README.md @@ -1,4 +1,4 @@ -# [1077. 项目员工 III](https://leetcode.cn/problems/project-employees-iii) +# [1077. 项目员工 III 🔒](https://leetcode.cn/problems/project-employees-iii) [English Version](/solution/1000-1099/1077.Project%20Employees%20III/README_EN.md) diff --git a/solution/1000-1099/1077.Project Employees III/README_EN.md b/solution/1000-1099/1077.Project Employees III/README_EN.md index 0b0dabb634332..a151c962c4c64 100644 --- a/solution/1000-1099/1077.Project Employees III/README_EN.md +++ b/solution/1000-1099/1077.Project Employees III/README_EN.md @@ -1,4 +1,4 @@ -# [1077. Project Employees III](https://leetcode.com/problems/project-employees-iii) +# [1077. Project Employees III 🔒](https://leetcode.com/problems/project-employees-iii) [中文文档](/solution/1000-1099/1077.Project%20Employees%20III/README.md) diff --git a/solution/1000-1099/1082.Sales Analysis I/README.md b/solution/1000-1099/1082.Sales Analysis I/README.md index 06c560c605d91..b366f43c0011f 100644 --- a/solution/1000-1099/1082.Sales Analysis I/README.md +++ b/solution/1000-1099/1082.Sales Analysis I/README.md @@ -1,4 +1,4 @@ -# [1082. 销售分析 I ](https://leetcode.cn/problems/sales-analysis-i) +# [1082. 销售分析 I 🔒](https://leetcode.cn/problems/sales-analysis-i) [English Version](/solution/1000-1099/1082.Sales%20Analysis%20I/README_EN.md) diff --git a/solution/1000-1099/1082.Sales Analysis I/README_EN.md b/solution/1000-1099/1082.Sales Analysis I/README_EN.md index 8fa637013ee10..5bf7ff1f0d130 100644 --- a/solution/1000-1099/1082.Sales Analysis I/README_EN.md +++ b/solution/1000-1099/1082.Sales Analysis I/README_EN.md @@ -1,4 +1,4 @@ -# [1082. Sales Analysis I](https://leetcode.com/problems/sales-analysis-i) +# [1082. Sales Analysis I 🔒](https://leetcode.com/problems/sales-analysis-i) [中文文档](/solution/1000-1099/1082.Sales%20Analysis%20I/README.md) diff --git a/solution/1000-1099/1083.Sales Analysis II/README.md b/solution/1000-1099/1083.Sales Analysis II/README.md index d06757378e44a..edcf015759584 100644 --- a/solution/1000-1099/1083.Sales Analysis II/README.md +++ b/solution/1000-1099/1083.Sales Analysis II/README.md @@ -1,4 +1,4 @@ -# [1083. 销售分析 II](https://leetcode.cn/problems/sales-analysis-ii) +# [1083. 销售分析 II 🔒](https://leetcode.cn/problems/sales-analysis-ii) [English Version](/solution/1000-1099/1083.Sales%20Analysis%20II/README_EN.md) diff --git a/solution/1000-1099/1083.Sales Analysis II/README_EN.md b/solution/1000-1099/1083.Sales Analysis II/README_EN.md index a90ba5f86fdea..9f90b68fb7334 100644 --- a/solution/1000-1099/1083.Sales Analysis II/README_EN.md +++ b/solution/1000-1099/1083.Sales Analysis II/README_EN.md @@ -1,4 +1,4 @@ -# [1083. Sales Analysis II](https://leetcode.com/problems/sales-analysis-ii) +# [1083. Sales Analysis II 🔒](https://leetcode.com/problems/sales-analysis-ii) [中文文档](/solution/1000-1099/1083.Sales%20Analysis%20II/README.md) diff --git a/solution/1000-1099/1085.Sum of Digits in the Minimum Number/README.md b/solution/1000-1099/1085.Sum of Digits in the Minimum Number/README.md index 041a837ba34fc..5ba4d41941f17 100644 --- a/solution/1000-1099/1085.Sum of Digits in the Minimum Number/README.md +++ b/solution/1000-1099/1085.Sum of Digits in the Minimum Number/README.md @@ -1,4 +1,4 @@ -# [1085. 最小元素各数位之和](https://leetcode.cn/problems/sum-of-digits-in-the-minimum-number) +# [1085. 最小元素各数位之和 🔒](https://leetcode.cn/problems/sum-of-digits-in-the-minimum-number) [English Version](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README_EN.md) diff --git a/solution/1000-1099/1085.Sum of Digits in the Minimum Number/README_EN.md b/solution/1000-1099/1085.Sum of Digits in the Minimum Number/README_EN.md index 09c60900e1d1e..9fc0cd97bdf6e 100644 --- a/solution/1000-1099/1085.Sum of Digits in the Minimum Number/README_EN.md +++ b/solution/1000-1099/1085.Sum of Digits in the Minimum Number/README_EN.md @@ -1,4 +1,4 @@ -# [1085. Sum of Digits in the Minimum Number](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number) +# [1085. Sum of Digits in the Minimum Number 🔒](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number) [中文文档](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README.md) diff --git a/solution/1000-1099/1086.High Five/README.md b/solution/1000-1099/1086.High Five/README.md index 3739466d3b4b5..9b87e4d80fe05 100644 --- a/solution/1000-1099/1086.High Five/README.md +++ b/solution/1000-1099/1086.High Five/README.md @@ -1,4 +1,4 @@ -# [1086. 前五科的均分](https://leetcode.cn/problems/high-five) +# [1086. 前五科的均分 🔒](https://leetcode.cn/problems/high-five) [English Version](/solution/1000-1099/1086.High%20Five/README_EN.md) diff --git a/solution/1000-1099/1086.High Five/README_EN.md b/solution/1000-1099/1086.High Five/README_EN.md index 5a038ea3d392e..2acb873021285 100644 --- a/solution/1000-1099/1086.High Five/README_EN.md +++ b/solution/1000-1099/1086.High Five/README_EN.md @@ -1,4 +1,4 @@ -# [1086. High Five](https://leetcode.com/problems/high-five) +# [1086. High Five 🔒](https://leetcode.com/problems/high-five) [中文文档](/solution/1000-1099/1086.High%20Five/README.md) diff --git a/solution/1000-1099/1087.Brace Expansion/README.md b/solution/1000-1099/1087.Brace Expansion/README.md index a785e3214ea01..cca757782c11d 100644 --- a/solution/1000-1099/1087.Brace Expansion/README.md +++ b/solution/1000-1099/1087.Brace Expansion/README.md @@ -1,4 +1,4 @@ -# [1087. 花括号展开](https://leetcode.cn/problems/brace-expansion) +# [1087. 花括号展开 🔒](https://leetcode.cn/problems/brace-expansion) [English Version](/solution/1000-1099/1087.Brace%20Expansion/README_EN.md) diff --git a/solution/1000-1099/1087.Brace Expansion/README_EN.md b/solution/1000-1099/1087.Brace Expansion/README_EN.md index 48c7357994e78..3f7c2f96df893 100644 --- a/solution/1000-1099/1087.Brace Expansion/README_EN.md +++ b/solution/1000-1099/1087.Brace Expansion/README_EN.md @@ -1,4 +1,4 @@ -# [1087. Brace Expansion](https://leetcode.com/problems/brace-expansion) +# [1087. Brace Expansion 🔒](https://leetcode.com/problems/brace-expansion) [中文文档](/solution/1000-1099/1087.Brace%20Expansion/README.md) diff --git a/solution/1000-1099/1088.Confusing Number II/README.md b/solution/1000-1099/1088.Confusing Number II/README.md index bc77561389c66..59b9ae2369eea 100644 --- a/solution/1000-1099/1088.Confusing Number II/README.md +++ b/solution/1000-1099/1088.Confusing Number II/README.md @@ -1,4 +1,4 @@ -# [1088. 易混淆数 II](https://leetcode.cn/problems/confusing-number-ii) +# [1088. 易混淆数 II 🔒](https://leetcode.cn/problems/confusing-number-ii) [English Version](/solution/1000-1099/1088.Confusing%20Number%20II/README_EN.md) diff --git a/solution/1000-1099/1088.Confusing Number II/README_EN.md b/solution/1000-1099/1088.Confusing Number II/README_EN.md index 1c617ba02228c..1e5a169c1be28 100644 --- a/solution/1000-1099/1088.Confusing Number II/README_EN.md +++ b/solution/1000-1099/1088.Confusing Number II/README_EN.md @@ -1,4 +1,4 @@ -# [1088. Confusing Number II](https://leetcode.com/problems/confusing-number-ii) +# [1088. Confusing Number II 🔒](https://leetcode.com/problems/confusing-number-ii) [中文文档](/solution/1000-1099/1088.Confusing%20Number%20II/README.md) diff --git a/solution/1000-1099/1097.Game Play Analysis V/README.md b/solution/1000-1099/1097.Game Play Analysis V/README.md index f99ccec81330c..77e5059c26359 100644 --- a/solution/1000-1099/1097.Game Play Analysis V/README.md +++ b/solution/1000-1099/1097.Game Play Analysis V/README.md @@ -1,4 +1,4 @@ -# [1097. 游戏玩法分析 V](https://leetcode.cn/problems/game-play-analysis-v) +# [1097. 游戏玩法分析 V 🔒](https://leetcode.cn/problems/game-play-analysis-v) [English Version](/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README_EN.md) diff --git a/solution/1000-1099/1097.Game Play Analysis V/README_EN.md b/solution/1000-1099/1097.Game Play Analysis V/README_EN.md index 0f82abae2bac8..a7501fe8265f9 100644 --- a/solution/1000-1099/1097.Game Play Analysis V/README_EN.md +++ b/solution/1000-1099/1097.Game Play Analysis V/README_EN.md @@ -1,4 +1,4 @@ -# [1097. Game Play Analysis V](https://leetcode.com/problems/game-play-analysis-v) +# [1097. Game Play Analysis V 🔒](https://leetcode.com/problems/game-play-analysis-v) [中文文档](/solution/1000-1099/1097.Game%20Play%20Analysis%20V/README.md) diff --git a/solution/1000-1099/1098.Unpopular Books/README.md b/solution/1000-1099/1098.Unpopular Books/README.md index fcbf99373868d..1a12fcf0d7df1 100644 --- a/solution/1000-1099/1098.Unpopular Books/README.md +++ b/solution/1000-1099/1098.Unpopular Books/README.md @@ -1,4 +1,4 @@ -# [1098. 小众书籍](https://leetcode.cn/problems/unpopular-books) +# [1098. 小众书籍 🔒](https://leetcode.cn/problems/unpopular-books) [English Version](/solution/1000-1099/1098.Unpopular%20Books/README_EN.md) diff --git a/solution/1000-1099/1098.Unpopular Books/README_EN.md b/solution/1000-1099/1098.Unpopular Books/README_EN.md index 05ef5ad1f6833..d4e11089f8ee7 100644 --- a/solution/1000-1099/1098.Unpopular Books/README_EN.md +++ b/solution/1000-1099/1098.Unpopular Books/README_EN.md @@ -1,4 +1,4 @@ -# [1098. Unpopular Books](https://leetcode.com/problems/unpopular-books) +# [1098. Unpopular Books 🔒](https://leetcode.com/problems/unpopular-books) [中文文档](/solution/1000-1099/1098.Unpopular%20Books/README.md) diff --git a/solution/1000-1099/1099.Two Sum Less Than K/README.md b/solution/1000-1099/1099.Two Sum Less Than K/README.md index 3ce1b61ac42ee..a22088f4a0292 100644 --- a/solution/1000-1099/1099.Two Sum Less Than K/README.md +++ b/solution/1000-1099/1099.Two Sum Less Than K/README.md @@ -1,4 +1,4 @@ -# [1099. 小于 K 的两数之和](https://leetcode.cn/problems/two-sum-less-than-k) +# [1099. 小于 K 的两数之和 🔒](https://leetcode.cn/problems/two-sum-less-than-k) [English Version](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README_EN.md) diff --git a/solution/1000-1099/1099.Two Sum Less Than K/README_EN.md b/solution/1000-1099/1099.Two Sum Less Than K/README_EN.md index 3edbf82872c85..b08582e3b64f4 100644 --- a/solution/1000-1099/1099.Two Sum Less Than K/README_EN.md +++ b/solution/1000-1099/1099.Two Sum Less Than K/README_EN.md @@ -1,4 +1,4 @@ -# [1099. Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k) +# [1099. Two Sum Less Than K 🔒](https://leetcode.com/problems/two-sum-less-than-k) [中文文档](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README.md) diff --git a/solution/1100-1199/1100.Find K-Length Substrings With No Repeated Characters/README.md b/solution/1100-1199/1100.Find K-Length Substrings With No Repeated Characters/README.md index 53da848c7fdac..eff5ea7acea01 100644 --- a/solution/1100-1199/1100.Find K-Length Substrings With No Repeated Characters/README.md +++ b/solution/1100-1199/1100.Find K-Length Substrings With No Repeated Characters/README.md @@ -1,4 +1,4 @@ -# [1100. 长度为 K 的无重复字符子串](https://leetcode.cn/problems/find-k-length-substrings-with-no-repeated-characters) +# [1100. 长度为 K 的无重复字符子串 🔒](https://leetcode.cn/problems/find-k-length-substrings-with-no-repeated-characters) [English Version](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README_EN.md) diff --git a/solution/1100-1199/1100.Find K-Length Substrings With No Repeated Characters/README_EN.md b/solution/1100-1199/1100.Find K-Length Substrings With No Repeated Characters/README_EN.md index fc85ac69dda7a..3ce1862955590 100644 --- a/solution/1100-1199/1100.Find K-Length Substrings With No Repeated Characters/README_EN.md +++ b/solution/1100-1199/1100.Find K-Length Substrings With No Repeated Characters/README_EN.md @@ -1,4 +1,4 @@ -# [1100. Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters) +# [1100. Find K-Length Substrings With No Repeated Characters 🔒](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters) [中文文档](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README.md) diff --git a/solution/1100-1199/1101.The Earliest Moment When Everyone Become Friends/README.md b/solution/1100-1199/1101.The Earliest Moment When Everyone Become Friends/README.md index 2d87a72c9772f..58aadf7be5042 100644 --- a/solution/1100-1199/1101.The Earliest Moment When Everyone Become Friends/README.md +++ b/solution/1100-1199/1101.The Earliest Moment When Everyone Become Friends/README.md @@ -1,4 +1,4 @@ -# [1101. 彼此熟识的最早时间](https://leetcode.cn/problems/the-earliest-moment-when-everyone-become-friends) +# [1101. 彼此熟识的最早时间 🔒](https://leetcode.cn/problems/the-earliest-moment-when-everyone-become-friends) [English Version](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README_EN.md) diff --git a/solution/1100-1199/1101.The Earliest Moment When Everyone Become Friends/README_EN.md b/solution/1100-1199/1101.The Earliest Moment When Everyone Become Friends/README_EN.md index 259cac8217025..2f49934a98db5 100644 --- a/solution/1100-1199/1101.The Earliest Moment When Everyone Become Friends/README_EN.md +++ b/solution/1100-1199/1101.The Earliest Moment When Everyone Become Friends/README_EN.md @@ -1,4 +1,4 @@ -# [1101. The Earliest Moment When Everyone Become Friends](https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends) +# [1101. The Earliest Moment When Everyone Become Friends 🔒](https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends) [中文文档](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README.md) diff --git a/solution/1100-1199/1102.Path With Maximum Minimum Value/README.md b/solution/1100-1199/1102.Path With Maximum Minimum Value/README.md index 642f545257346..98e3d83449876 100644 --- a/solution/1100-1199/1102.Path With Maximum Minimum Value/README.md +++ b/solution/1100-1199/1102.Path With Maximum Minimum Value/README.md @@ -1,4 +1,4 @@ -# [1102. 得分最高的路径](https://leetcode.cn/problems/path-with-maximum-minimum-value) +# [1102. 得分最高的路径 🔒](https://leetcode.cn/problems/path-with-maximum-minimum-value) [English Version](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README_EN.md) diff --git a/solution/1100-1199/1102.Path With Maximum Minimum Value/README_EN.md b/solution/1100-1199/1102.Path With Maximum Minimum Value/README_EN.md index 84593477c3583..3ab3471f49ce9 100644 --- a/solution/1100-1199/1102.Path With Maximum Minimum Value/README_EN.md +++ b/solution/1100-1199/1102.Path With Maximum Minimum Value/README_EN.md @@ -1,4 +1,4 @@ -# [1102. Path With Maximum Minimum Value](https://leetcode.com/problems/path-with-maximum-minimum-value) +# [1102. Path With Maximum Minimum Value 🔒](https://leetcode.com/problems/path-with-maximum-minimum-value) [中文文档](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README.md) diff --git a/solution/1100-1199/1107.New Users Daily Count/README.md b/solution/1100-1199/1107.New Users Daily Count/README.md index a3fbb71bff07f..3ec3d5ed2c4f6 100644 --- a/solution/1100-1199/1107.New Users Daily Count/README.md +++ b/solution/1100-1199/1107.New Users Daily Count/README.md @@ -1,4 +1,4 @@ -# [1107. 每日新用户统计](https://leetcode.cn/problems/new-users-daily-count) +# [1107. 每日新用户统计 🔒](https://leetcode.cn/problems/new-users-daily-count) [English Version](/solution/1100-1199/1107.New%20Users%20Daily%20Count/README_EN.md) diff --git a/solution/1100-1199/1107.New Users Daily Count/README_EN.md b/solution/1100-1199/1107.New Users Daily Count/README_EN.md index 947fb03dfeaf5..0c38d0f8d2c8c 100644 --- a/solution/1100-1199/1107.New Users Daily Count/README_EN.md +++ b/solution/1100-1199/1107.New Users Daily Count/README_EN.md @@ -1,4 +1,4 @@ -# [1107. New Users Daily Count](https://leetcode.com/problems/new-users-daily-count) +# [1107. New Users Daily Count 🔒](https://leetcode.com/problems/new-users-daily-count) [中文文档](/solution/1100-1199/1107.New%20Users%20Daily%20Count/README.md) diff --git a/solution/1100-1199/1112.Highest Grade For Each Student/README.md b/solution/1100-1199/1112.Highest Grade For Each Student/README.md index 387b03e7ee13c..11bd9ce0add27 100644 --- a/solution/1100-1199/1112.Highest Grade For Each Student/README.md +++ b/solution/1100-1199/1112.Highest Grade For Each Student/README.md @@ -1,4 +1,4 @@ -# [1112. 每位学生的最高成绩](https://leetcode.cn/problems/highest-grade-for-each-student) +# [1112. 每位学生的最高成绩 🔒](https://leetcode.cn/problems/highest-grade-for-each-student) [English Version](/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README_EN.md) diff --git a/solution/1100-1199/1112.Highest Grade For Each Student/README_EN.md b/solution/1100-1199/1112.Highest Grade For Each Student/README_EN.md index 999e826b61f27..43dd99557dc61 100644 --- a/solution/1100-1199/1112.Highest Grade For Each Student/README_EN.md +++ b/solution/1100-1199/1112.Highest Grade For Each Student/README_EN.md @@ -1,4 +1,4 @@ -# [1112. Highest Grade For Each Student](https://leetcode.com/problems/highest-grade-for-each-student) +# [1112. Highest Grade For Each Student 🔒](https://leetcode.com/problems/highest-grade-for-each-student) [中文文档](/solution/1100-1199/1112.Highest%20Grade%20For%20Each%20Student/README.md) diff --git a/solution/1100-1199/1113.Reported Posts/README.md b/solution/1100-1199/1113.Reported Posts/README.md index 0d5e4fe1fa2c4..a8974886a96cb 100644 --- a/solution/1100-1199/1113.Reported Posts/README.md +++ b/solution/1100-1199/1113.Reported Posts/README.md @@ -1,4 +1,4 @@ -# [1113. 报告的记录](https://leetcode.cn/problems/reported-posts) +# [1113. 报告的记录 🔒](https://leetcode.cn/problems/reported-posts) [English Version](/solution/1100-1199/1113.Reported%20Posts/README_EN.md) diff --git a/solution/1100-1199/1113.Reported Posts/README_EN.md b/solution/1100-1199/1113.Reported Posts/README_EN.md index 698248e7255b0..9d503f6ce1f31 100644 --- a/solution/1100-1199/1113.Reported Posts/README_EN.md +++ b/solution/1100-1199/1113.Reported Posts/README_EN.md @@ -1,4 +1,4 @@ -# [1113. Reported Posts](https://leetcode.com/problems/reported-posts) +# [1113. Reported Posts 🔒](https://leetcode.com/problems/reported-posts) [中文文档](/solution/1100-1199/1113.Reported%20Posts/README.md) diff --git a/solution/1100-1199/1118.Number of Days in a Month/README.md b/solution/1100-1199/1118.Number of Days in a Month/README.md index e54dc4cbbf6da..79ccf1b22660f 100644 --- a/solution/1100-1199/1118.Number of Days in a Month/README.md +++ b/solution/1100-1199/1118.Number of Days in a Month/README.md @@ -1,4 +1,4 @@ -# [1118. 一月有多少天](https://leetcode.cn/problems/number-of-days-in-a-month) +# [1118. 一月有多少天 🔒](https://leetcode.cn/problems/number-of-days-in-a-month) [English Version](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README_EN.md) diff --git a/solution/1100-1199/1118.Number of Days in a Month/README_EN.md b/solution/1100-1199/1118.Number of Days in a Month/README_EN.md index 6dfa87312c33f..08f00f6b4763d 100644 --- a/solution/1100-1199/1118.Number of Days in a Month/README_EN.md +++ b/solution/1100-1199/1118.Number of Days in a Month/README_EN.md @@ -1,4 +1,4 @@ -# [1118. Number of Days in a Month](https://leetcode.com/problems/number-of-days-in-a-month) +# [1118. Number of Days in a Month 🔒](https://leetcode.com/problems/number-of-days-in-a-month) [中文文档](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README.md) diff --git a/solution/1100-1199/1119.Remove Vowels from a String/README.md b/solution/1100-1199/1119.Remove Vowels from a String/README.md index fa749d442ca3c..33f18fdc6aa35 100644 --- a/solution/1100-1199/1119.Remove Vowels from a String/README.md +++ b/solution/1100-1199/1119.Remove Vowels from a String/README.md @@ -1,4 +1,4 @@ -# [1119. 删去字符串中的元音](https://leetcode.cn/problems/remove-vowels-from-a-string) +# [1119. 删去字符串中的元音 🔒](https://leetcode.cn/problems/remove-vowels-from-a-string) [English Version](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README_EN.md) diff --git a/solution/1100-1199/1119.Remove Vowels from a String/README_EN.md b/solution/1100-1199/1119.Remove Vowels from a String/README_EN.md index 1ecf962a905df..b39005770b509 100644 --- a/solution/1100-1199/1119.Remove Vowels from a String/README_EN.md +++ b/solution/1100-1199/1119.Remove Vowels from a String/README_EN.md @@ -1,4 +1,4 @@ -# [1119. Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string) +# [1119. Remove Vowels from a String 🔒](https://leetcode.com/problems/remove-vowels-from-a-string) [中文文档](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README.md) diff --git a/solution/1100-1199/1120.Maximum Average Subtree/README.md b/solution/1100-1199/1120.Maximum Average Subtree/README.md index 03085a970d136..fe4e9ecfe85da 100644 --- a/solution/1100-1199/1120.Maximum Average Subtree/README.md +++ b/solution/1100-1199/1120.Maximum Average Subtree/README.md @@ -1,4 +1,4 @@ -# [1120. 子树的最大平均值](https://leetcode.cn/problems/maximum-average-subtree) +# [1120. 子树的最大平均值 🔒](https://leetcode.cn/problems/maximum-average-subtree) [English Version](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README_EN.md) diff --git a/solution/1100-1199/1120.Maximum Average Subtree/README_EN.md b/solution/1100-1199/1120.Maximum Average Subtree/README_EN.md index 6d16114ce5fc6..120a1b17fd6d7 100644 --- a/solution/1100-1199/1120.Maximum Average Subtree/README_EN.md +++ b/solution/1100-1199/1120.Maximum Average Subtree/README_EN.md @@ -1,4 +1,4 @@ -# [1120. Maximum Average Subtree](https://leetcode.com/problems/maximum-average-subtree) +# [1120. Maximum Average Subtree 🔒](https://leetcode.com/problems/maximum-average-subtree) [中文文档](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README.md) diff --git a/solution/1100-1199/1121.Divide Array Into Increasing Sequences/README.md b/solution/1100-1199/1121.Divide Array Into Increasing Sequences/README.md index a1ec7f58978de..6d926ece6e609 100644 --- a/solution/1100-1199/1121.Divide Array Into Increasing Sequences/README.md +++ b/solution/1100-1199/1121.Divide Array Into Increasing Sequences/README.md @@ -1,4 +1,4 @@ -# [1121. 将数组分成几个递增序列](https://leetcode.cn/problems/divide-array-into-increasing-sequences) +# [1121. 将数组分成几个递增序列 🔒](https://leetcode.cn/problems/divide-array-into-increasing-sequences) [English Version](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README_EN.md) diff --git a/solution/1100-1199/1121.Divide Array Into Increasing Sequences/README_EN.md b/solution/1100-1199/1121.Divide Array Into Increasing Sequences/README_EN.md index 9b2637014634f..d36310106487e 100644 --- a/solution/1100-1199/1121.Divide Array Into Increasing Sequences/README_EN.md +++ b/solution/1100-1199/1121.Divide Array Into Increasing Sequences/README_EN.md @@ -1,4 +1,4 @@ -# [1121. Divide Array Into Increasing Sequences](https://leetcode.com/problems/divide-array-into-increasing-sequences) +# [1121. Divide Array Into Increasing Sequences 🔒](https://leetcode.com/problems/divide-array-into-increasing-sequences) [中文文档](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README.md) diff --git a/solution/1100-1199/1126.Active Businesses/README.md b/solution/1100-1199/1126.Active Businesses/README.md index de90e963005c1..f8c7482dc129c 100644 --- a/solution/1100-1199/1126.Active Businesses/README.md +++ b/solution/1100-1199/1126.Active Businesses/README.md @@ -1,4 +1,4 @@ -# [1126. 查询活跃业务](https://leetcode.cn/problems/active-businesses) +# [1126. 查询活跃业务 🔒](https://leetcode.cn/problems/active-businesses) [English Version](/solution/1100-1199/1126.Active%20Businesses/README_EN.md) diff --git a/solution/1100-1199/1126.Active Businesses/README_EN.md b/solution/1100-1199/1126.Active Businesses/README_EN.md index ba22b1435f6e1..13b08827eea17 100644 --- a/solution/1100-1199/1126.Active Businesses/README_EN.md +++ b/solution/1100-1199/1126.Active Businesses/README_EN.md @@ -1,4 +1,4 @@ -# [1126. Active Businesses](https://leetcode.com/problems/active-businesses) +# [1126. Active Businesses 🔒](https://leetcode.com/problems/active-businesses) [中文文档](/solution/1100-1199/1126.Active%20Businesses/README.md) diff --git a/solution/1100-1199/1127.User Purchase Platform/README.md b/solution/1100-1199/1127.User Purchase Platform/README.md index 243b011718c4c..402e041350109 100644 --- a/solution/1100-1199/1127.User Purchase Platform/README.md +++ b/solution/1100-1199/1127.User Purchase Platform/README.md @@ -1,4 +1,4 @@ -# [1127. 用户购买平台](https://leetcode.cn/problems/user-purchase-platform) +# [1127. 用户购买平台 🔒](https://leetcode.cn/problems/user-purchase-platform) [English Version](/solution/1100-1199/1127.User%20Purchase%20Platform/README_EN.md) diff --git a/solution/1100-1199/1127.User Purchase Platform/README_EN.md b/solution/1100-1199/1127.User Purchase Platform/README_EN.md index af398ec8f324f..5360bbfe30e62 100644 --- a/solution/1100-1199/1127.User Purchase Platform/README_EN.md +++ b/solution/1100-1199/1127.User Purchase Platform/README_EN.md @@ -1,4 +1,4 @@ -# [1127. User Purchase Platform](https://leetcode.com/problems/user-purchase-platform) +# [1127. User Purchase Platform 🔒](https://leetcode.com/problems/user-purchase-platform) [中文文档](/solution/1100-1199/1127.User%20Purchase%20Platform/README.md) diff --git a/solution/1100-1199/1132.Reported Posts II/README.md b/solution/1100-1199/1132.Reported Posts II/README.md index fe0e42a4017c4..07687f8e9ab7f 100644 --- a/solution/1100-1199/1132.Reported Posts II/README.md +++ b/solution/1100-1199/1132.Reported Posts II/README.md @@ -1,4 +1,4 @@ -# [1132. 报告的记录 II](https://leetcode.cn/problems/reported-posts-ii) +# [1132. 报告的记录 II 🔒](https://leetcode.cn/problems/reported-posts-ii) [English Version](/solution/1100-1199/1132.Reported%20Posts%20II/README_EN.md) diff --git a/solution/1100-1199/1132.Reported Posts II/README_EN.md b/solution/1100-1199/1132.Reported Posts II/README_EN.md index 28ccc4ce915f8..6197a4c16d37c 100644 --- a/solution/1100-1199/1132.Reported Posts II/README_EN.md +++ b/solution/1100-1199/1132.Reported Posts II/README_EN.md @@ -1,4 +1,4 @@ -# [1132. Reported Posts II](https://leetcode.com/problems/reported-posts-ii) +# [1132. Reported Posts II 🔒](https://leetcode.com/problems/reported-posts-ii) [中文文档](/solution/1100-1199/1132.Reported%20Posts%20II/README.md) diff --git a/solution/1100-1199/1133.Largest Unique Number/README.md b/solution/1100-1199/1133.Largest Unique Number/README.md index 121dae213b796..b840c8d39b0ea 100644 --- a/solution/1100-1199/1133.Largest Unique Number/README.md +++ b/solution/1100-1199/1133.Largest Unique Number/README.md @@ -1,4 +1,4 @@ -# [1133. 最大唯一数](https://leetcode.cn/problems/largest-unique-number) +# [1133. 最大唯一数 🔒](https://leetcode.cn/problems/largest-unique-number) [English Version](/solution/1100-1199/1133.Largest%20Unique%20Number/README_EN.md) diff --git a/solution/1100-1199/1133.Largest Unique Number/README_EN.md b/solution/1100-1199/1133.Largest Unique Number/README_EN.md index dc0356c472016..0d6c18fcf4b4a 100644 --- a/solution/1100-1199/1133.Largest Unique Number/README_EN.md +++ b/solution/1100-1199/1133.Largest Unique Number/README_EN.md @@ -1,4 +1,4 @@ -# [1133. Largest Unique Number](https://leetcode.com/problems/largest-unique-number) +# [1133. Largest Unique Number 🔒](https://leetcode.com/problems/largest-unique-number) [中文文档](/solution/1100-1199/1133.Largest%20Unique%20Number/README.md) diff --git a/solution/1100-1199/1134.Armstrong Number/README.md b/solution/1100-1199/1134.Armstrong Number/README.md index 8eca350934449..77f4036ffc164 100644 --- a/solution/1100-1199/1134.Armstrong Number/README.md +++ b/solution/1100-1199/1134.Armstrong Number/README.md @@ -1,4 +1,4 @@ -# [1134. 阿姆斯特朗数](https://leetcode.cn/problems/armstrong-number) +# [1134. 阿姆斯特朗数 🔒](https://leetcode.cn/problems/armstrong-number) [English Version](/solution/1100-1199/1134.Armstrong%20Number/README_EN.md) diff --git a/solution/1100-1199/1134.Armstrong Number/README_EN.md b/solution/1100-1199/1134.Armstrong Number/README_EN.md index 5042f22835d37..6b09a07599f06 100644 --- a/solution/1100-1199/1134.Armstrong Number/README_EN.md +++ b/solution/1100-1199/1134.Armstrong Number/README_EN.md @@ -1,4 +1,4 @@ -# [1134. Armstrong Number](https://leetcode.com/problems/armstrong-number) +# [1134. Armstrong Number 🔒](https://leetcode.com/problems/armstrong-number) [中文文档](/solution/1100-1199/1134.Armstrong%20Number/README.md) diff --git a/solution/1100-1199/1135.Connecting Cities With Minimum Cost/README.md b/solution/1100-1199/1135.Connecting Cities With Minimum Cost/README.md index d2b46393731bf..4ad402918937a 100644 --- a/solution/1100-1199/1135.Connecting Cities With Minimum Cost/README.md +++ b/solution/1100-1199/1135.Connecting Cities With Minimum Cost/README.md @@ -1,4 +1,4 @@ -# [1135. 最低成本连通所有城市](https://leetcode.cn/problems/connecting-cities-with-minimum-cost) +# [1135. 最低成本连通所有城市 🔒](https://leetcode.cn/problems/connecting-cities-with-minimum-cost) [English Version](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README_EN.md) diff --git a/solution/1100-1199/1135.Connecting Cities With Minimum Cost/README_EN.md b/solution/1100-1199/1135.Connecting Cities With Minimum Cost/README_EN.md index a2aa522b4e1c1..7156b86d01083 100644 --- a/solution/1100-1199/1135.Connecting Cities With Minimum Cost/README_EN.md +++ b/solution/1100-1199/1135.Connecting Cities With Minimum Cost/README_EN.md @@ -1,4 +1,4 @@ -# [1135. Connecting Cities With Minimum Cost](https://leetcode.com/problems/connecting-cities-with-minimum-cost) +# [1135. Connecting Cities With Minimum Cost 🔒](https://leetcode.com/problems/connecting-cities-with-minimum-cost) [中文文档](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md) diff --git a/solution/1100-1199/1136.Parallel Courses/README.md b/solution/1100-1199/1136.Parallel Courses/README.md index 6064aa53e6f69..4960e5e7270b2 100644 --- a/solution/1100-1199/1136.Parallel Courses/README.md +++ b/solution/1100-1199/1136.Parallel Courses/README.md @@ -1,4 +1,4 @@ -# [1136. 并行课程](https://leetcode.cn/problems/parallel-courses) +# [1136. 并行课程 🔒](https://leetcode.cn/problems/parallel-courses) [English Version](/solution/1100-1199/1136.Parallel%20Courses/README_EN.md) diff --git a/solution/1100-1199/1136.Parallel Courses/README_EN.md b/solution/1100-1199/1136.Parallel Courses/README_EN.md index 1387f860ed9d2..77de52e2db1ba 100644 --- a/solution/1100-1199/1136.Parallel Courses/README_EN.md +++ b/solution/1100-1199/1136.Parallel Courses/README_EN.md @@ -1,4 +1,4 @@ -# [1136. Parallel Courses](https://leetcode.com/problems/parallel-courses) +# [1136. Parallel Courses 🔒](https://leetcode.com/problems/parallel-courses) [中文文档](/solution/1100-1199/1136.Parallel%20Courses/README.md) diff --git a/solution/1100-1199/1142.User Activity for the Past 30 Days II/README.md b/solution/1100-1199/1142.User Activity for the Past 30 Days II/README.md index 2010718916490..8f591d07be2d1 100644 --- a/solution/1100-1199/1142.User Activity for the Past 30 Days II/README.md +++ b/solution/1100-1199/1142.User Activity for the Past 30 Days II/README.md @@ -1,4 +1,4 @@ -# [1142. 过去 30 天的用户活动 II](https://leetcode.cn/problems/user-activity-for-the-past-30-days-ii) +# [1142. 过去 30 天的用户活动 II 🔒](https://leetcode.cn/problems/user-activity-for-the-past-30-days-ii) [English Version](/solution/1100-1199/1142.User%20Activity%20for%20the%20Past%2030%20Days%20II/README_EN.md) diff --git a/solution/1100-1199/1142.User Activity for the Past 30 Days II/README_EN.md b/solution/1100-1199/1142.User Activity for the Past 30 Days II/README_EN.md index 251f9735377a7..98a27c8bfcf5b 100644 --- a/solution/1100-1199/1142.User Activity for the Past 30 Days II/README_EN.md +++ b/solution/1100-1199/1142.User Activity for the Past 30 Days II/README_EN.md @@ -1,4 +1,4 @@ -# [1142. User Activity for the Past 30 Days II](https://leetcode.com/problems/user-activity-for-the-past-30-days-ii) +# [1142. User Activity for the Past 30 Days II 🔒](https://leetcode.com/problems/user-activity-for-the-past-30-days-ii) [中文文档](/solution/1100-1199/1142.User%20Activity%20for%20the%20Past%2030%20Days%20II/README.md) diff --git a/solution/1100-1199/1149.Article Views II/README.md b/solution/1100-1199/1149.Article Views II/README.md index 5ad5597d47919..6a3e4182891f0 100644 --- a/solution/1100-1199/1149.Article Views II/README.md +++ b/solution/1100-1199/1149.Article Views II/README.md @@ -1,4 +1,4 @@ -# [1149. 文章浏览 II](https://leetcode.cn/problems/article-views-ii) +# [1149. 文章浏览 II 🔒](https://leetcode.cn/problems/article-views-ii) [English Version](/solution/1100-1199/1149.Article%20Views%20II/README_EN.md) diff --git a/solution/1100-1199/1149.Article Views II/README_EN.md b/solution/1100-1199/1149.Article Views II/README_EN.md index 7089f92ea42d9..c6fd07fd4614b 100644 --- a/solution/1100-1199/1149.Article Views II/README_EN.md +++ b/solution/1100-1199/1149.Article Views II/README_EN.md @@ -1,4 +1,4 @@ -# [1149. Article Views II](https://leetcode.com/problems/article-views-ii) +# [1149. Article Views II 🔒](https://leetcode.com/problems/article-views-ii) [中文文档](/solution/1100-1199/1149.Article%20Views%20II/README.md) diff --git a/solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/README.md b/solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/README.md index 76f38743dfd3d..3c705f147c248 100644 --- a/solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/README.md +++ b/solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/README.md @@ -1,4 +1,4 @@ -# [1150. 检查一个数是否在数组中占绝大多数](https://leetcode.cn/problems/check-if-a-number-is-majority-element-in-a-sorted-array) +# [1150. 检查一个数是否在数组中占绝大多数 🔒](https://leetcode.cn/problems/check-if-a-number-is-majority-element-in-a-sorted-array) [English Version](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README_EN.md) diff --git a/solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/README_EN.md b/solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/README_EN.md index a7e77747cc635..b4379f2a2efc8 100644 --- a/solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/README_EN.md +++ b/solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/README_EN.md @@ -1,4 +1,4 @@ -# [1150. Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array) +# [1150. Check If a Number Is Majority Element in a Sorted Array 🔒](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array) [中文文档](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README.md) diff --git a/solution/1100-1199/1151.Minimum Swaps to Group All 1's Together/README.md b/solution/1100-1199/1151.Minimum Swaps to Group All 1's Together/README.md index f3c1dda78c2d1..246eba2a4f1ee 100644 --- a/solution/1100-1199/1151.Minimum Swaps to Group All 1's Together/README.md +++ b/solution/1100-1199/1151.Minimum Swaps to Group All 1's Together/README.md @@ -1,4 +1,4 @@ -# [1151. 最少交换次数来组合所有的 1](https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together) +# [1151. 最少交换次数来组合所有的 1 🔒](https://leetcode.cn/problems/minimum-swaps-to-group-all-1s-together) [English Version](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README_EN.md) diff --git a/solution/1100-1199/1151.Minimum Swaps to Group All 1's Together/README_EN.md b/solution/1100-1199/1151.Minimum Swaps to Group All 1's Together/README_EN.md index f2d891eadcb4c..00932ae45aaec 100644 --- a/solution/1100-1199/1151.Minimum Swaps to Group All 1's Together/README_EN.md +++ b/solution/1100-1199/1151.Minimum Swaps to Group All 1's Together/README_EN.md @@ -1,4 +1,4 @@ -# [1151. Minimum Swaps to Group All 1's Together](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together) +# [1151. Minimum Swaps to Group All 1's Together 🔒](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together) [中文文档](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README.md) diff --git a/solution/1100-1199/1152.Analyze User Website Visit Pattern/README.md b/solution/1100-1199/1152.Analyze User Website Visit Pattern/README.md index dc7aef1cbffbf..82a47e79217f7 100644 --- a/solution/1100-1199/1152.Analyze User Website Visit Pattern/README.md +++ b/solution/1100-1199/1152.Analyze User Website Visit Pattern/README.md @@ -1,4 +1,4 @@ -# [1152. 用户网站访问行为分析](https://leetcode.cn/problems/analyze-user-website-visit-pattern) +# [1152. 用户网站访问行为分析 🔒](https://leetcode.cn/problems/analyze-user-website-visit-pattern) [English Version](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README_EN.md) diff --git a/solution/1100-1199/1152.Analyze User Website Visit Pattern/README_EN.md b/solution/1100-1199/1152.Analyze User Website Visit Pattern/README_EN.md index 209372f4ef3b9..784a4d0268cf3 100644 --- a/solution/1100-1199/1152.Analyze User Website Visit Pattern/README_EN.md +++ b/solution/1100-1199/1152.Analyze User Website Visit Pattern/README_EN.md @@ -1,4 +1,4 @@ -# [1152. Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern) +# [1152. Analyze User Website Visit Pattern 🔒](https://leetcode.com/problems/analyze-user-website-visit-pattern) [中文文档](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README.md) diff --git a/solution/1100-1199/1153.String Transforms Into Another String/README.md b/solution/1100-1199/1153.String Transforms Into Another String/README.md index c71f30500a3ec..8c9ef4d438dc9 100644 --- a/solution/1100-1199/1153.String Transforms Into Another String/README.md +++ b/solution/1100-1199/1153.String Transforms Into Another String/README.md @@ -1,4 +1,4 @@ -# [1153. 字符串转化](https://leetcode.cn/problems/string-transforms-into-another-string) +# [1153. 字符串转化 🔒](https://leetcode.cn/problems/string-transforms-into-another-string) [English Version](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README_EN.md) diff --git a/solution/1100-1199/1153.String Transforms Into Another String/README_EN.md b/solution/1100-1199/1153.String Transforms Into Another String/README_EN.md index 68447d7738400..78a57c777b05c 100644 --- a/solution/1100-1199/1153.String Transforms Into Another String/README_EN.md +++ b/solution/1100-1199/1153.String Transforms Into Another String/README_EN.md @@ -1,4 +1,4 @@ -# [1153. String Transforms Into Another String](https://leetcode.com/problems/string-transforms-into-another-string) +# [1153. String Transforms Into Another String 🔒](https://leetcode.com/problems/string-transforms-into-another-string) [中文文档](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README.md) diff --git a/solution/1100-1199/1159.Market Analysis II/README.md b/solution/1100-1199/1159.Market Analysis II/README.md index d212435165fb1..93d204fb3a1ab 100644 --- a/solution/1100-1199/1159.Market Analysis II/README.md +++ b/solution/1100-1199/1159.Market Analysis II/README.md @@ -1,4 +1,4 @@ -# [1159. 市场分析 II](https://leetcode.cn/problems/market-analysis-ii) +# [1159. 市场分析 II 🔒](https://leetcode.cn/problems/market-analysis-ii) [English Version](/solution/1100-1199/1159.Market%20Analysis%20II/README_EN.md) diff --git a/solution/1100-1199/1159.Market Analysis II/README_EN.md b/solution/1100-1199/1159.Market Analysis II/README_EN.md index f7981aae7d831..1c71cf385ef34 100644 --- a/solution/1100-1199/1159.Market Analysis II/README_EN.md +++ b/solution/1100-1199/1159.Market Analysis II/README_EN.md @@ -1,4 +1,4 @@ -# [1159. Market Analysis II](https://leetcode.com/problems/market-analysis-ii) +# [1159. Market Analysis II 🔒](https://leetcode.com/problems/market-analysis-ii) [中文文档](/solution/1100-1199/1159.Market%20Analysis%20II/README.md) diff --git a/solution/1100-1199/1165.Single-Row Keyboard/README.md b/solution/1100-1199/1165.Single-Row Keyboard/README.md index d968b750f755d..0d1cad4cbee94 100644 --- a/solution/1100-1199/1165.Single-Row Keyboard/README.md +++ b/solution/1100-1199/1165.Single-Row Keyboard/README.md @@ -1,4 +1,4 @@ -# [1165. 单行键盘](https://leetcode.cn/problems/single-row-keyboard) +# [1165. 单行键盘 🔒](https://leetcode.cn/problems/single-row-keyboard) [English Version](/solution/1100-1199/1165.Single-Row%20Keyboard/README_EN.md) diff --git a/solution/1100-1199/1165.Single-Row Keyboard/README_EN.md b/solution/1100-1199/1165.Single-Row Keyboard/README_EN.md index 4fd2abb52054a..120267179d067 100644 --- a/solution/1100-1199/1165.Single-Row Keyboard/README_EN.md +++ b/solution/1100-1199/1165.Single-Row Keyboard/README_EN.md @@ -1,4 +1,4 @@ -# [1165. Single-Row Keyboard](https://leetcode.com/problems/single-row-keyboard) +# [1165. Single-Row Keyboard 🔒](https://leetcode.com/problems/single-row-keyboard) [中文文档](/solution/1100-1199/1165.Single-Row%20Keyboard/README.md) diff --git a/solution/1100-1199/1166.Design File System/README.md b/solution/1100-1199/1166.Design File System/README.md index fa713fed5a1b4..d8f0cf8d97178 100644 --- a/solution/1100-1199/1166.Design File System/README.md +++ b/solution/1100-1199/1166.Design File System/README.md @@ -1,4 +1,4 @@ -# [1166. 设计文件系统](https://leetcode.cn/problems/design-file-system) +# [1166. 设计文件系统 🔒](https://leetcode.cn/problems/design-file-system) [English Version](/solution/1100-1199/1166.Design%20File%20System/README_EN.md) diff --git a/solution/1100-1199/1166.Design File System/README_EN.md b/solution/1100-1199/1166.Design File System/README_EN.md index a47d1523cd7b7..aefd0194e3c9e 100644 --- a/solution/1100-1199/1166.Design File System/README_EN.md +++ b/solution/1100-1199/1166.Design File System/README_EN.md @@ -1,4 +1,4 @@ -# [1166. Design File System](https://leetcode.com/problems/design-file-system) +# [1166. Design File System 🔒](https://leetcode.com/problems/design-file-system) [中文文档](/solution/1100-1199/1166.Design%20File%20System/README.md) diff --git a/solution/1100-1199/1167.Minimum Cost to Connect Sticks/README.md b/solution/1100-1199/1167.Minimum Cost to Connect Sticks/README.md index 85281ecda209c..048fc56a165e9 100644 --- a/solution/1100-1199/1167.Minimum Cost to Connect Sticks/README.md +++ b/solution/1100-1199/1167.Minimum Cost to Connect Sticks/README.md @@ -1,4 +1,4 @@ -# [1167. 连接木棍的最低费用](https://leetcode.cn/problems/minimum-cost-to-connect-sticks) +# [1167. 连接木棍的最低费用 🔒](https://leetcode.cn/problems/minimum-cost-to-connect-sticks) [English Version](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README_EN.md) diff --git a/solution/1100-1199/1167.Minimum Cost to Connect Sticks/README_EN.md b/solution/1100-1199/1167.Minimum Cost to Connect Sticks/README_EN.md index fd8130da635b8..8061b4c705e7f 100644 --- a/solution/1100-1199/1167.Minimum Cost to Connect Sticks/README_EN.md +++ b/solution/1100-1199/1167.Minimum Cost to Connect Sticks/README_EN.md @@ -1,4 +1,4 @@ -# [1167. Minimum Cost to Connect Sticks](https://leetcode.com/problems/minimum-cost-to-connect-sticks) +# [1167. Minimum Cost to Connect Sticks 🔒](https://leetcode.com/problems/minimum-cost-to-connect-sticks) [中文文档](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README.md) diff --git a/solution/1100-1199/1168.Optimize Water Distribution in a Village/README.md b/solution/1100-1199/1168.Optimize Water Distribution in a Village/README.md index bc24c05432101..df47283fa09eb 100644 --- a/solution/1100-1199/1168.Optimize Water Distribution in a Village/README.md +++ b/solution/1100-1199/1168.Optimize Water Distribution in a Village/README.md @@ -1,4 +1,4 @@ -# [1168. 水资源分配优化](https://leetcode.cn/problems/optimize-water-distribution-in-a-village) +# [1168. 水资源分配优化 🔒](https://leetcode.cn/problems/optimize-water-distribution-in-a-village) [English Version](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README_EN.md) diff --git a/solution/1100-1199/1168.Optimize Water Distribution in a Village/README_EN.md b/solution/1100-1199/1168.Optimize Water Distribution in a Village/README_EN.md index 8971f617eec50..381b130034790 100644 --- a/solution/1100-1199/1168.Optimize Water Distribution in a Village/README_EN.md +++ b/solution/1100-1199/1168.Optimize Water Distribution in a Village/README_EN.md @@ -1,4 +1,4 @@ -# [1168. Optimize Water Distribution in a Village](https://leetcode.com/problems/optimize-water-distribution-in-a-village) +# [1168. Optimize Water Distribution in a Village 🔒](https://leetcode.com/problems/optimize-water-distribution-in-a-village) [中文文档](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md) diff --git a/solution/1100-1199/1173.Immediate Food Delivery I/README.md b/solution/1100-1199/1173.Immediate Food Delivery I/README.md index 360a718d03e79..affd8d386cd61 100644 --- a/solution/1100-1199/1173.Immediate Food Delivery I/README.md +++ b/solution/1100-1199/1173.Immediate Food Delivery I/README.md @@ -1,4 +1,4 @@ -# [1173. 即时食物配送 I](https://leetcode.cn/problems/immediate-food-delivery-i) +# [1173. 即时食物配送 I 🔒](https://leetcode.cn/problems/immediate-food-delivery-i) [English Version](/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README_EN.md) diff --git a/solution/1100-1199/1173.Immediate Food Delivery I/README_EN.md b/solution/1100-1199/1173.Immediate Food Delivery I/README_EN.md index 70a36ef0b74ca..363017bd995b3 100644 --- a/solution/1100-1199/1173.Immediate Food Delivery I/README_EN.md +++ b/solution/1100-1199/1173.Immediate Food Delivery I/README_EN.md @@ -1,4 +1,4 @@ -# [1173. Immediate Food Delivery I](https://leetcode.com/problems/immediate-food-delivery-i) +# [1173. Immediate Food Delivery I 🔒](https://leetcode.com/problems/immediate-food-delivery-i) [中文文档](/solution/1100-1199/1173.Immediate%20Food%20Delivery%20I/README.md) diff --git a/solution/1100-1199/1176.Diet Plan Performance/README.md b/solution/1100-1199/1176.Diet Plan Performance/README.md index 987c4de19bab7..ad36dbf4e182f 100644 --- a/solution/1100-1199/1176.Diet Plan Performance/README.md +++ b/solution/1100-1199/1176.Diet Plan Performance/README.md @@ -1,4 +1,4 @@ -# [1176. 健身计划评估](https://leetcode.cn/problems/diet-plan-performance) +# [1176. 健身计划评估 🔒](https://leetcode.cn/problems/diet-plan-performance) [English Version](/solution/1100-1199/1176.Diet%20Plan%20Performance/README_EN.md) diff --git a/solution/1100-1199/1176.Diet Plan Performance/README_EN.md b/solution/1100-1199/1176.Diet Plan Performance/README_EN.md index 7d3fcc0e62606..f273bebebb941 100644 --- a/solution/1100-1199/1176.Diet Plan Performance/README_EN.md +++ b/solution/1100-1199/1176.Diet Plan Performance/README_EN.md @@ -1,4 +1,4 @@ -# [1176. Diet Plan Performance](https://leetcode.com/problems/diet-plan-performance) +# [1176. Diet Plan Performance 🔒](https://leetcode.com/problems/diet-plan-performance) [中文文档](/solution/1100-1199/1176.Diet%20Plan%20Performance/README.md) diff --git a/solution/1100-1199/1180.Count Substrings with Only One Distinct Letter/README.md b/solution/1100-1199/1180.Count Substrings with Only One Distinct Letter/README.md index 63a46405d0182..e021d1dc31c97 100644 --- a/solution/1100-1199/1180.Count Substrings with Only One Distinct Letter/README.md +++ b/solution/1100-1199/1180.Count Substrings with Only One Distinct Letter/README.md @@ -1,4 +1,4 @@ -# [1180. 统计只含单一字母的子串](https://leetcode.cn/problems/count-substrings-with-only-one-distinct-letter) +# [1180. 统计只含单一字母的子串 🔒](https://leetcode.cn/problems/count-substrings-with-only-one-distinct-letter) [English Version](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README_EN.md) diff --git a/solution/1100-1199/1180.Count Substrings with Only One Distinct Letter/README_EN.md b/solution/1100-1199/1180.Count Substrings with Only One Distinct Letter/README_EN.md index dba98d9118684..bc01234799f66 100644 --- a/solution/1100-1199/1180.Count Substrings with Only One Distinct Letter/README_EN.md +++ b/solution/1100-1199/1180.Count Substrings with Only One Distinct Letter/README_EN.md @@ -1,4 +1,4 @@ -# [1180. Count Substrings with Only One Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter) +# [1180. Count Substrings with Only One Distinct Letter 🔒](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter) [中文文档](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README.md) diff --git a/solution/1100-1199/1181.Before and After Puzzle/README.md b/solution/1100-1199/1181.Before and After Puzzle/README.md index 64dd330d4bc7e..6a71924b3632d 100644 --- a/solution/1100-1199/1181.Before and After Puzzle/README.md +++ b/solution/1100-1199/1181.Before and After Puzzle/README.md @@ -1,4 +1,4 @@ -# [1181. 前后拼接](https://leetcode.cn/problems/before-and-after-puzzle) +# [1181. 前后拼接 🔒](https://leetcode.cn/problems/before-and-after-puzzle) [English Version](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README_EN.md) diff --git a/solution/1100-1199/1181.Before and After Puzzle/README_EN.md b/solution/1100-1199/1181.Before and After Puzzle/README_EN.md index a81c7e4636c5b..f84b6fff038a1 100644 --- a/solution/1100-1199/1181.Before and After Puzzle/README_EN.md +++ b/solution/1100-1199/1181.Before and After Puzzle/README_EN.md @@ -1,4 +1,4 @@ -# [1181. Before and After Puzzle](https://leetcode.com/problems/before-and-after-puzzle) +# [1181. Before and After Puzzle 🔒](https://leetcode.com/problems/before-and-after-puzzle) [中文文档](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README.md) diff --git a/solution/1100-1199/1182.Shortest Distance to Target Color/README.md b/solution/1100-1199/1182.Shortest Distance to Target Color/README.md index 74999549d6468..5a77c6da8b33b 100644 --- a/solution/1100-1199/1182.Shortest Distance to Target Color/README.md +++ b/solution/1100-1199/1182.Shortest Distance to Target Color/README.md @@ -1,4 +1,4 @@ -# [1182. 与目标颜色间的最短距离](https://leetcode.cn/problems/shortest-distance-to-target-color) +# [1182. 与目标颜色间的最短距离 🔒](https://leetcode.cn/problems/shortest-distance-to-target-color) [English Version](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README_EN.md) diff --git a/solution/1100-1199/1182.Shortest Distance to Target Color/README_EN.md b/solution/1100-1199/1182.Shortest Distance to Target Color/README_EN.md index 009fa61c40dc6..b405a5c81117d 100644 --- a/solution/1100-1199/1182.Shortest Distance to Target Color/README_EN.md +++ b/solution/1100-1199/1182.Shortest Distance to Target Color/README_EN.md @@ -1,4 +1,4 @@ -# [1182. Shortest Distance to Target Color](https://leetcode.com/problems/shortest-distance-to-target-color) +# [1182. Shortest Distance to Target Color 🔒](https://leetcode.com/problems/shortest-distance-to-target-color) [中文文档](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README.md) diff --git a/solution/1100-1199/1183.Maximum Number of Ones/README.md b/solution/1100-1199/1183.Maximum Number of Ones/README.md index a23b86002d853..aa38223251e7c 100644 --- a/solution/1100-1199/1183.Maximum Number of Ones/README.md +++ b/solution/1100-1199/1183.Maximum Number of Ones/README.md @@ -1,4 +1,4 @@ -# [1183. 矩阵中 1 的最大数量](https://leetcode.cn/problems/maximum-number-of-ones) +# [1183. 矩阵中 1 的最大数量 🔒](https://leetcode.cn/problems/maximum-number-of-ones) [English Version](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README_EN.md) diff --git a/solution/1100-1199/1183.Maximum Number of Ones/README_EN.md b/solution/1100-1199/1183.Maximum Number of Ones/README_EN.md index eda600de4fc8c..b8eedcaae3619 100644 --- a/solution/1100-1199/1183.Maximum Number of Ones/README_EN.md +++ b/solution/1100-1199/1183.Maximum Number of Ones/README_EN.md @@ -1,4 +1,4 @@ -# [1183. Maximum Number of Ones](https://leetcode.com/problems/maximum-number-of-ones) +# [1183. Maximum Number of Ones 🔒](https://leetcode.com/problems/maximum-number-of-ones) [中文文档](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README.md) diff --git a/solution/1100-1199/1188.Design Bounded Blocking Queue/README.md b/solution/1100-1199/1188.Design Bounded Blocking Queue/README.md index 492138daae1c8..04415a3d0ca25 100644 --- a/solution/1100-1199/1188.Design Bounded Blocking Queue/README.md +++ b/solution/1100-1199/1188.Design Bounded Blocking Queue/README.md @@ -1,4 +1,4 @@ -# [1188. 设计有限阻塞队列](https://leetcode.cn/problems/design-bounded-blocking-queue) +# [1188. 设计有限阻塞队列 🔒](https://leetcode.cn/problems/design-bounded-blocking-queue) [English Version](/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README_EN.md) diff --git a/solution/1100-1199/1188.Design Bounded Blocking Queue/README_EN.md b/solution/1100-1199/1188.Design Bounded Blocking Queue/README_EN.md index 3948e1612b2c1..fa637746ec429 100644 --- a/solution/1100-1199/1188.Design Bounded Blocking Queue/README_EN.md +++ b/solution/1100-1199/1188.Design Bounded Blocking Queue/README_EN.md @@ -1,4 +1,4 @@ -# [1188. Design Bounded Blocking Queue](https://leetcode.com/problems/design-bounded-blocking-queue) +# [1188. Design Bounded Blocking Queue 🔒](https://leetcode.com/problems/design-bounded-blocking-queue) [中文文档](/solution/1100-1199/1188.Design%20Bounded%20Blocking%20Queue/README.md) diff --git a/solution/1100-1199/1194.Tournament Winners/README.md b/solution/1100-1199/1194.Tournament Winners/README.md index ebd11545d5c1b..e615888ab7f75 100644 --- a/solution/1100-1199/1194.Tournament Winners/README.md +++ b/solution/1100-1199/1194.Tournament Winners/README.md @@ -1,4 +1,4 @@ -# [1194. 锦标赛优胜者](https://leetcode.cn/problems/tournament-winners) +# [1194. 锦标赛优胜者 🔒](https://leetcode.cn/problems/tournament-winners) [English Version](/solution/1100-1199/1194.Tournament%20Winners/README_EN.md) diff --git a/solution/1100-1199/1194.Tournament Winners/README_EN.md b/solution/1100-1199/1194.Tournament Winners/README_EN.md index 8231a6c6ebff0..3c6b61beeeb9e 100644 --- a/solution/1100-1199/1194.Tournament Winners/README_EN.md +++ b/solution/1100-1199/1194.Tournament Winners/README_EN.md @@ -1,4 +1,4 @@ -# [1194. Tournament Winners](https://leetcode.com/problems/tournament-winners) +# [1194. Tournament Winners 🔒](https://leetcode.com/problems/tournament-winners) [中文文档](/solution/1100-1199/1194.Tournament%20Winners/README.md) diff --git a/solution/1100-1199/1196.How Many Apples Can You Put into the Basket/README.md b/solution/1100-1199/1196.How Many Apples Can You Put into the Basket/README.md index 8c0514c4cc5d6..97c8b8216cfff 100644 --- a/solution/1100-1199/1196.How Many Apples Can You Put into the Basket/README.md +++ b/solution/1100-1199/1196.How Many Apples Can You Put into the Basket/README.md @@ -1,4 +1,4 @@ -# [1196. 最多可以买到的苹果数量](https://leetcode.cn/problems/how-many-apples-can-you-put-into-the-basket) +# [1196. 最多可以买到的苹果数量 🔒](https://leetcode.cn/problems/how-many-apples-can-you-put-into-the-basket) [English Version](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README_EN.md) diff --git a/solution/1100-1199/1196.How Many Apples Can You Put into the Basket/README_EN.md b/solution/1100-1199/1196.How Many Apples Can You Put into the Basket/README_EN.md index 7a06ec19aa93c..669fa7dea2e25 100644 --- a/solution/1100-1199/1196.How Many Apples Can You Put into the Basket/README_EN.md +++ b/solution/1100-1199/1196.How Many Apples Can You Put into the Basket/README_EN.md @@ -1,4 +1,4 @@ -# [1196. How Many Apples Can You Put into the Basket](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket) +# [1196. How Many Apples Can You Put into the Basket 🔒](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket) [中文文档](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README.md) diff --git a/solution/1100-1199/1197.Minimum Knight Moves/README.md b/solution/1100-1199/1197.Minimum Knight Moves/README.md index 00e1435cf1bb3..65a7d0dada618 100644 --- a/solution/1100-1199/1197.Minimum Knight Moves/README.md +++ b/solution/1100-1199/1197.Minimum Knight Moves/README.md @@ -1,4 +1,4 @@ -# [1197. 进击的骑士](https://leetcode.cn/problems/minimum-knight-moves) +# [1197. 进击的骑士 🔒](https://leetcode.cn/problems/minimum-knight-moves) [English Version](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README_EN.md) diff --git a/solution/1100-1199/1197.Minimum Knight Moves/README_EN.md b/solution/1100-1199/1197.Minimum Knight Moves/README_EN.md index 00f5a1dc8392c..cad6a3c04eb02 100644 --- a/solution/1100-1199/1197.Minimum Knight Moves/README_EN.md +++ b/solution/1100-1199/1197.Minimum Knight Moves/README_EN.md @@ -1,4 +1,4 @@ -# [1197. Minimum Knight Moves](https://leetcode.com/problems/minimum-knight-moves) +# [1197. Minimum Knight Moves 🔒](https://leetcode.com/problems/minimum-knight-moves) [中文文档](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md) diff --git a/solution/1100-1199/1198.Find Smallest Common Element in All Rows/README.md b/solution/1100-1199/1198.Find Smallest Common Element in All Rows/README.md index 7366d66ac28a7..8d654860aef65 100644 --- a/solution/1100-1199/1198.Find Smallest Common Element in All Rows/README.md +++ b/solution/1100-1199/1198.Find Smallest Common Element in All Rows/README.md @@ -1,4 +1,4 @@ -# [1198. 找出所有行中最小公共元素](https://leetcode.cn/problems/find-smallest-common-element-in-all-rows) +# [1198. 找出所有行中最小公共元素 🔒](https://leetcode.cn/problems/find-smallest-common-element-in-all-rows) [English Version](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README_EN.md) diff --git a/solution/1100-1199/1198.Find Smallest Common Element in All Rows/README_EN.md b/solution/1100-1199/1198.Find Smallest Common Element in All Rows/README_EN.md index 40f8cdc6ce2db..6561552e528b1 100644 --- a/solution/1100-1199/1198.Find Smallest Common Element in All Rows/README_EN.md +++ b/solution/1100-1199/1198.Find Smallest Common Element in All Rows/README_EN.md @@ -1,4 +1,4 @@ -# [1198. Find Smallest Common Element in All Rows](https://leetcode.com/problems/find-smallest-common-element-in-all-rows) +# [1198. Find Smallest Common Element in All Rows 🔒](https://leetcode.com/problems/find-smallest-common-element-in-all-rows) [中文文档](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README.md) diff --git a/solution/1100-1199/1199.Minimum Time to Build Blocks/README.md b/solution/1100-1199/1199.Minimum Time to Build Blocks/README.md index 137d76bcaf2dd..dd08875a8510a 100644 --- a/solution/1100-1199/1199.Minimum Time to Build Blocks/README.md +++ b/solution/1100-1199/1199.Minimum Time to Build Blocks/README.md @@ -1,4 +1,4 @@ -# [1199. 建造街区的最短时间](https://leetcode.cn/problems/minimum-time-to-build-blocks) +# [1199. 建造街区的最短时间 🔒](https://leetcode.cn/problems/minimum-time-to-build-blocks) [English Version](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README_EN.md) diff --git a/solution/1100-1199/1199.Minimum Time to Build Blocks/README_EN.md b/solution/1100-1199/1199.Minimum Time to Build Blocks/README_EN.md index 3e9c801989f44..12223c180437d 100644 --- a/solution/1100-1199/1199.Minimum Time to Build Blocks/README_EN.md +++ b/solution/1100-1199/1199.Minimum Time to Build Blocks/README_EN.md @@ -1,4 +1,4 @@ -# [1199. Minimum Time to Build Blocks](https://leetcode.com/problems/minimum-time-to-build-blocks) +# [1199. Minimum Time to Build Blocks 🔒](https://leetcode.com/problems/minimum-time-to-build-blocks) [中文文档](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README.md) diff --git a/solution/1200-1299/1205.Monthly Transactions II/README.md b/solution/1200-1299/1205.Monthly Transactions II/README.md index 75e4a26931a40..59d83f6064b05 100644 --- a/solution/1200-1299/1205.Monthly Transactions II/README.md +++ b/solution/1200-1299/1205.Monthly Transactions II/README.md @@ -1,4 +1,4 @@ -# [1205. 每月交易 II](https://leetcode.cn/problems/monthly-transactions-ii) +# [1205. 每月交易 II 🔒](https://leetcode.cn/problems/monthly-transactions-ii) [English Version](/solution/1200-1299/1205.Monthly%20Transactions%20II/README_EN.md) diff --git a/solution/1200-1299/1205.Monthly Transactions II/README_EN.md b/solution/1200-1299/1205.Monthly Transactions II/README_EN.md index c4b0717748e1d..c31a127eaba06 100644 --- a/solution/1200-1299/1205.Monthly Transactions II/README_EN.md +++ b/solution/1200-1299/1205.Monthly Transactions II/README_EN.md @@ -1,4 +1,4 @@ -# [1205. Monthly Transactions II](https://leetcode.com/problems/monthly-transactions-ii) +# [1205. Monthly Transactions II 🔒](https://leetcode.com/problems/monthly-transactions-ii) [中文文档](/solution/1200-1299/1205.Monthly%20Transactions%20II/README.md) diff --git a/solution/1200-1299/1212.Team Scores in Football Tournament/README.md b/solution/1200-1299/1212.Team Scores in Football Tournament/README.md index 75ecf9f0a7109..c1ac6330cc153 100644 --- a/solution/1200-1299/1212.Team Scores in Football Tournament/README.md +++ b/solution/1200-1299/1212.Team Scores in Football Tournament/README.md @@ -1,4 +1,4 @@ -# [1212. 查询球队积分](https://leetcode.cn/problems/team-scores-in-football-tournament) +# [1212. 查询球队积分 🔒](https://leetcode.cn/problems/team-scores-in-football-tournament) [English Version](/solution/1200-1299/1212.Team%20Scores%20in%20Football%20Tournament/README_EN.md) diff --git a/solution/1200-1299/1212.Team Scores in Football Tournament/README_EN.md b/solution/1200-1299/1212.Team Scores in Football Tournament/README_EN.md index 2e455f2cb1556..102ae49b96e57 100644 --- a/solution/1200-1299/1212.Team Scores in Football Tournament/README_EN.md +++ b/solution/1200-1299/1212.Team Scores in Football Tournament/README_EN.md @@ -1,4 +1,4 @@ -# [1212. Team Scores in Football Tournament](https://leetcode.com/problems/team-scores-in-football-tournament) +# [1212. Team Scores in Football Tournament 🔒](https://leetcode.com/problems/team-scores-in-football-tournament) [中文文档](/solution/1200-1299/1212.Team%20Scores%20in%20Football%20Tournament/README.md) diff --git a/solution/1200-1299/1213.Intersection of Three Sorted Arrays/README.md b/solution/1200-1299/1213.Intersection of Three Sorted Arrays/README.md index f51aa192b8576..4560bdbf4a317 100644 --- a/solution/1200-1299/1213.Intersection of Three Sorted Arrays/README.md +++ b/solution/1200-1299/1213.Intersection of Three Sorted Arrays/README.md @@ -1,4 +1,4 @@ -# [1213. 三个有序数组的交集](https://leetcode.cn/problems/intersection-of-three-sorted-arrays) +# [1213. 三个有序数组的交集 🔒](https://leetcode.cn/problems/intersection-of-three-sorted-arrays) [English Version](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README_EN.md) diff --git a/solution/1200-1299/1213.Intersection of Three Sorted Arrays/README_EN.md b/solution/1200-1299/1213.Intersection of Three Sorted Arrays/README_EN.md index c16fbde68b8b0..0e02ce23c3fdc 100644 --- a/solution/1200-1299/1213.Intersection of Three Sorted Arrays/README_EN.md +++ b/solution/1200-1299/1213.Intersection of Three Sorted Arrays/README_EN.md @@ -1,4 +1,4 @@ -# [1213. Intersection of Three Sorted Arrays](https://leetcode.com/problems/intersection-of-three-sorted-arrays) +# [1213. Intersection of Three Sorted Arrays 🔒](https://leetcode.com/problems/intersection-of-three-sorted-arrays) [中文文档](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README.md) diff --git a/solution/1200-1299/1214.Two Sum BSTs/README.md b/solution/1200-1299/1214.Two Sum BSTs/README.md index 477ba7bfa31d1..5048d79175d78 100644 --- a/solution/1200-1299/1214.Two Sum BSTs/README.md +++ b/solution/1200-1299/1214.Two Sum BSTs/README.md @@ -1,4 +1,4 @@ -# [1214. 查找两棵二叉搜索树之和](https://leetcode.cn/problems/two-sum-bsts) +# [1214. 查找两棵二叉搜索树之和 🔒](https://leetcode.cn/problems/two-sum-bsts) [English Version](/solution/1200-1299/1214.Two%20Sum%20BSTs/README_EN.md) diff --git a/solution/1200-1299/1214.Two Sum BSTs/README_EN.md b/solution/1200-1299/1214.Two Sum BSTs/README_EN.md index 00cf7713b8f56..267357355eb08 100644 --- a/solution/1200-1299/1214.Two Sum BSTs/README_EN.md +++ b/solution/1200-1299/1214.Two Sum BSTs/README_EN.md @@ -1,4 +1,4 @@ -# [1214. Two Sum BSTs](https://leetcode.com/problems/two-sum-bsts) +# [1214. Two Sum BSTs 🔒](https://leetcode.com/problems/two-sum-bsts) [中文文档](/solution/1200-1299/1214.Two%20Sum%20BSTs/README.md) diff --git a/solution/1200-1299/1215.Stepping Numbers/README.md b/solution/1200-1299/1215.Stepping Numbers/README.md index bb988ca075874..1dc8b7f32db61 100644 --- a/solution/1200-1299/1215.Stepping Numbers/README.md +++ b/solution/1200-1299/1215.Stepping Numbers/README.md @@ -1,4 +1,4 @@ -# [1215. 步进数](https://leetcode.cn/problems/stepping-numbers) +# [1215. 步进数 🔒](https://leetcode.cn/problems/stepping-numbers) [English Version](/solution/1200-1299/1215.Stepping%20Numbers/README_EN.md) diff --git a/solution/1200-1299/1215.Stepping Numbers/README_EN.md b/solution/1200-1299/1215.Stepping Numbers/README_EN.md index 7421eb62f8d95..135429002d2e3 100644 --- a/solution/1200-1299/1215.Stepping Numbers/README_EN.md +++ b/solution/1200-1299/1215.Stepping Numbers/README_EN.md @@ -1,4 +1,4 @@ -# [1215. Stepping Numbers](https://leetcode.com/problems/stepping-numbers) +# [1215. Stepping Numbers 🔒](https://leetcode.com/problems/stepping-numbers) [中文文档](/solution/1200-1299/1215.Stepping%20Numbers/README.md) diff --git a/solution/1200-1299/1216.Valid Palindrome III/README.md b/solution/1200-1299/1216.Valid Palindrome III/README.md index afcaaf9372f7d..7b3dcf489985b 100644 --- a/solution/1200-1299/1216.Valid Palindrome III/README.md +++ b/solution/1200-1299/1216.Valid Palindrome III/README.md @@ -1,4 +1,4 @@ -# [1216. 验证回文串 III](https://leetcode.cn/problems/valid-palindrome-iii) +# [1216. 验证回文串 III 🔒](https://leetcode.cn/problems/valid-palindrome-iii) [English Version](/solution/1200-1299/1216.Valid%20Palindrome%20III/README_EN.md) diff --git a/solution/1200-1299/1216.Valid Palindrome III/README_EN.md b/solution/1200-1299/1216.Valid Palindrome III/README_EN.md index ab56d4aa64cfa..b57eaf5841884 100644 --- a/solution/1200-1299/1216.Valid Palindrome III/README_EN.md +++ b/solution/1200-1299/1216.Valid Palindrome III/README_EN.md @@ -1,4 +1,4 @@ -# [1216. Valid Palindrome III](https://leetcode.com/problems/valid-palindrome-iii) +# [1216. Valid Palindrome III 🔒](https://leetcode.com/problems/valid-palindrome-iii) [中文文档](/solution/1200-1299/1216.Valid%20Palindrome%20III/README.md) diff --git a/solution/1200-1299/1225.Report Contiguous Dates/README.md b/solution/1200-1299/1225.Report Contiguous Dates/README.md index 41ce3ec3beb11..40d06f43eb620 100644 --- a/solution/1200-1299/1225.Report Contiguous Dates/README.md +++ b/solution/1200-1299/1225.Report Contiguous Dates/README.md @@ -1,4 +1,4 @@ -# [1225. 报告系统状态的连续日期](https://leetcode.cn/problems/report-contiguous-dates) +# [1225. 报告系统状态的连续日期 🔒](https://leetcode.cn/problems/report-contiguous-dates) [English Version](/solution/1200-1299/1225.Report%20Contiguous%20Dates/README_EN.md) diff --git a/solution/1200-1299/1225.Report Contiguous Dates/README_EN.md b/solution/1200-1299/1225.Report Contiguous Dates/README_EN.md index 40fe0fb15e45a..15acee29dd589 100644 --- a/solution/1200-1299/1225.Report Contiguous Dates/README_EN.md +++ b/solution/1200-1299/1225.Report Contiguous Dates/README_EN.md @@ -1,4 +1,4 @@ -# [1225. Report Contiguous Dates](https://leetcode.com/problems/report-contiguous-dates) +# [1225. Report Contiguous Dates 🔒](https://leetcode.com/problems/report-contiguous-dates) [中文文档](/solution/1200-1299/1225.Report%20Contiguous%20Dates/README.md) diff --git a/solution/1200-1299/1228.Missing Number In Arithmetic Progression/README.md b/solution/1200-1299/1228.Missing Number In Arithmetic Progression/README.md index 1fa174308465d..ff26e757ae380 100644 --- a/solution/1200-1299/1228.Missing Number In Arithmetic Progression/README.md +++ b/solution/1200-1299/1228.Missing Number In Arithmetic Progression/README.md @@ -1,4 +1,4 @@ -# [1228. 等差数列中缺失的数字](https://leetcode.cn/problems/missing-number-in-arithmetic-progression) +# [1228. 等差数列中缺失的数字 🔒](https://leetcode.cn/problems/missing-number-in-arithmetic-progression) [English Version](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README_EN.md) diff --git a/solution/1200-1299/1228.Missing Number In Arithmetic Progression/README_EN.md b/solution/1200-1299/1228.Missing Number In Arithmetic Progression/README_EN.md index 19faa2705f802..a99559e74a911 100644 --- a/solution/1200-1299/1228.Missing Number In Arithmetic Progression/README_EN.md +++ b/solution/1200-1299/1228.Missing Number In Arithmetic Progression/README_EN.md @@ -1,4 +1,4 @@ -# [1228. Missing Number In Arithmetic Progression](https://leetcode.com/problems/missing-number-in-arithmetic-progression) +# [1228. Missing Number In Arithmetic Progression 🔒](https://leetcode.com/problems/missing-number-in-arithmetic-progression) [中文文档](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README.md) diff --git a/solution/1200-1299/1229.Meeting Scheduler/README.md b/solution/1200-1299/1229.Meeting Scheduler/README.md index 8deaf65a77157..ca02ffc153eb4 100644 --- a/solution/1200-1299/1229.Meeting Scheduler/README.md +++ b/solution/1200-1299/1229.Meeting Scheduler/README.md @@ -1,4 +1,4 @@ -# [1229. 安排会议日程](https://leetcode.cn/problems/meeting-scheduler) +# [1229. 安排会议日程 🔒](https://leetcode.cn/problems/meeting-scheduler) [English Version](/solution/1200-1299/1229.Meeting%20Scheduler/README_EN.md) diff --git a/solution/1200-1299/1229.Meeting Scheduler/README_EN.md b/solution/1200-1299/1229.Meeting Scheduler/README_EN.md index 9658e9e45058c..5edf37bcb1bcb 100644 --- a/solution/1200-1299/1229.Meeting Scheduler/README_EN.md +++ b/solution/1200-1299/1229.Meeting Scheduler/README_EN.md @@ -1,4 +1,4 @@ -# [1229. Meeting Scheduler](https://leetcode.com/problems/meeting-scheduler) +# [1229. Meeting Scheduler 🔒](https://leetcode.com/problems/meeting-scheduler) [中文文档](/solution/1200-1299/1229.Meeting%20Scheduler/README.md) diff --git a/solution/1200-1299/1230.Toss Strange Coins/README.md b/solution/1200-1299/1230.Toss Strange Coins/README.md index d4e92584682bd..def6f5c9e3c69 100644 --- a/solution/1200-1299/1230.Toss Strange Coins/README.md +++ b/solution/1200-1299/1230.Toss Strange Coins/README.md @@ -1,4 +1,4 @@ -# [1230. 抛掷硬币](https://leetcode.cn/problems/toss-strange-coins) +# [1230. 抛掷硬币 🔒](https://leetcode.cn/problems/toss-strange-coins) [English Version](/solution/1200-1299/1230.Toss%20Strange%20Coins/README_EN.md) diff --git a/solution/1200-1299/1230.Toss Strange Coins/README_EN.md b/solution/1200-1299/1230.Toss Strange Coins/README_EN.md index cf65b2de85063..84833675cdffa 100644 --- a/solution/1200-1299/1230.Toss Strange Coins/README_EN.md +++ b/solution/1200-1299/1230.Toss Strange Coins/README_EN.md @@ -1,4 +1,4 @@ -# [1230. Toss Strange Coins](https://leetcode.com/problems/toss-strange-coins) +# [1230. Toss Strange Coins 🔒](https://leetcode.com/problems/toss-strange-coins) [中文文档](/solution/1200-1299/1230.Toss%20Strange%20Coins/README.md) diff --git a/solution/1200-1299/1231.Divide Chocolate/README.md b/solution/1200-1299/1231.Divide Chocolate/README.md index fa53f2108e686..d2975739680ea 100644 --- a/solution/1200-1299/1231.Divide Chocolate/README.md +++ b/solution/1200-1299/1231.Divide Chocolate/README.md @@ -1,4 +1,4 @@ -# [1231. 分享巧克力](https://leetcode.cn/problems/divide-chocolate) +# [1231. 分享巧克力 🔒](https://leetcode.cn/problems/divide-chocolate) [English Version](/solution/1200-1299/1231.Divide%20Chocolate/README_EN.md) diff --git a/solution/1200-1299/1231.Divide Chocolate/README_EN.md b/solution/1200-1299/1231.Divide Chocolate/README_EN.md index ff2657d5193b2..1d91628c81c09 100644 --- a/solution/1200-1299/1231.Divide Chocolate/README_EN.md +++ b/solution/1200-1299/1231.Divide Chocolate/README_EN.md @@ -1,4 +1,4 @@ -# [1231. Divide Chocolate](https://leetcode.com/problems/divide-chocolate) +# [1231. Divide Chocolate 🔒](https://leetcode.com/problems/divide-chocolate) [中文文档](/solution/1200-1299/1231.Divide%20Chocolate/README.md) diff --git a/solution/1200-1299/1236.Web Crawler/README.md b/solution/1200-1299/1236.Web Crawler/README.md index 63016eba6b6d9..1744abf9d1eaf 100644 --- a/solution/1200-1299/1236.Web Crawler/README.md +++ b/solution/1200-1299/1236.Web Crawler/README.md @@ -1,4 +1,4 @@ -# [1236. 网络爬虫](https://leetcode.cn/problems/web-crawler) +# [1236. 网络爬虫 🔒](https://leetcode.cn/problems/web-crawler) [English Version](/solution/1200-1299/1236.Web%20Crawler/README_EN.md) diff --git a/solution/1200-1299/1236.Web Crawler/README_EN.md b/solution/1200-1299/1236.Web Crawler/README_EN.md index 2fbe363d2deea..ced4bb8d7ef7c 100644 --- a/solution/1200-1299/1236.Web Crawler/README_EN.md +++ b/solution/1200-1299/1236.Web Crawler/README_EN.md @@ -1,4 +1,4 @@ -# [1236. Web Crawler](https://leetcode.com/problems/web-crawler) +# [1236. Web Crawler 🔒](https://leetcode.com/problems/web-crawler) [中文文档](/solution/1200-1299/1236.Web%20Crawler/README.md) diff --git a/solution/1200-1299/1241.Number of Comments per Post/README.md b/solution/1200-1299/1241.Number of Comments per Post/README.md index f300dda40bfcb..bf939087f9d0b 100644 --- a/solution/1200-1299/1241.Number of Comments per Post/README.md +++ b/solution/1200-1299/1241.Number of Comments per Post/README.md @@ -1,4 +1,4 @@ -# [1241. 每个帖子的评论数](https://leetcode.cn/problems/number-of-comments-per-post) +# [1241. 每个帖子的评论数 🔒](https://leetcode.cn/problems/number-of-comments-per-post) [English Version](/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README_EN.md) diff --git a/solution/1200-1299/1241.Number of Comments per Post/README_EN.md b/solution/1200-1299/1241.Number of Comments per Post/README_EN.md index 174fc8c26017d..f87b1a1500d5a 100644 --- a/solution/1200-1299/1241.Number of Comments per Post/README_EN.md +++ b/solution/1200-1299/1241.Number of Comments per Post/README_EN.md @@ -1,4 +1,4 @@ -# [1241. Number of Comments per Post](https://leetcode.com/problems/number-of-comments-per-post) +# [1241. Number of Comments per Post 🔒](https://leetcode.com/problems/number-of-comments-per-post) [中文文档](/solution/1200-1299/1241.Number%20of%20Comments%20per%20Post/README.md) diff --git a/solution/1200-1299/1242.Web Crawler Multithreaded/README.md b/solution/1200-1299/1242.Web Crawler Multithreaded/README.md index 6d846fffdab96..9cc1782837132 100644 --- a/solution/1200-1299/1242.Web Crawler Multithreaded/README.md +++ b/solution/1200-1299/1242.Web Crawler Multithreaded/README.md @@ -1,4 +1,4 @@ -# [1242. 多线程网页爬虫](https://leetcode.cn/problems/web-crawler-multithreaded) +# [1242. 多线程网页爬虫 🔒](https://leetcode.cn/problems/web-crawler-multithreaded) [English Version](/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README_EN.md) diff --git a/solution/1200-1299/1242.Web Crawler Multithreaded/README_EN.md b/solution/1200-1299/1242.Web Crawler Multithreaded/README_EN.md index 68292058e57c3..7015c50bc0c04 100644 --- a/solution/1200-1299/1242.Web Crawler Multithreaded/README_EN.md +++ b/solution/1200-1299/1242.Web Crawler Multithreaded/README_EN.md @@ -1,4 +1,4 @@ -# [1242. Web Crawler Multithreaded](https://leetcode.com/problems/web-crawler-multithreaded) +# [1242. Web Crawler Multithreaded 🔒](https://leetcode.com/problems/web-crawler-multithreaded) [中文文档](/solution/1200-1299/1242.Web%20Crawler%20Multithreaded/README.md) diff --git a/solution/1200-1299/1243.Array Transformation/README.md b/solution/1200-1299/1243.Array Transformation/README.md index f360a417c1bdb..652ade3c422e2 100644 --- a/solution/1200-1299/1243.Array Transformation/README.md +++ b/solution/1200-1299/1243.Array Transformation/README.md @@ -1,4 +1,4 @@ -# [1243. 数组变换](https://leetcode.cn/problems/array-transformation) +# [1243. 数组变换 🔒](https://leetcode.cn/problems/array-transformation) [English Version](/solution/1200-1299/1243.Array%20Transformation/README_EN.md) diff --git a/solution/1200-1299/1243.Array Transformation/README_EN.md b/solution/1200-1299/1243.Array Transformation/README_EN.md index 3c3d2cc425a40..b0b54ff8921d8 100644 --- a/solution/1200-1299/1243.Array Transformation/README_EN.md +++ b/solution/1200-1299/1243.Array Transformation/README_EN.md @@ -1,4 +1,4 @@ -# [1243. Array Transformation](https://leetcode.com/problems/array-transformation) +# [1243. Array Transformation 🔒](https://leetcode.com/problems/array-transformation) [中文文档](/solution/1200-1299/1243.Array%20Transformation/README.md) diff --git a/solution/1200-1299/1244.Design A Leaderboard/README.md b/solution/1200-1299/1244.Design A Leaderboard/README.md index e2e58d31d01f5..d43a98d2eadf2 100644 --- a/solution/1200-1299/1244.Design A Leaderboard/README.md +++ b/solution/1200-1299/1244.Design A Leaderboard/README.md @@ -1,4 +1,4 @@ -# [1244. 力扣排行榜](https://leetcode.cn/problems/design-a-leaderboard) +# [1244. 力扣排行榜 🔒](https://leetcode.cn/problems/design-a-leaderboard) [English Version](/solution/1200-1299/1244.Design%20A%20Leaderboard/README_EN.md) diff --git a/solution/1200-1299/1244.Design A Leaderboard/README_EN.md b/solution/1200-1299/1244.Design A Leaderboard/README_EN.md index 4c90b23722b94..0dc6b89b2a61e 100644 --- a/solution/1200-1299/1244.Design A Leaderboard/README_EN.md +++ b/solution/1200-1299/1244.Design A Leaderboard/README_EN.md @@ -1,4 +1,4 @@ -# [1244. Design A Leaderboard](https://leetcode.com/problems/design-a-leaderboard) +# [1244. Design A Leaderboard 🔒](https://leetcode.com/problems/design-a-leaderboard) [中文文档](/solution/1200-1299/1244.Design%20A%20Leaderboard/README.md) diff --git a/solution/1200-1299/1245.Tree Diameter/README.md b/solution/1200-1299/1245.Tree Diameter/README.md index a7241d9054557..41d76bd6adee7 100644 --- a/solution/1200-1299/1245.Tree Diameter/README.md +++ b/solution/1200-1299/1245.Tree Diameter/README.md @@ -1,4 +1,4 @@ -# [1245. 树的直径](https://leetcode.cn/problems/tree-diameter) +# [1245. 树的直径 🔒](https://leetcode.cn/problems/tree-diameter) [English Version](/solution/1200-1299/1245.Tree%20Diameter/README_EN.md) @@ -69,7 +69,7 @@ 相似题目： -- [1522. N 叉树的直径](https://github.com/doocs/leetcode/blob/main/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md) +- [1522. N 叉树的直径 🔒](https://github.com/doocs/leetcode/blob/main/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md) diff --git a/solution/1200-1299/1245.Tree Diameter/README_EN.md b/solution/1200-1299/1245.Tree Diameter/README_EN.md index ab682379abc2f..90eeac3ba5bae 100644 --- a/solution/1200-1299/1245.Tree Diameter/README_EN.md +++ b/solution/1200-1299/1245.Tree Diameter/README_EN.md @@ -1,4 +1,4 @@ -# [1245. Tree Diameter](https://leetcode.com/problems/tree-diameter) +# [1245. Tree Diameter 🔒](https://leetcode.com/problems/tree-diameter) [中文文档](/solution/1200-1299/1245.Tree%20Diameter/README.md) diff --git a/solution/1200-1299/1246.Palindrome Removal/README.md b/solution/1200-1299/1246.Palindrome Removal/README.md index f045a3ec4bfdb..1cb4d0d6bbe34 100644 --- a/solution/1200-1299/1246.Palindrome Removal/README.md +++ b/solution/1200-1299/1246.Palindrome Removal/README.md @@ -1,4 +1,4 @@ -# [1246. 删除回文子数组](https://leetcode.cn/problems/palindrome-removal) +# [1246. 删除回文子数组 🔒](https://leetcode.cn/problems/palindrome-removal) [English Version](/solution/1200-1299/1246.Palindrome%20Removal/README_EN.md) diff --git a/solution/1200-1299/1246.Palindrome Removal/README_EN.md b/solution/1200-1299/1246.Palindrome Removal/README_EN.md index f4c0d4b847555..725e5bb427b82 100644 --- a/solution/1200-1299/1246.Palindrome Removal/README_EN.md +++ b/solution/1200-1299/1246.Palindrome Removal/README_EN.md @@ -1,4 +1,4 @@ -# [1246. Palindrome Removal](https://leetcode.com/problems/palindrome-removal) +# [1246. Palindrome Removal 🔒](https://leetcode.com/problems/palindrome-removal) [中文文档](/solution/1200-1299/1246.Palindrome%20Removal/README.md) diff --git a/solution/1200-1299/1256.Encode Number/README.md b/solution/1200-1299/1256.Encode Number/README.md index bf9b33d8c76a8..13f945656710f 100644 --- a/solution/1200-1299/1256.Encode Number/README.md +++ b/solution/1200-1299/1256.Encode Number/README.md @@ -1,4 +1,4 @@ -# [1256. 加密数字](https://leetcode.cn/problems/encode-number) +# [1256. 加密数字 🔒](https://leetcode.cn/problems/encode-number) [English Version](/solution/1200-1299/1256.Encode%20Number/README_EN.md) diff --git a/solution/1200-1299/1256.Encode Number/README_EN.md b/solution/1200-1299/1256.Encode Number/README_EN.md index 0889039a4c3d2..6afc00aacb268 100644 --- a/solution/1200-1299/1256.Encode Number/README_EN.md +++ b/solution/1200-1299/1256.Encode Number/README_EN.md @@ -1,4 +1,4 @@ -# [1256. Encode Number](https://leetcode.com/problems/encode-number) +# [1256. Encode Number 🔒](https://leetcode.com/problems/encode-number) [中文文档](/solution/1200-1299/1256.Encode%20Number/README.md) diff --git a/solution/1200-1299/1257.Smallest Common Region/README.md b/solution/1200-1299/1257.Smallest Common Region/README.md index 5b217bfcafc16..8e4f4e1bb3186 100644 --- a/solution/1200-1299/1257.Smallest Common Region/README.md +++ b/solution/1200-1299/1257.Smallest Common Region/README.md @@ -1,4 +1,4 @@ -# [1257. 最小公共区域](https://leetcode.cn/problems/smallest-common-region) +# [1257. 最小公共区域 🔒](https://leetcode.cn/problems/smallest-common-region) [English Version](/solution/1200-1299/1257.Smallest%20Common%20Region/README_EN.md) diff --git a/solution/1200-1299/1257.Smallest Common Region/README_EN.md b/solution/1200-1299/1257.Smallest Common Region/README_EN.md index ba4356f6d88a9..ba2c59412e36d 100644 --- a/solution/1200-1299/1257.Smallest Common Region/README_EN.md +++ b/solution/1200-1299/1257.Smallest Common Region/README_EN.md @@ -1,4 +1,4 @@ -# [1257. Smallest Common Region](https://leetcode.com/problems/smallest-common-region) +# [1257. Smallest Common Region 🔒](https://leetcode.com/problems/smallest-common-region) [中文文档](/solution/1200-1299/1257.Smallest%20Common%20Region/README.md) diff --git a/solution/1200-1299/1258.Synonymous Sentences/README.md b/solution/1200-1299/1258.Synonymous Sentences/README.md index 91faa16889017..5f951462c7dac 100644 --- a/solution/1200-1299/1258.Synonymous Sentences/README.md +++ b/solution/1200-1299/1258.Synonymous Sentences/README.md @@ -1,4 +1,4 @@ -# [1258. 近义词句子](https://leetcode.cn/problems/synonymous-sentences) +# [1258. 近义词句子 🔒](https://leetcode.cn/problems/synonymous-sentences) [English Version](/solution/1200-1299/1258.Synonymous%20Sentences/README_EN.md) diff --git a/solution/1200-1299/1258.Synonymous Sentences/README_EN.md b/solution/1200-1299/1258.Synonymous Sentences/README_EN.md index 91637a489bc97..939615fd0ca96 100644 --- a/solution/1200-1299/1258.Synonymous Sentences/README_EN.md +++ b/solution/1200-1299/1258.Synonymous Sentences/README_EN.md @@ -1,4 +1,4 @@ -# [1258. Synonymous Sentences](https://leetcode.com/problems/synonymous-sentences) +# [1258. Synonymous Sentences 🔒](https://leetcode.com/problems/synonymous-sentences) [中文文档](/solution/1200-1299/1258.Synonymous%20Sentences/README.md) diff --git a/solution/1200-1299/1259.Handshakes That Don't Cross/README.md b/solution/1200-1299/1259.Handshakes That Don't Cross/README.md index 3fa5ed6cfed01..04a970501c2e0 100644 --- a/solution/1200-1299/1259.Handshakes That Don't Cross/README.md +++ b/solution/1200-1299/1259.Handshakes That Don't Cross/README.md @@ -1,4 +1,4 @@ -# [1259. 不相交的握手](https://leetcode.cn/problems/handshakes-that-dont-cross) +# [1259. 不相交的握手 🔒](https://leetcode.cn/problems/handshakes-that-dont-cross) [English Version](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README_EN.md) diff --git a/solution/1200-1299/1259.Handshakes That Don't Cross/README_EN.md b/solution/1200-1299/1259.Handshakes That Don't Cross/README_EN.md index f1a3fe8cb8f57..d826f2c620240 100644 --- a/solution/1200-1299/1259.Handshakes That Don't Cross/README_EN.md +++ b/solution/1200-1299/1259.Handshakes That Don't Cross/README_EN.md @@ -1,4 +1,4 @@ -# [1259. Handshakes That Don't Cross](https://leetcode.com/problems/handshakes-that-dont-cross) +# [1259. Handshakes That Don't Cross 🔒](https://leetcode.com/problems/handshakes-that-dont-cross) [中文文档](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README.md) diff --git a/solution/1200-1299/1264.Page Recommendations/README.md b/solution/1200-1299/1264.Page Recommendations/README.md index 42fb0ff289846..74f97dbc3c5b5 100644 --- a/solution/1200-1299/1264.Page Recommendations/README.md +++ b/solution/1200-1299/1264.Page Recommendations/README.md @@ -1,4 +1,4 @@ -# [1264. 页面推荐](https://leetcode.cn/problems/page-recommendations) +# [1264. 页面推荐 🔒](https://leetcode.cn/problems/page-recommendations) [English Version](/solution/1200-1299/1264.Page%20Recommendations/README_EN.md) diff --git a/solution/1200-1299/1264.Page Recommendations/README_EN.md b/solution/1200-1299/1264.Page Recommendations/README_EN.md index 15b3475a57e15..23a3c8a250682 100644 --- a/solution/1200-1299/1264.Page Recommendations/README_EN.md +++ b/solution/1200-1299/1264.Page Recommendations/README_EN.md @@ -1,4 +1,4 @@ -# [1264. Page Recommendations](https://leetcode.com/problems/page-recommendations) +# [1264. Page Recommendations 🔒](https://leetcode.com/problems/page-recommendations) [中文文档](/solution/1200-1299/1264.Page%20Recommendations/README.md) diff --git a/solution/1200-1299/1265.Print Immutable Linked List in Reverse/README.md b/solution/1200-1299/1265.Print Immutable Linked List in Reverse/README.md index 30306d7955763..36f294e6685e5 100644 --- a/solution/1200-1299/1265.Print Immutable Linked List in Reverse/README.md +++ b/solution/1200-1299/1265.Print Immutable Linked List in Reverse/README.md @@ -1,4 +1,4 @@ -# [1265. 逆序打印不可变链表](https://leetcode.cn/problems/print-immutable-linked-list-in-reverse) +# [1265. 逆序打印不可变链表 🔒](https://leetcode.cn/problems/print-immutable-linked-list-in-reverse) [English Version](/solution/1200-1299/1265.Print%20Immutable%20Linked%20List%20in%20Reverse/README_EN.md) diff --git a/solution/1200-1299/1265.Print Immutable Linked List in Reverse/README_EN.md b/solution/1200-1299/1265.Print Immutable Linked List in Reverse/README_EN.md index 35033bc5f2eab..8aaa432665894 100644 --- a/solution/1200-1299/1265.Print Immutable Linked List in Reverse/README_EN.md +++ b/solution/1200-1299/1265.Print Immutable Linked List in Reverse/README_EN.md @@ -1,4 +1,4 @@ -# [1265. Print Immutable Linked List in Reverse](https://leetcode.com/problems/print-immutable-linked-list-in-reverse) +# [1265. Print Immutable Linked List in Reverse 🔒](https://leetcode.com/problems/print-immutable-linked-list-in-reverse) [中文文档](/solution/1200-1299/1265.Print%20Immutable%20Linked%20List%20in%20Reverse/README.md) diff --git a/solution/1200-1299/1270.All People Report to the Given Manager/README.md b/solution/1200-1299/1270.All People Report to the Given Manager/README.md index e0f81b2441247..d76e4386febfc 100644 --- a/solution/1200-1299/1270.All People Report to the Given Manager/README.md +++ b/solution/1200-1299/1270.All People Report to the Given Manager/README.md @@ -1,4 +1,4 @@ -# [1270. 向公司 CEO 汇报工作的所有人](https://leetcode.cn/problems/all-people-report-to-the-given-manager) +# [1270. 向公司 CEO 汇报工作的所有人 🔒](https://leetcode.cn/problems/all-people-report-to-the-given-manager) [English Version](/solution/1200-1299/1270.All%20People%20Report%20to%20the%20Given%20Manager/README_EN.md) diff --git a/solution/1200-1299/1270.All People Report to the Given Manager/README_EN.md b/solution/1200-1299/1270.All People Report to the Given Manager/README_EN.md index b7aab9141572f..d0fd886d142d1 100644 --- a/solution/1200-1299/1270.All People Report to the Given Manager/README_EN.md +++ b/solution/1200-1299/1270.All People Report to the Given Manager/README_EN.md @@ -1,4 +1,4 @@ -# [1270. All People Report to the Given Manager](https://leetcode.com/problems/all-people-report-to-the-given-manager) +# [1270. All People Report to the Given Manager 🔒](https://leetcode.com/problems/all-people-report-to-the-given-manager) [中文文档](/solution/1200-1299/1270.All%20People%20Report%20to%20the%20Given%20Manager/README.md) diff --git a/solution/1200-1299/1271.Hexspeak/README.md b/solution/1200-1299/1271.Hexspeak/README.md index cdb0e00d83e22..132289d89684b 100644 --- a/solution/1200-1299/1271.Hexspeak/README.md +++ b/solution/1200-1299/1271.Hexspeak/README.md @@ -1,4 +1,4 @@ -# [1271. 十六进制魔术数字](https://leetcode.cn/problems/hexspeak) +# [1271. 十六进制魔术数字 🔒](https://leetcode.cn/problems/hexspeak) [English Version](/solution/1200-1299/1271.Hexspeak/README_EN.md) diff --git a/solution/1200-1299/1271.Hexspeak/README_EN.md b/solution/1200-1299/1271.Hexspeak/README_EN.md index 1c120bee9780d..47ec040f4b0b2 100644 --- a/solution/1200-1299/1271.Hexspeak/README_EN.md +++ b/solution/1200-1299/1271.Hexspeak/README_EN.md @@ -1,6 +1,6 @@ -# [1271. Hexspeak](https://leetcode.com/problems/hexspeak) +# [1271. Hexspeak 🔒](https://leetcode.com/problems/hexspeak) -[中文文档](/solution/1200-1299/1271.Hexspeak/README.md) +[中文文档](/solution/1200-1299/1271.Hexspeak 🔒/README.md) @@ -47,7 +47,7 @@ The time complexity is $O(\log n)$, where $n$ is the size of the decimal number ```python class Solution: - def toHexspeak(self, num: str) -> str: + def toHexspeak 🔒(self, num: str) -> str: s = set('ABCDEFIO') t = hex(int(num))[2:].upper().replace('0', 'O').replace('1', 'I') return t if all(c in s for c in t) else 'ERROR' @@ -57,7 +57,7 @@ class Solution: class Solution { private static final Set S = Set.of('A', 'B', 'C', 'D', 'E', 'F', 'I', 'O'); - public String toHexspeak(String num) { + public String toHexspeak 🔒(String num) { String t = Long.toHexString(Long.valueOf(num)).toUpperCase().replace("0", "O").replace("1", "I"); for (char c : t.toCharArray()) { @@ -73,7 +73,7 @@ class Solution { ```cpp class Solution { public: - string toHexspeak(string num) { + string toHexspeak 🔒(string num) { stringstream ss; ss << hex << stol(num); string t = ss.str(); @@ -92,7 +92,7 @@ public: ``` ```go -func toHexspeak(num string) string { +func toHexspeak 🔒(num string) string { x, _ := strconv.Atoi(num) t := strings.ToUpper(fmt.Sprintf("%x", x)) t = strings.ReplaceAll(t, "0", "O") diff --git a/solution/1200-1299/1272.Remove Interval/README.md b/solution/1200-1299/1272.Remove Interval/README.md index fa37c2d348b12..e4ae0bece0090 100644 --- a/solution/1200-1299/1272.Remove Interval/README.md +++ b/solution/1200-1299/1272.Remove Interval/README.md @@ -1,4 +1,4 @@ -# [1272. 删除区间](https://leetcode.cn/problems/remove-interval) +# [1272. 删除区间 🔒](https://leetcode.cn/problems/remove-interval) [English Version](/solution/1200-1299/1272.Remove%20Interval/README_EN.md) diff --git a/solution/1200-1299/1272.Remove Interval/README_EN.md b/solution/1200-1299/1272.Remove Interval/README_EN.md index 0b8e2be8aa908..88f49109c8883 100644 --- a/solution/1200-1299/1272.Remove Interval/README_EN.md +++ b/solution/1200-1299/1272.Remove Interval/README_EN.md @@ -1,4 +1,4 @@ -# [1272. Remove Interval](https://leetcode.com/problems/remove-interval) +# [1272. Remove Interval 🔒](https://leetcode.com/problems/remove-interval) [中文文档](/solution/1200-1299/1272.Remove%20Interval/README.md) diff --git a/solution/1200-1299/1273.Delete Tree Nodes/README.md b/solution/1200-1299/1273.Delete Tree Nodes/README.md index b1050b7b30180..53684460c7adc 100644 --- a/solution/1200-1299/1273.Delete Tree Nodes/README.md +++ b/solution/1200-1299/1273.Delete Tree Nodes/README.md @@ -1,4 +1,4 @@ -# [1273. 删除树节点](https://leetcode.cn/problems/delete-tree-nodes) +# [1273. 删除树节点 🔒](https://leetcode.cn/problems/delete-tree-nodes) [English Version](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README_EN.md) diff --git a/solution/1200-1299/1273.Delete Tree Nodes/README_EN.md b/solution/1200-1299/1273.Delete Tree Nodes/README_EN.md index e1ac72e49dc74..6c7f28ace3f0b 100644 --- a/solution/1200-1299/1273.Delete Tree Nodes/README_EN.md +++ b/solution/1200-1299/1273.Delete Tree Nodes/README_EN.md @@ -1,4 +1,4 @@ -# [1273. Delete Tree Nodes](https://leetcode.com/problems/delete-tree-nodes) +# [1273. Delete Tree Nodes 🔒](https://leetcode.com/problems/delete-tree-nodes) [中文文档](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README.md) diff --git a/solution/1200-1299/1274.Number of Ships in a Rectangle/README.md b/solution/1200-1299/1274.Number of Ships in a Rectangle/README.md index 4f3163ae1025a..7b9b255dbe20e 100644 --- a/solution/1200-1299/1274.Number of Ships in a Rectangle/README.md +++ b/solution/1200-1299/1274.Number of Ships in a Rectangle/README.md @@ -1,4 +1,4 @@ -# [1274. 矩形内船只的数目](https://leetcode.cn/problems/number-of-ships-in-a-rectangle) +# [1274. 矩形内船只的数目 🔒](https://leetcode.cn/problems/number-of-ships-in-a-rectangle) [English Version](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README_EN.md) @@ -55,7 +55,7 @@ ships = [[1,1],[2,2],[3,3],[5,5]], topRight = [4,4], bottomLeft = [0,0] ### 方法一：递归 + 分治 -由于矩形内最多只有 $10$ 艘船，所以我们可以将矩形划分为四个子矩形，分别求出每个子矩形内船只的数目，然后将四个子矩形内船只的数目相加即可。如果一个子矩形内没有船只，那么就不需要再继续划分了。 +由于矩形内最多只有 $10$ 艘船，所以我们可以将矩形划分为四个子矩形，分别求出每个子矩形内船只的数目 🔒，然后将四个子矩形内船只的数目 🔒 相加即可。如果一个子矩形内没有船只，那么就不需要再继续划分了。 时间复杂度 $O(C \times \log \max(m, n))$，空间复杂度 $O(\log \max(m, n))$。其中 $C$ 为船只的数目，而 $m$ 和 $n$ 分别为矩形的长和宽。 diff --git a/solution/1200-1299/1274.Number of Ships in a Rectangle/README_EN.md b/solution/1200-1299/1274.Number of Ships in a Rectangle/README_EN.md index a444efecb08bd..350365da41f5a 100644 --- a/solution/1200-1299/1274.Number of Ships in a Rectangle/README_EN.md +++ b/solution/1200-1299/1274.Number of Ships in a Rectangle/README_EN.md @@ -1,4 +1,4 @@ -# [1274. Number of Ships in a Rectangle](https://leetcode.com/problems/number-of-ships-in-a-rectangle) +# [1274. Number of Ships in a Rectangle 🔒](https://leetcode.com/problems/number-of-ships-in-a-rectangle) [中文文档](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README.md) diff --git a/solution/1200-1299/1279.Traffic Light Controlled Intersection/README.md b/solution/1200-1299/1279.Traffic Light Controlled Intersection/README.md index 25f8f79f0397d..242bfb7e2e925 100644 --- a/solution/1200-1299/1279.Traffic Light Controlled Intersection/README.md +++ b/solution/1200-1299/1279.Traffic Light Controlled Intersection/README.md @@ -1,4 +1,4 @@ -# [1279. 红绿灯路口](https://leetcode.cn/problems/traffic-light-controlled-intersection) +# [1279. 红绿灯路口 🔒](https://leetcode.cn/problems/traffic-light-controlled-intersection) [English Version](/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README_EN.md) diff --git a/solution/1200-1299/1279.Traffic Light Controlled Intersection/README_EN.md b/solution/1200-1299/1279.Traffic Light Controlled Intersection/README_EN.md index ea6439fbd9ee9..ea15b61f54c64 100644 --- a/solution/1200-1299/1279.Traffic Light Controlled Intersection/README_EN.md +++ b/solution/1200-1299/1279.Traffic Light Controlled Intersection/README_EN.md @@ -1,4 +1,4 @@ -# [1279. Traffic Light Controlled Intersection](https://leetcode.com/problems/traffic-light-controlled-intersection) +# [1279. Traffic Light Controlled Intersection 🔒](https://leetcode.com/problems/traffic-light-controlled-intersection) [中文文档](/solution/1200-1299/1279.Traffic%20Light%20Controlled%20Intersection/README.md) diff --git a/solution/1200-1299/1285.Find the Start and End Number of Continuous Ranges/README.md b/solution/1200-1299/1285.Find the Start and End Number of Continuous Ranges/README.md index 87eddd949698e..1c1803d901b5f 100644 --- a/solution/1200-1299/1285.Find the Start and End Number of Continuous Ranges/README.md +++ b/solution/1200-1299/1285.Find the Start and End Number of Continuous Ranges/README.md @@ -1,4 +1,4 @@ -# [1285. 找到连续区间的开始和结束数字](https://leetcode.cn/problems/find-the-start-and-end-number-of-continuous-ranges) +# [1285. 找到连续区间的开始和结束数字 🔒](https://leetcode.cn/problems/find-the-start-and-end-number-of-continuous-ranges) [English Version](/solution/1200-1299/1285.Find%20the%20Start%20and%20End%20Number%20of%20Continuous%20Ranges/README_EN.md) diff --git a/solution/1200-1299/1285.Find the Start and End Number of Continuous Ranges/README_EN.md b/solution/1200-1299/1285.Find the Start and End Number of Continuous Ranges/README_EN.md index efcbfce130b70..e51b64fd5d981 100644 --- a/solution/1200-1299/1285.Find the Start and End Number of Continuous Ranges/README_EN.md +++ b/solution/1200-1299/1285.Find the Start and End Number of Continuous Ranges/README_EN.md @@ -1,4 +1,4 @@ -# [1285. Find the Start and End Number of Continuous Ranges](https://leetcode.com/problems/find-the-start-and-end-number-of-continuous-ranges) +# [1285. Find the Start and End Number of Continuous Ranges 🔒](https://leetcode.com/problems/find-the-start-and-end-number-of-continuous-ranges) [中文文档](/solution/1200-1299/1285.Find%20the%20Start%20and%20End%20Number%20of%20Continuous%20Ranges/README.md) diff --git a/solution/1200-1299/1294.Weather Type in Each Country/README.md b/solution/1200-1299/1294.Weather Type in Each Country/README.md index a31ea96fcc9d8..9287f41ff615a 100644 --- a/solution/1200-1299/1294.Weather Type in Each Country/README.md +++ b/solution/1200-1299/1294.Weather Type in Each Country/README.md @@ -1,4 +1,4 @@ -# [1294. 不同国家的天气类型](https://leetcode.cn/problems/weather-type-in-each-country) +# [1294. 不同国家的天气类型 🔒](https://leetcode.cn/problems/weather-type-in-each-country) [English Version](/solution/1200-1299/1294.Weather%20Type%20in%20Each%20Country/README_EN.md) diff --git a/solution/1200-1299/1294.Weather Type in Each Country/README_EN.md b/solution/1200-1299/1294.Weather Type in Each Country/README_EN.md index d33c43c2533a7..e720fd43c86d4 100644 --- a/solution/1200-1299/1294.Weather Type in Each Country/README_EN.md +++ b/solution/1200-1299/1294.Weather Type in Each Country/README_EN.md @@ -1,4 +1,4 @@ -# [1294. Weather Type in Each Country](https://leetcode.com/problems/weather-type-in-each-country) +# [1294. Weather Type in Each Country 🔒](https://leetcode.com/problems/weather-type-in-each-country) [中文文档](/solution/1200-1299/1294.Weather%20Type%20in%20Each%20Country/README.md) diff --git a/solution/1300-1399/1303.Find the Team Size/README.md b/solution/1300-1399/1303.Find the Team Size/README.md index 0e2291095984b..0630d6d2c08c2 100644 --- a/solution/1300-1399/1303.Find the Team Size/README.md +++ b/solution/1300-1399/1303.Find the Team Size/README.md @@ -1,4 +1,4 @@ -# [1303. 求团队人数](https://leetcode.cn/problems/find-the-team-size) +# [1303. 求团队人数 🔒](https://leetcode.cn/problems/find-the-team-size) [English Version](/solution/1300-1399/1303.Find%20the%20Team%20Size/README_EN.md) diff --git a/solution/1300-1399/1303.Find the Team Size/README_EN.md b/solution/1300-1399/1303.Find the Team Size/README_EN.md index 14fd3a0da8df2..223f8fc31a04b 100644 --- a/solution/1300-1399/1303.Find the Team Size/README_EN.md +++ b/solution/1300-1399/1303.Find the Team Size/README_EN.md @@ -1,4 +1,4 @@ -# [1303. Find the Team Size](https://leetcode.com/problems/find-the-team-size) +# [1303. Find the Team Size 🔒](https://leetcode.com/problems/find-the-team-size) [中文文档](/solution/1300-1399/1303.Find%20the%20Team%20Size/README.md) diff --git a/solution/1300-1399/1308.Running Total for Different Genders/README.md b/solution/1300-1399/1308.Running Total for Different Genders/README.md index 7f8ea54ccdbd9..d5a6a20b1a100 100644 --- a/solution/1300-1399/1308.Running Total for Different Genders/README.md +++ b/solution/1300-1399/1308.Running Total for Different Genders/README.md @@ -1,4 +1,4 @@ -# [1308. 不同性别每日分数总计](https://leetcode.cn/problems/running-total-for-different-genders) +# [1308. 不同性别每日分数总计 🔒](https://leetcode.cn/problems/running-total-for-different-genders) [English Version](/solution/1300-1399/1308.Running%20Total%20for%20Different%20Genders/README_EN.md) diff --git a/solution/1300-1399/1308.Running Total for Different Genders/README_EN.md b/solution/1300-1399/1308.Running Total for Different Genders/README_EN.md index 817d8f549469e..6e85910e4784c 100644 --- a/solution/1300-1399/1308.Running Total for Different Genders/README_EN.md +++ b/solution/1300-1399/1308.Running Total for Different Genders/README_EN.md @@ -1,4 +1,4 @@ -# [1308. Running Total for Different Genders](https://leetcode.com/problems/running-total-for-different-genders) +# [1308. Running Total for Different Genders 🔒](https://leetcode.com/problems/running-total-for-different-genders) [中文文档](/solution/1300-1399/1308.Running%20Total%20for%20Different%20Genders/README.md) diff --git a/solution/1300-1399/1322.Ads Performance/README.md b/solution/1300-1399/1322.Ads Performance/README.md index 2609a3eacc727..06773948f39ba 100644 --- a/solution/1300-1399/1322.Ads Performance/README.md +++ b/solution/1300-1399/1322.Ads Performance/README.md @@ -1,4 +1,4 @@ -# [1322. 广告效果](https://leetcode.cn/problems/ads-performance) +# [1322. 广告效果 🔒](https://leetcode.cn/problems/ads-performance) [English Version](/solution/1300-1399/1322.Ads%20Performance/README_EN.md) diff --git a/solution/1300-1399/1322.Ads Performance/README_EN.md b/solution/1300-1399/1322.Ads Performance/README_EN.md index ba77cbbe527da..a96500740e43e 100644 --- a/solution/1300-1399/1322.Ads Performance/README_EN.md +++ b/solution/1300-1399/1322.Ads Performance/README_EN.md @@ -1,4 +1,4 @@ -# [1322. Ads Performance](https://leetcode.com/problems/ads-performance) +# [1322. Ads Performance 🔒](https://leetcode.com/problems/ads-performance) [中文文档](/solution/1300-1399/1322.Ads%20Performance/README.md) diff --git a/solution/1300-1399/1336.Number of Transactions per Visit/README.md b/solution/1300-1399/1336.Number of Transactions per Visit/README.md index 5aa8f74696b20..30eba23a1408f 100644 --- a/solution/1300-1399/1336.Number of Transactions per Visit/README.md +++ b/solution/1300-1399/1336.Number of Transactions per Visit/README.md @@ -1,4 +1,4 @@ -# [1336. 每次访问的交易次数](https://leetcode.cn/problems/number-of-transactions-per-visit) +# [1336. 每次访问的交易次数 🔒](https://leetcode.cn/problems/number-of-transactions-per-visit) [English Version](/solution/1300-1399/1336.Number%20of%20Transactions%20per%20Visit/README_EN.md) diff --git a/solution/1300-1399/1336.Number of Transactions per Visit/README_EN.md b/solution/1300-1399/1336.Number of Transactions per Visit/README_EN.md index 1062891ce383f..83ee72b3f3cbb 100644 --- a/solution/1300-1399/1336.Number of Transactions per Visit/README_EN.md +++ b/solution/1300-1399/1336.Number of Transactions per Visit/README_EN.md @@ -1,4 +1,4 @@ -# [1336. Number of Transactions per Visit](https://leetcode.com/problems/number-of-transactions-per-visit) +# [1336. Number of Transactions per Visit 🔒](https://leetcode.com/problems/number-of-transactions-per-visit) [中文文档](/solution/1300-1399/1336.Number%20of%20Transactions%20per%20Visit/README.md) diff --git a/solution/1300-1399/1350.Students With Invalid Departments/README.md b/solution/1300-1399/1350.Students With Invalid Departments/README.md index 77b4a7da402f7..369d267c5925f 100644 --- a/solution/1300-1399/1350.Students With Invalid Departments/README.md +++ b/solution/1300-1399/1350.Students With Invalid Departments/README.md @@ -1,4 +1,4 @@ -# [1350. 院系无效的学生](https://leetcode.cn/problems/students-with-invalid-departments) +# [1350. 院系无效的学生 🔒](https://leetcode.cn/problems/students-with-invalid-departments) [English Version](/solution/1300-1399/1350.Students%20With%20Invalid%20Departments/README_EN.md) diff --git a/solution/1300-1399/1350.Students With Invalid Departments/README_EN.md b/solution/1300-1399/1350.Students With Invalid Departments/README_EN.md index 441d1e0fb1f9d..9a29673659b0b 100644 --- a/solution/1300-1399/1350.Students With Invalid Departments/README_EN.md +++ b/solution/1300-1399/1350.Students With Invalid Departments/README_EN.md @@ -1,4 +1,4 @@ -# [1350. Students With Invalid Departments](https://leetcode.com/problems/students-with-invalid-departments) +# [1350. Students With Invalid Departments 🔒](https://leetcode.com/problems/students-with-invalid-departments) [中文文档](/solution/1300-1399/1350.Students%20With%20Invalid%20Departments/README.md) diff --git a/solution/1300-1399/1355.Activity Participants/README.md b/solution/1300-1399/1355.Activity Participants/README.md index cf92a9acabe63..bb5827efaaa81 100644 --- a/solution/1300-1399/1355.Activity Participants/README.md +++ b/solution/1300-1399/1355.Activity Participants/README.md @@ -1,4 +1,4 @@ -# [1355. 活动参与者](https://leetcode.cn/problems/activity-participants) +# [1355. 活动参与者 🔒](https://leetcode.cn/problems/activity-participants) [English Version](/solution/1300-1399/1355.Activity%20Participants/README_EN.md) diff --git a/solution/1300-1399/1355.Activity Participants/README_EN.md b/solution/1300-1399/1355.Activity Participants/README_EN.md index 15829c62f4260..9513717b16171 100644 --- a/solution/1300-1399/1355.Activity Participants/README_EN.md +++ b/solution/1300-1399/1355.Activity Participants/README_EN.md @@ -1,4 +1,4 @@ -# [1355. Activity Participants](https://leetcode.com/problems/activity-participants) +# [1355. Activity Participants 🔒](https://leetcode.com/problems/activity-participants) [中文文档](/solution/1300-1399/1355.Activity%20Participants/README.md) diff --git a/solution/1300-1399/1364.Number of Trusted Contacts of a Customer/README.md b/solution/1300-1399/1364.Number of Trusted Contacts of a Customer/README.md index 7894b8eacae47..b2c50b10a39a1 100644 --- a/solution/1300-1399/1364.Number of Trusted Contacts of a Customer/README.md +++ b/solution/1300-1399/1364.Number of Trusted Contacts of a Customer/README.md @@ -1,4 +1,4 @@ -# [1364. 顾客的可信联系人数量](https://leetcode.cn/problems/number-of-trusted-contacts-of-a-customer) +# [1364. 顾客的可信联系人数量 🔒](https://leetcode.cn/problems/number-of-trusted-contacts-of-a-customer) [English Version](/solution/1300-1399/1364.Number%20of%20Trusted%20Contacts%20of%20a%20Customer/README_EN.md) diff --git a/solution/1300-1399/1364.Number of Trusted Contacts of a Customer/README_EN.md b/solution/1300-1399/1364.Number of Trusted Contacts of a Customer/README_EN.md index 0d1b06193219c..182208ce7dfee 100644 --- a/solution/1300-1399/1364.Number of Trusted Contacts of a Customer/README_EN.md +++ b/solution/1300-1399/1364.Number of Trusted Contacts of a Customer/README_EN.md @@ -1,4 +1,4 @@ -# [1364. Number of Trusted Contacts of a Customer](https://leetcode.com/problems/number-of-trusted-contacts-of-a-customer) +# [1364. Number of Trusted Contacts of a Customer 🔒](https://leetcode.com/problems/number-of-trusted-contacts-of-a-customer) [中文文档](/solution/1300-1399/1364.Number%20of%20Trusted%20Contacts%20of%20a%20Customer/README.md) diff --git a/solution/1300-1399/1369.Get the Second Most Recent Activity/README.md b/solution/1300-1399/1369.Get the Second Most Recent Activity/README.md index f6332a387f5cb..a329e26259766 100644 --- a/solution/1300-1399/1369.Get the Second Most Recent Activity/README.md +++ b/solution/1300-1399/1369.Get the Second Most Recent Activity/README.md @@ -1,4 +1,4 @@ -# [1369. 获取最近第二次的活动](https://leetcode.cn/problems/get-the-second-most-recent-activity) +# [1369. 获取最近第二次的活动 🔒](https://leetcode.cn/problems/get-the-second-most-recent-activity) [English Version](/solution/1300-1399/1369.Get%20the%20Second%20Most%20Recent%20Activity/README_EN.md) diff --git a/solution/1300-1399/1369.Get the Second Most Recent Activity/README_EN.md b/solution/1300-1399/1369.Get the Second Most Recent Activity/README_EN.md index 49b1024ef2c42..ab38e415938ed 100644 --- a/solution/1300-1399/1369.Get the Second Most Recent Activity/README_EN.md +++ b/solution/1300-1399/1369.Get the Second Most Recent Activity/README_EN.md @@ -1,4 +1,4 @@ -# [1369. Get the Second Most Recent Activity](https://leetcode.com/problems/get-the-second-most-recent-activity) +# [1369. Get the Second Most Recent Activity 🔒](https://leetcode.com/problems/get-the-second-most-recent-activity) [中文文档](/solution/1300-1399/1369.Get%20the%20Second%20Most%20Recent%20Activity/README.md) diff --git a/solution/1300-1399/1384.Total Sales Amount by Year/README.md b/solution/1300-1399/1384.Total Sales Amount by Year/README.md index 7bc5c986704ae..fbb3eab835043 100644 --- a/solution/1300-1399/1384.Total Sales Amount by Year/README.md +++ b/solution/1300-1399/1384.Total Sales Amount by Year/README.md @@ -1,4 +1,4 @@ -# [1384. 按年度列出销售总额](https://leetcode.cn/problems/total-sales-amount-by-year) +# [1384. 按年度列出销售总额 🔒](https://leetcode.cn/problems/total-sales-amount-by-year) [English Version](/solution/1300-1399/1384.Total%20Sales%20Amount%20by%20Year/README_EN.md) diff --git a/solution/1300-1399/1384.Total Sales Amount by Year/README_EN.md b/solution/1300-1399/1384.Total Sales Amount by Year/README_EN.md index dbc3917a1e4bb..ee6fad7996062 100644 --- a/solution/1300-1399/1384.Total Sales Amount by Year/README_EN.md +++ b/solution/1300-1399/1384.Total Sales Amount by Year/README_EN.md @@ -1,4 +1,4 @@ -# [1384. Total Sales Amount by Year](https://leetcode.com/problems/total-sales-amount-by-year) +# [1384. Total Sales Amount by Year 🔒](https://leetcode.com/problems/total-sales-amount-by-year) [中文文档](/solution/1300-1399/1384.Total%20Sales%20Amount%20by%20Year/README.md) diff --git a/solution/1300-1399/1398.Customers Who Bought Products A and B but Not C/README.md b/solution/1300-1399/1398.Customers Who Bought Products A and B but Not C/README.md index 986b622d226f9..8e1e22bd9f45d 100644 --- a/solution/1300-1399/1398.Customers Who Bought Products A and B but Not C/README.md +++ b/solution/1300-1399/1398.Customers Who Bought Products A and B but Not C/README.md @@ -1,4 +1,4 @@ -# [1398. 购买了产品 A 和产品 B 却没有购买产品 C 的顾客](https://leetcode.cn/problems/customers-who-bought-products-a-and-b-but-not-c) +# [1398. 购买了产品 A 和产品 B 却没有购买产品 C 的顾客 🔒](https://leetcode.cn/problems/customers-who-bought-products-a-and-b-but-not-c) [English Version](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README_EN.md) @@ -87,7 +87,7 @@ Orders table: ### 方法一：LEFT JOIN + GROUP BY + HAVING -我们可以用 `LEFT JOIN` 将 `Customers` 表和 `Orders` 表连接起来，然后按照 `customer_id` 进行分组，最后筛选出购买了产品 A 和产品 B 却没有购买产品 C 的顾客。 +我们可以用 `LEFT JOIN` 将 `Customers` 表和 `Orders` 表连接起来，然后按照 `customer_id` 进行分组，最后筛选出购买了产品 A 和产品 B 却没有购买产品 C 的顾客 🔒。 diff --git a/solution/1300-1399/1398.Customers Who Bought Products A and B but Not C/README_EN.md b/solution/1300-1399/1398.Customers Who Bought Products A and B but Not C/README_EN.md index 51979fab68340..de320e3d20200 100644 --- a/solution/1300-1399/1398.Customers Who Bought Products A and B but Not C/README_EN.md +++ b/solution/1300-1399/1398.Customers Who Bought Products A and B but Not C/README_EN.md @@ -1,4 +1,4 @@ -# [1398. Customers Who Bought Products A and B but Not C](https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c) +# [1398. Customers Who Bought Products A and B but Not C 🔒](https://leetcode.com/problems/customers-who-bought-products-a-and-b-but-not-c) [中文文档](/solution/1300-1399/1398.Customers%20Who%20Bought%20Products%20A%20and%20B%20but%20Not%20C/README.md) diff --git a/solution/1400-1499/1412.Find the Quiet Students in All Exams/README.md b/solution/1400-1499/1412.Find the Quiet Students in All Exams/README.md index 3307edf57cb69..f0252923354ef 100644 --- a/solution/1400-1499/1412.Find the Quiet Students in All Exams/README.md +++ b/solution/1400-1499/1412.Find the Quiet Students in All Exams/README.md @@ -1,4 +1,4 @@ -# [1412. 查找成绩处于中游的学生](https://leetcode.cn/problems/find-the-quiet-students-in-all-exams) +# [1412. 查找成绩处于中游的学生 🔒](https://leetcode.cn/problems/find-the-quiet-students-in-all-exams) [English Version](/solution/1400-1499/1412.Find%20the%20Quiet%20Students%20in%20All%20Exams/README_EN.md) diff --git a/solution/1400-1499/1412.Find the Quiet Students in All Exams/README_EN.md b/solution/1400-1499/1412.Find the Quiet Students in All Exams/README_EN.md index 5fc6262bfaf42..6cd7e04e6e9ca 100644 --- a/solution/1400-1499/1412.Find the Quiet Students in All Exams/README_EN.md +++ b/solution/1400-1499/1412.Find the Quiet Students in All Exams/README_EN.md @@ -1,4 +1,4 @@ -# [1412. Find the Quiet Students in All Exams](https://leetcode.com/problems/find-the-quiet-students-in-all-exams) +# [1412. Find the Quiet Students in All Exams 🔒](https://leetcode.com/problems/find-the-quiet-students-in-all-exams) [中文文档](/solution/1400-1499/1412.Find%20the%20Quiet%20Students%20in%20All%20Exams/README.md) diff --git a/solution/1400-1499/1421.NPV Queries/README.md b/solution/1400-1499/1421.NPV Queries/README.md index 7f427a7f22f46..7c09bd62fc46d 100644 --- a/solution/1400-1499/1421.NPV Queries/README.md +++ b/solution/1400-1499/1421.NPV Queries/README.md @@ -1,4 +1,4 @@ -# [1421. 净现值查询](https://leetcode.cn/problems/npv-queries) +# [1421. 净现值查询 🔒](https://leetcode.cn/problems/npv-queries) [English Version](/solution/1400-1499/1421.NPV%20Queries/README_EN.md) diff --git a/solution/1400-1499/1421.NPV Queries/README_EN.md b/solution/1400-1499/1421.NPV Queries/README_EN.md index c4d325be80f45..a084257a769cd 100644 --- a/solution/1400-1499/1421.NPV Queries/README_EN.md +++ b/solution/1400-1499/1421.NPV Queries/README_EN.md @@ -1,4 +1,4 @@ -# [1421. NPV Queries](https://leetcode.com/problems/npv-queries) +# [1421. NPV Queries 🔒](https://leetcode.com/problems/npv-queries) [中文文档](/solution/1400-1499/1421.NPV%20Queries/README.md) diff --git a/solution/1400-1499/1426.Counting Elements/README.md b/solution/1400-1499/1426.Counting Elements/README.md index e740e7bcc739f..0fd22b1b8baf6 100644 --- a/solution/1400-1499/1426.Counting Elements/README.md +++ b/solution/1400-1499/1426.Counting Elements/README.md @@ -1,4 +1,4 @@ -# [1426. 数元素](https://leetcode.cn/problems/counting-elements) +# [1426. 数元素 🔒](https://leetcode.cn/problems/counting-elements) [English Version](/solution/1400-1499/1426.Counting%20Elements/README_EN.md) diff --git a/solution/1400-1499/1426.Counting Elements/README_EN.md b/solution/1400-1499/1426.Counting Elements/README_EN.md index 393ef25291f53..50f7354f58036 100644 --- a/solution/1400-1499/1426.Counting Elements/README_EN.md +++ b/solution/1400-1499/1426.Counting Elements/README_EN.md @@ -1,4 +1,4 @@ -# [1426. Counting Elements](https://leetcode.com/problems/counting-elements) +# [1426. Counting Elements 🔒](https://leetcode.com/problems/counting-elements) [中文文档](/solution/1400-1499/1426.Counting%20Elements/README.md) diff --git a/solution/1400-1499/1427.Perform String Shifts/README.md b/solution/1400-1499/1427.Perform String Shifts/README.md index 18ef10badaa94..060e6ef6464a0 100644 --- a/solution/1400-1499/1427.Perform String Shifts/README.md +++ b/solution/1400-1499/1427.Perform String Shifts/README.md @@ -1,4 +1,4 @@ -# [1427. 字符串的左右移](https://leetcode.cn/problems/perform-string-shifts) +# [1427. 字符串的左右移 🔒](https://leetcode.cn/problems/perform-string-shifts) [English Version](/solution/1400-1499/1427.Perform%20String%20Shifts/README_EN.md) diff --git a/solution/1400-1499/1427.Perform String Shifts/README_EN.md b/solution/1400-1499/1427.Perform String Shifts/README_EN.md index 917050da12ca0..67aa4ed0e1c52 100644 --- a/solution/1400-1499/1427.Perform String Shifts/README_EN.md +++ b/solution/1400-1499/1427.Perform String Shifts/README_EN.md @@ -1,4 +1,4 @@ -# [1427. Perform String Shifts](https://leetcode.com/problems/perform-string-shifts) +# [1427. Perform String Shifts 🔒](https://leetcode.com/problems/perform-string-shifts) [中文文档](/solution/1400-1499/1427.Perform%20String%20Shifts/README.md) diff --git a/solution/1400-1499/1428.Leftmost Column with at Least a One/README.md b/solution/1400-1499/1428.Leftmost Column with at Least a One/README.md index 685c1d317d0da..ee939b7d1717f 100644 --- a/solution/1400-1499/1428.Leftmost Column with at Least a One/README.md +++ b/solution/1400-1499/1428.Leftmost Column with at Least a One/README.md @@ -1,4 +1,4 @@ -# [1428. 至少有一个 1 的最左端列](https://leetcode.cn/problems/leftmost-column-with-at-least-a-one) +# [1428. 至少有一个 1 的最左端列 🔒](https://leetcode.cn/problems/leftmost-column-with-at-least-a-one) [English Version](/solution/1400-1499/1428.Leftmost%20Column%20with%20at%20Least%20a%20One/README_EN.md) diff --git a/solution/1400-1499/1428.Leftmost Column with at Least a One/README_EN.md b/solution/1400-1499/1428.Leftmost Column with at Least a One/README_EN.md index 23abe9cacbfdf..58ca8f5f9ba1e 100644 --- a/solution/1400-1499/1428.Leftmost Column with at Least a One/README_EN.md +++ b/solution/1400-1499/1428.Leftmost Column with at Least a One/README_EN.md @@ -1,4 +1,4 @@ -# [1428. Leftmost Column with at Least a One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one) +# [1428. Leftmost Column with at Least a One 🔒](https://leetcode.com/problems/leftmost-column-with-at-least-a-one) [中文文档](/solution/1400-1499/1428.Leftmost%20Column%20with%20at%20Least%20a%20One/README.md) diff --git a/solution/1400-1499/1429.First Unique Number/README.md b/solution/1400-1499/1429.First Unique Number/README.md index 453bab182face..0dd6e9838aa84 100644 --- a/solution/1400-1499/1429.First Unique Number/README.md +++ b/solution/1400-1499/1429.First Unique Number/README.md @@ -1,4 +1,4 @@ -# [1429. 第一个唯一数字](https://leetcode.cn/problems/first-unique-number) +# [1429. 第一个唯一数字 🔒](https://leetcode.cn/problems/first-unique-number) [English Version](/solution/1400-1499/1429.First%20Unique%20Number/README_EN.md) diff --git a/solution/1400-1499/1429.First Unique Number/README_EN.md b/solution/1400-1499/1429.First Unique Number/README_EN.md index 07e515d16740e..664ba377a9b47 100644 --- a/solution/1400-1499/1429.First Unique Number/README_EN.md +++ b/solution/1400-1499/1429.First Unique Number/README_EN.md @@ -1,4 +1,4 @@ -# [1429. First Unique Number](https://leetcode.com/problems/first-unique-number) +# [1429. First Unique Number 🔒](https://leetcode.com/problems/first-unique-number) [中文文档](/solution/1400-1499/1429.First%20Unique%20Number/README.md) diff --git a/solution/1400-1499/1430.Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree/README.md b/solution/1400-1499/1430.Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree/README.md index ed5e7332ca1a8..7dd4a776d7528 100644 --- a/solution/1400-1499/1430.Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree/README.md +++ b/solution/1400-1499/1430.Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree/README.md @@ -1,4 +1,4 @@ -# [1430. 判断给定的序列是否是二叉树从根到叶的路径](https://leetcode.cn/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree) +# [1430. 判断给定的序列是否是二叉树从根到叶的路径 🔒](https://leetcode.cn/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree) [English Version](/solution/1400-1499/1430.Check%20If%20a%20String%20Is%20a%20Valid%20Sequence%20from%20Root%20to%20Leaves%20Path%20in%20a%20Binary%20Tree/README_EN.md) diff --git a/solution/1400-1499/1430.Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree/README_EN.md b/solution/1400-1499/1430.Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree/README_EN.md index fde282798ed78..3f099cf8c4194 100644 --- a/solution/1400-1499/1430.Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree/README_EN.md +++ b/solution/1400-1499/1430.Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [1430. 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) +# [1430. 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) [中文文档](/solution/1400-1499/1430.Check%20If%20a%20String%20Is%20a%20Valid%20Sequence%20from%20Root%20to%20Leaves%20Path%20in%20a%20Binary%20Tree/README.md) diff --git a/solution/1400-1499/1435.Create a Session Bar Chart/README.md b/solution/1400-1499/1435.Create a Session Bar Chart/README.md index d2b58b8ce98f0..7c3e768ef85b1 100644 --- a/solution/1400-1499/1435.Create a Session Bar Chart/README.md +++ b/solution/1400-1499/1435.Create a Session Bar Chart/README.md @@ -1,4 +1,4 @@ -# [1435. 制作会话柱状图](https://leetcode.cn/problems/create-a-session-bar-chart) +# [1435. 制作会话柱状图 🔒](https://leetcode.cn/problems/create-a-session-bar-chart) [English Version](/solution/1400-1499/1435.Create%20a%20Session%20Bar%20Chart/README_EN.md) diff --git a/solution/1400-1499/1435.Create a Session Bar Chart/README_EN.md b/solution/1400-1499/1435.Create a Session Bar Chart/README_EN.md index 6cb479f935d3e..321afa6ccb624 100644 --- a/solution/1400-1499/1435.Create a Session Bar Chart/README_EN.md +++ b/solution/1400-1499/1435.Create a Session Bar Chart/README_EN.md @@ -1,4 +1,4 @@ -# [1435. Create a Session Bar Chart](https://leetcode.com/problems/create-a-session-bar-chart) +# [1435. Create a Session Bar Chart 🔒](https://leetcode.com/problems/create-a-session-bar-chart) [中文文档](/solution/1400-1499/1435.Create%20a%20Session%20Bar%20Chart/README.md) diff --git a/solution/1400-1499/1440.Evaluate Boolean Expression/README.md b/solution/1400-1499/1440.Evaluate Boolean Expression/README.md index 9f656a8480c0b..8f942e14f51f0 100644 --- a/solution/1400-1499/1440.Evaluate Boolean Expression/README.md +++ b/solution/1400-1499/1440.Evaluate Boolean Expression/README.md @@ -1,4 +1,4 @@ -# [1440. 计算布尔表达式的值](https://leetcode.cn/problems/evaluate-boolean-expression) +# [1440. 计算布尔表达式的值 🔒](https://leetcode.cn/problems/evaluate-boolean-expression) [English Version](/solution/1400-1499/1440.Evaluate%20Boolean%20Expression/README_EN.md) diff --git a/solution/1400-1499/1440.Evaluate Boolean Expression/README_EN.md b/solution/1400-1499/1440.Evaluate Boolean Expression/README_EN.md index 28472534ae337..e6b6cee246d99 100644 --- a/solution/1400-1499/1440.Evaluate Boolean Expression/README_EN.md +++ b/solution/1400-1499/1440.Evaluate Boolean Expression/README_EN.md @@ -1,4 +1,4 @@ -# [1440. Evaluate Boolean Expression](https://leetcode.com/problems/evaluate-boolean-expression) +# [1440. Evaluate Boolean Expression 🔒](https://leetcode.com/problems/evaluate-boolean-expression) [中文文档](/solution/1400-1499/1440.Evaluate%20Boolean%20Expression/README.md) diff --git a/solution/1400-1499/1445.Apples & Oranges/README.md b/solution/1400-1499/1445.Apples & Oranges/README.md index 546fe07c4bf52..7d0da7a49882a 100644 --- a/solution/1400-1499/1445.Apples & Oranges/README.md +++ b/solution/1400-1499/1445.Apples & Oranges/README.md @@ -1,4 +1,4 @@ -# [1445. 苹果和桔子](https://leetcode.cn/problems/apples-oranges) +# [1445. 苹果和桔子 🔒](https://leetcode.cn/problems/apples-oranges) [English Version](/solution/1400-1499/1445.Apples%20%26%20Oranges/README_EN.md) @@ -69,7 +69,7 @@ Sales 表: ### 方法一：分组求和 -我们可以将数据按照日期分组，然后用 `sum` 函数求出每天苹果和桔子的销售差异。如果是苹果，我们就用正数表示，如果是桔子，我们就用负数表示。最后我们按照日期排序即可。 +我们可以将数据按照日期分组，然后用 `sum` 函数求出每天苹果和桔子 🔒 的销售差异。如果是苹果，我们就用正数表示，如果是桔子，我们就用负数表示。最后我们按照日期排序即可。 diff --git a/solution/1400-1499/1445.Apples & Oranges/README_EN.md b/solution/1400-1499/1445.Apples & Oranges/README_EN.md index 4d6f444ac5de7..7a817162a573e 100644 --- a/solution/1400-1499/1445.Apples & Oranges/README_EN.md +++ b/solution/1400-1499/1445.Apples & Oranges/README_EN.md @@ -1,4 +1,4 @@ -# [1445. Apples & Oranges](https://leetcode.com/problems/apples-oranges) +# [1445. Apples & Oranges 🔒](https://leetcode.com/problems/apples-oranges) [中文文档](/solution/1400-1499/1445.Apples%20%26%20Oranges/README.md) diff --git a/solution/1400-1499/1454.Active Users/README.md b/solution/1400-1499/1454.Active Users/README.md index 60418b5dd50b4..eadf4c88f6f0c 100644 --- a/solution/1400-1499/1454.Active Users/README.md +++ b/solution/1400-1499/1454.Active Users/README.md @@ -1,4 +1,4 @@ -# [1454. 活跃用户](https://leetcode.cn/problems/active-users) +# [1454. 活跃用户 🔒](https://leetcode.cn/problems/active-users) [English Version](/solution/1400-1499/1454.Active%20Users/README_EN.md) diff --git a/solution/1400-1499/1454.Active Users/README_EN.md b/solution/1400-1499/1454.Active Users/README_EN.md index fb6ad8271eb66..4c171989826b4 100644 --- a/solution/1400-1499/1454.Active Users/README_EN.md +++ b/solution/1400-1499/1454.Active Users/README_EN.md @@ -1,4 +1,4 @@ -# [1454. Active Users](https://leetcode.com/problems/active-users) +# [1454. Active Users 🔒](https://leetcode.com/problems/active-users) [中文文档](/solution/1400-1499/1454.Active%20Users/README.md) diff --git a/solution/1400-1499/1459.Rectangles Area/README.md b/solution/1400-1499/1459.Rectangles Area/README.md index 09f8bcbeebb75..285327c36c65b 100644 --- a/solution/1400-1499/1459.Rectangles Area/README.md +++ b/solution/1400-1499/1459.Rectangles Area/README.md @@ -1,4 +1,4 @@ -# [1459. 矩形面积](https://leetcode.cn/problems/rectangles-area) +# [1459. 矩形面积 🔒](https://leetcode.cn/problems/rectangles-area) [English Version](/solution/1400-1499/1459.Rectangles%20Area/README_EN.md) diff --git a/solution/1400-1499/1459.Rectangles Area/README_EN.md b/solution/1400-1499/1459.Rectangles Area/README_EN.md index 9293e2c4b5fc1..666241b794ed3 100644 --- a/solution/1400-1499/1459.Rectangles Area/README_EN.md +++ b/solution/1400-1499/1459.Rectangles Area/README_EN.md @@ -1,4 +1,4 @@ -# [1459. Rectangles Area](https://leetcode.com/problems/rectangles-area) +# [1459. Rectangles Area 🔒](https://leetcode.com/problems/rectangles-area) [中文文档](/solution/1400-1499/1459.Rectangles%20Area/README.md) diff --git a/solution/1400-1499/1468.Calculate Salaries/README.md b/solution/1400-1499/1468.Calculate Salaries/README.md index 60402603cc6bc..0c925148893d4 100644 --- a/solution/1400-1499/1468.Calculate Salaries/README.md +++ b/solution/1400-1499/1468.Calculate Salaries/README.md @@ -1,4 +1,4 @@ -# [1468. 计算税后工资](https://leetcode.cn/problems/calculate-salaries) +# [1468. 计算税后工资 🔒](https://leetcode.cn/problems/calculate-salaries) [English Version](/solution/1400-1499/1468.Calculate%20Salaries/README_EN.md) diff --git a/solution/1400-1499/1468.Calculate Salaries/README_EN.md b/solution/1400-1499/1468.Calculate Salaries/README_EN.md index efa5ce9ccd301..e22093fc0471b 100644 --- a/solution/1400-1499/1468.Calculate Salaries/README_EN.md +++ b/solution/1400-1499/1468.Calculate Salaries/README_EN.md @@ -1,4 +1,4 @@ -# [1468. Calculate Salaries](https://leetcode.com/problems/calculate-salaries) +# [1468. Calculate Salaries 🔒](https://leetcode.com/problems/calculate-salaries) [中文文档](/solution/1400-1499/1468.Calculate%20Salaries/README.md) diff --git a/solution/1400-1499/1469.Find All The Lonely Nodes/README.md b/solution/1400-1499/1469.Find All The Lonely Nodes/README.md index b32fa8888c620..f611263b05f7c 100644 --- a/solution/1400-1499/1469.Find All The Lonely Nodes/README.md +++ b/solution/1400-1499/1469.Find All The Lonely Nodes/README.md @@ -1,4 +1,4 @@ -# [1469. 寻找所有的独生节点](https://leetcode.cn/problems/find-all-the-lonely-nodes) +# [1469. 寻找所有的独生节点 🔒](https://leetcode.cn/problems/find-all-the-lonely-nodes) [English Version](/solution/1400-1499/1469.Find%20All%20The%20Lonely%20Nodes/README_EN.md) diff --git a/solution/1400-1499/1469.Find All The Lonely Nodes/README_EN.md b/solution/1400-1499/1469.Find All The Lonely Nodes/README_EN.md index bf8c7ebc020f4..3202a5ff74b06 100644 --- a/solution/1400-1499/1469.Find All The Lonely Nodes/README_EN.md +++ b/solution/1400-1499/1469.Find All The Lonely Nodes/README_EN.md @@ -1,4 +1,4 @@ -# [1469. Find All The Lonely Nodes](https://leetcode.com/problems/find-all-the-lonely-nodes) +# [1469. Find All The Lonely Nodes 🔒](https://leetcode.com/problems/find-all-the-lonely-nodes) [中文文档](/solution/1400-1499/1469.Find%20All%20The%20Lonely%20Nodes/README.md) diff --git a/solution/1400-1499/1474.Delete N Nodes After M Nodes of a Linked List/README.md b/solution/1400-1499/1474.Delete N Nodes After M Nodes of a Linked List/README.md index 1712a78f8cc62..cc3b0123bc603 100644 --- a/solution/1400-1499/1474.Delete N Nodes After M Nodes of a Linked List/README.md +++ b/solution/1400-1499/1474.Delete N Nodes After M Nodes of a Linked List/README.md @@ -1,4 +1,4 @@ -# [1474. 删除链表 M 个节点之后的 N 个节点](https://leetcode.cn/problems/delete-n-nodes-after-m-nodes-of-a-linked-list) +# [1474. 删除链表 M 个节点之后的 N 个节点 🔒](https://leetcode.cn/problems/delete-n-nodes-after-m-nodes-of-a-linked-list) [English Version](/solution/1400-1499/1474.Delete%20N%20Nodes%20After%20M%20Nodes%20of%20a%20Linked%20List/README_EN.md) diff --git a/solution/1400-1499/1474.Delete N Nodes After M Nodes of a Linked List/README_EN.md b/solution/1400-1499/1474.Delete N Nodes After M Nodes of a Linked List/README_EN.md index da6847de1db57..33155149d3cd9 100644 --- a/solution/1400-1499/1474.Delete N Nodes After M Nodes of a Linked List/README_EN.md +++ b/solution/1400-1499/1474.Delete N Nodes After M Nodes of a Linked List/README_EN.md @@ -1,4 +1,4 @@ -# [1474. Delete N Nodes After M Nodes of a Linked List](https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list) +# [1474. Delete N Nodes After M Nodes of a Linked List 🔒](https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list) [中文文档](/solution/1400-1499/1474.Delete%20N%20Nodes%20After%20M%20Nodes%20of%20a%20Linked%20List/README.md) diff --git a/solution/1400-1499/1479.Sales by Day of the Week/README.md b/solution/1400-1499/1479.Sales by Day of the Week/README.md index cc4dfc63ae095..956eea5e61050 100644 --- a/solution/1400-1499/1479.Sales by Day of the Week/README.md +++ b/solution/1400-1499/1479.Sales by Day of the Week/README.md @@ -1,4 +1,4 @@ -# [1479. 周内每天的销售情况](https://leetcode.cn/problems/sales-by-day-of-the-week) +# [1479. 周内每天的销售情况 🔒](https://leetcode.cn/problems/sales-by-day-of-the-week) [English Version](/solution/1400-1499/1479.Sales%20by%20Day%20of%20the%20Week/README_EN.md) diff --git a/solution/1400-1499/1479.Sales by Day of the Week/README_EN.md b/solution/1400-1499/1479.Sales by Day of the Week/README_EN.md index 9d124e2a19fd9..fbc03e205a86d 100644 --- a/solution/1400-1499/1479.Sales by Day of the Week/README_EN.md +++ b/solution/1400-1499/1479.Sales by Day of the Week/README_EN.md @@ -1,4 +1,4 @@ -# [1479. Sales by Day of the Week](https://leetcode.com/problems/sales-by-day-of-the-week) +# [1479. Sales by Day of the Week 🔒](https://leetcode.com/problems/sales-by-day-of-the-week) [中文文档](/solution/1400-1499/1479.Sales%20by%20Day%20of%20the%20Week/README.md) diff --git a/solution/1400-1499/1485.Clone Binary Tree With Random Pointer/README.md b/solution/1400-1499/1485.Clone Binary Tree With Random Pointer/README.md index 4bd7470bac2d8..9304e9c4e7795 100644 --- a/solution/1400-1499/1485.Clone Binary Tree With Random Pointer/README.md +++ b/solution/1400-1499/1485.Clone Binary Tree With Random Pointer/README.md @@ -1,4 +1,4 @@ -# [1485. 克隆含随机指针的二叉树](https://leetcode.cn/problems/clone-binary-tree-with-random-pointer) +# [1485. 克隆含随机指针的二叉树 🔒](https://leetcode.cn/problems/clone-binary-tree-with-random-pointer) [English Version](/solution/1400-1499/1485.Clone%20Binary%20Tree%20With%20Random%20Pointer/README_EN.md) diff --git a/solution/1400-1499/1485.Clone Binary Tree With Random Pointer/README_EN.md b/solution/1400-1499/1485.Clone Binary Tree With Random Pointer/README_EN.md index 2300ac2a29187..749b3ac3d1bb8 100644 --- a/solution/1400-1499/1485.Clone Binary Tree With Random Pointer/README_EN.md +++ b/solution/1400-1499/1485.Clone Binary Tree With Random Pointer/README_EN.md @@ -1,4 +1,4 @@ -# [1485. Clone Binary Tree With Random Pointer](https://leetcode.com/problems/clone-binary-tree-with-random-pointer) +# [1485. Clone Binary Tree With Random Pointer 🔒](https://leetcode.com/problems/clone-binary-tree-with-random-pointer) [中文文档](/solution/1400-1499/1485.Clone%20Binary%20Tree%20With%20Random%20Pointer/README.md) diff --git a/solution/1400-1499/1490.Clone N-ary Tree/README.md b/solution/1400-1499/1490.Clone N-ary Tree/README.md index ec9612e8e93f5..623fab3617407 100644 --- a/solution/1400-1499/1490.Clone N-ary Tree/README.md +++ b/solution/1400-1499/1490.Clone N-ary Tree/README.md @@ -1,4 +1,4 @@ -# [1490. 克隆 N 叉树](https://leetcode.cn/problems/clone-n-ary-tree) +# [1490. 克隆 N 叉树 🔒](https://leetcode.cn/problems/clone-n-ary-tree) [English Version](/solution/1400-1499/1490.Clone%20N-ary%20Tree/README_EN.md) diff --git a/solution/1400-1499/1490.Clone N-ary Tree/README_EN.md b/solution/1400-1499/1490.Clone N-ary Tree/README_EN.md index 53c80c459ff2a..17be3ccd25730 100644 --- a/solution/1400-1499/1490.Clone N-ary Tree/README_EN.md +++ b/solution/1400-1499/1490.Clone N-ary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [1490. Clone N-ary Tree](https://leetcode.com/problems/clone-n-ary-tree) +# [1490. Clone N-ary Tree 🔒](https://leetcode.com/problems/clone-n-ary-tree) [中文文档](/solution/1400-1499/1490.Clone%20N-ary%20Tree/README.md) diff --git a/solution/1400-1499/1495.Friendly Movies Streamed Last Month/README.md b/solution/1400-1499/1495.Friendly Movies Streamed Last Month/README.md index 7360e578370ab..2f46910428e24 100644 --- a/solution/1400-1499/1495.Friendly Movies Streamed Last Month/README.md +++ b/solution/1400-1499/1495.Friendly Movies Streamed Last Month/README.md @@ -1,4 +1,4 @@ -# [1495. 上月播放的儿童适宜电影](https://leetcode.cn/problems/friendly-movies-streamed-last-month) +# [1495. 上月播放的儿童适宜电影 🔒](https://leetcode.cn/problems/friendly-movies-streamed-last-month) [English Version](/solution/1400-1499/1495.Friendly%20Movies%20Streamed%20Last%20Month/README_EN.md) diff --git a/solution/1400-1499/1495.Friendly Movies Streamed Last Month/README_EN.md b/solution/1400-1499/1495.Friendly Movies Streamed Last Month/README_EN.md index 6bcb6b9158e85..94446beb1a03e 100644 --- a/solution/1400-1499/1495.Friendly Movies Streamed Last Month/README_EN.md +++ b/solution/1400-1499/1495.Friendly Movies Streamed Last Month/README_EN.md @@ -1,4 +1,4 @@ -# [1495. Friendly Movies Streamed Last Month](https://leetcode.com/problems/friendly-movies-streamed-last-month) +# [1495. Friendly Movies Streamed Last Month 🔒](https://leetcode.com/problems/friendly-movies-streamed-last-month) [中文文档](/solution/1400-1499/1495.Friendly%20Movies%20Streamed%20Last%20Month/README.md) diff --git a/solution/1500-1599/1500.Design a File Sharing System/README.md b/solution/1500-1599/1500.Design a File Sharing System/README.md index e7736c4390d6d..f301585fe8c31 100644 --- a/solution/1500-1599/1500.Design a File Sharing System/README.md +++ b/solution/1500-1599/1500.Design a File Sharing System/README.md @@ -1,4 +1,4 @@ -# [1500. 设计文件分享系统](https://leetcode.cn/problems/design-a-file-sharing-system) +# [1500. 设计文件分享系统 🔒](https://leetcode.cn/problems/design-a-file-sharing-system) [English Version](/solution/1500-1599/1500.Design%20a%20File%20Sharing%20System/README_EN.md) diff --git a/solution/1500-1599/1500.Design a File Sharing System/README_EN.md b/solution/1500-1599/1500.Design a File Sharing System/README_EN.md index e5f8f3942b2f7..a9567d34b3845 100644 --- a/solution/1500-1599/1500.Design a File Sharing System/README_EN.md +++ b/solution/1500-1599/1500.Design a File Sharing System/README_EN.md @@ -1,4 +1,4 @@ -# [1500. Design a File Sharing System](https://leetcode.com/problems/design-a-file-sharing-system) +# [1500. Design a File Sharing System 🔒](https://leetcode.com/problems/design-a-file-sharing-system) [中文文档](/solution/1500-1599/1500.Design%20a%20File%20Sharing%20System/README.md) diff --git a/solution/1500-1599/1501.Countries You Can Safely Invest In/README.md b/solution/1500-1599/1501.Countries You Can Safely Invest In/README.md index 7353c6f4f3bab..9cc1a45a6bfdb 100644 --- a/solution/1500-1599/1501.Countries You Can Safely Invest In/README.md +++ b/solution/1500-1599/1501.Countries You Can Safely Invest In/README.md @@ -1,4 +1,4 @@ -# [1501. 可以放心投资的国家](https://leetcode.cn/problems/countries-you-can-safely-invest-in) +# [1501. 可以放心投资的国家 🔒](https://leetcode.cn/problems/countries-you-can-safely-invest-in) [English Version](/solution/1500-1599/1501.Countries%20You%20Can%20Safely%20Invest%20In/README_EN.md) diff --git a/solution/1500-1599/1501.Countries You Can Safely Invest In/README_EN.md b/solution/1500-1599/1501.Countries You Can Safely Invest In/README_EN.md index 79676b31bafbe..c98d734ca672d 100644 --- a/solution/1500-1599/1501.Countries You Can Safely Invest In/README_EN.md +++ b/solution/1500-1599/1501.Countries You Can Safely Invest In/README_EN.md @@ -1,4 +1,4 @@ -# [1501. Countries You Can Safely Invest In](https://leetcode.com/problems/countries-you-can-safely-invest-in) +# [1501. Countries You Can Safely Invest In 🔒](https://leetcode.com/problems/countries-you-can-safely-invest-in) [中文文档](/solution/1500-1599/1501.Countries%20You%20Can%20Safely%20Invest%20In/README.md) diff --git a/solution/1500-1599/1506.Find Root of N-Ary Tree/README.md b/solution/1500-1599/1506.Find Root of N-Ary Tree/README.md index c8117e1deee61..5db5045baced9 100644 --- a/solution/1500-1599/1506.Find Root of N-Ary Tree/README.md +++ b/solution/1500-1599/1506.Find Root of N-Ary Tree/README.md @@ -1,4 +1,4 @@ -# [1506. 找到 N 叉树的根节点](https://leetcode.cn/problems/find-root-of-n-ary-tree) +# [1506. 找到 N 叉树的根节点 🔒](https://leetcode.cn/problems/find-root-of-n-ary-tree) [English Version](/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/README_EN.md) diff --git a/solution/1500-1599/1506.Find Root of N-Ary Tree/README_EN.md b/solution/1500-1599/1506.Find Root of N-Ary Tree/README_EN.md index 7f35ec8b8419d..ee1f193ccdb86 100644 --- a/solution/1500-1599/1506.Find Root of N-Ary Tree/README_EN.md +++ b/solution/1500-1599/1506.Find Root of N-Ary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [1506. Find Root of N-Ary Tree](https://leetcode.com/problems/find-root-of-n-ary-tree) +# [1506. Find Root of N-Ary Tree 🔒](https://leetcode.com/problems/find-root-of-n-ary-tree) [中文文档](/solution/1500-1599/1506.Find%20Root%20of%20N-Ary%20Tree/README.md) diff --git a/solution/1500-1599/1511.Customer Order Frequency/README.md b/solution/1500-1599/1511.Customer Order Frequency/README.md index 8ecbac0605ca6..49dacf1f51210 100644 --- a/solution/1500-1599/1511.Customer Order Frequency/README.md +++ b/solution/1500-1599/1511.Customer Order Frequency/README.md @@ -1,4 +1,4 @@ -# [1511. 消费者下单频率](https://leetcode.cn/problems/customer-order-frequency) +# [1511. 消费者下单频率 🔒](https://leetcode.cn/problems/customer-order-frequency) [English Version](/solution/1500-1599/1511.Customer%20Order%20Frequency/README_EN.md) diff --git a/solution/1500-1599/1511.Customer Order Frequency/README_EN.md b/solution/1500-1599/1511.Customer Order Frequency/README_EN.md index 30ae69cca9654..b7811dcf1eae9 100644 --- a/solution/1500-1599/1511.Customer Order Frequency/README_EN.md +++ b/solution/1500-1599/1511.Customer Order Frequency/README_EN.md @@ -1,4 +1,4 @@ -# [1511. Customer Order Frequency](https://leetcode.com/problems/customer-order-frequency) +# [1511. Customer Order Frequency 🔒](https://leetcode.com/problems/customer-order-frequency) [中文文档](/solution/1500-1599/1511.Customer%20Order%20Frequency/README.md) diff --git a/solution/1500-1599/1516.Move Sub-Tree of N-Ary Tree/README.md b/solution/1500-1599/1516.Move Sub-Tree of N-Ary Tree/README.md index f992571fc06d5..377376be34850 100644 --- a/solution/1500-1599/1516.Move Sub-Tree of N-Ary Tree/README.md +++ b/solution/1500-1599/1516.Move Sub-Tree of N-Ary Tree/README.md @@ -1,4 +1,4 @@ -# [1516. 移动 N 叉树的子树](https://leetcode.cn/problems/move-sub-tree-of-n-ary-tree) +# [1516. 移动 N 叉树的子树 🔒](https://leetcode.cn/problems/move-sub-tree-of-n-ary-tree) [English Version](/solution/1500-1599/1516.Move%20Sub-Tree%20of%20N-Ary%20Tree/README_EN.md) diff --git a/solution/1500-1599/1516.Move Sub-Tree of N-Ary Tree/README_EN.md b/solution/1500-1599/1516.Move Sub-Tree of N-Ary Tree/README_EN.md index cdb0b4c03e0b5..6b826614514af 100644 --- a/solution/1500-1599/1516.Move Sub-Tree of N-Ary Tree/README_EN.md +++ b/solution/1500-1599/1516.Move Sub-Tree of N-Ary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [1516. Move Sub-Tree of N-Ary Tree](https://leetcode.com/problems/move-sub-tree-of-n-ary-tree) +# [1516. Move Sub-Tree of N-Ary Tree 🔒](https://leetcode.com/problems/move-sub-tree-of-n-ary-tree) [中文文档](/solution/1500-1599/1516.Move%20Sub-Tree%20of%20N-Ary%20Tree/README.md) diff --git a/solution/1500-1599/1522.Diameter of N-Ary Tree/README.md b/solution/1500-1599/1522.Diameter of N-Ary Tree/README.md index 29dc4a1b76db7..c72f00bd0734c 100644 --- a/solution/1500-1599/1522.Diameter of N-Ary Tree/README.md +++ b/solution/1500-1599/1522.Diameter of N-Ary Tree/README.md @@ -1,4 +1,4 @@ -# [1522. N 叉树的直径](https://leetcode.cn/problems/diameter-of-n-ary-tree) +# [1522. N 叉树的直径 🔒](https://leetcode.cn/problems/diameter-of-n-ary-tree) [English Version](/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README_EN.md) diff --git a/solution/1500-1599/1522.Diameter of N-Ary Tree/README_EN.md b/solution/1500-1599/1522.Diameter of N-Ary Tree/README_EN.md index 7b3a490915082..8b8678a7b300d 100644 --- a/solution/1500-1599/1522.Diameter of N-Ary Tree/README_EN.md +++ b/solution/1500-1599/1522.Diameter of N-Ary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [1522. Diameter of N-Ary Tree](https://leetcode.com/problems/diameter-of-n-ary-tree) +# [1522. Diameter of N-Ary Tree 🔒](https://leetcode.com/problems/diameter-of-n-ary-tree) [中文文档](/solution/1500-1599/1522.Diameter%20of%20N-Ary%20Tree/README.md) diff --git a/solution/1500-1599/1532.The Most Recent Three Orders/README.md b/solution/1500-1599/1532.The Most Recent Three Orders/README.md index 9048aee57ec17..3073513546fb4 100644 --- a/solution/1500-1599/1532.The Most Recent Three Orders/README.md +++ b/solution/1500-1599/1532.The Most Recent Three Orders/README.md @@ -1,4 +1,4 @@ -# [1532. 最近的三笔订单](https://leetcode.cn/problems/the-most-recent-three-orders) +# [1532. 最近的三笔订单 🔒](https://leetcode.cn/problems/the-most-recent-three-orders) [English Version](/solution/1500-1599/1532.The%20Most%20Recent%20Three%20Orders/README_EN.md) diff --git a/solution/1500-1599/1532.The Most Recent Three Orders/README_EN.md b/solution/1500-1599/1532.The Most Recent Three Orders/README_EN.md index 6aed121516ea9..80e569df9f3d8 100644 --- a/solution/1500-1599/1532.The Most Recent Three Orders/README_EN.md +++ b/solution/1500-1599/1532.The Most Recent Three Orders/README_EN.md @@ -1,4 +1,4 @@ -# [1532. The Most Recent Three Orders](https://leetcode.com/problems/the-most-recent-three-orders) +# [1532. The Most Recent Three Orders 🔒](https://leetcode.com/problems/the-most-recent-three-orders) [中文文档](/solution/1500-1599/1532.The%20Most%20Recent%20Three%20Orders/README.md) diff --git a/solution/1500-1599/1533.Find the Index of the Large Integer/README.md b/solution/1500-1599/1533.Find the Index of the Large Integer/README.md index aa63ceff4d428..910c740aab786 100644 --- a/solution/1500-1599/1533.Find the Index of the Large Integer/README.md +++ b/solution/1500-1599/1533.Find the Index of the Large Integer/README.md @@ -1,4 +1,4 @@ -# [1533. 找到最大整数的索引](https://leetcode.cn/problems/find-the-index-of-the-large-integer) +# [1533. 找到最大整数的索引 🔒](https://leetcode.cn/problems/find-the-index-of-the-large-integer) [English Version](/solution/1500-1599/1533.Find%20the%20Index%20of%20the%20Large%20Integer/README_EN.md) diff --git a/solution/1500-1599/1533.Find the Index of the Large Integer/README_EN.md b/solution/1500-1599/1533.Find the Index of the Large Integer/README_EN.md index f9eb20014a9b6..9360f664a0bc6 100644 --- a/solution/1500-1599/1533.Find the Index of the Large Integer/README_EN.md +++ b/solution/1500-1599/1533.Find the Index of the Large Integer/README_EN.md @@ -1,4 +1,4 @@ -# [1533. Find the Index of the Large Integer](https://leetcode.com/problems/find-the-index-of-the-large-integer) +# [1533. Find the Index of the Large Integer 🔒](https://leetcode.com/problems/find-the-index-of-the-large-integer) [中文文档](/solution/1500-1599/1533.Find%20the%20Index%20of%20the%20Large%20Integer/README.md) diff --git a/solution/1500-1599/1538.Guess the Majority in a Hidden Array/README.md b/solution/1500-1599/1538.Guess the Majority in a Hidden Array/README.md index c706a1892b016..6b8353330c0ad 100644 --- a/solution/1500-1599/1538.Guess the Majority in a Hidden Array/README.md +++ b/solution/1500-1599/1538.Guess the Majority in a Hidden Array/README.md @@ -1,4 +1,4 @@ -# [1538. 找出隐藏数组中出现次数最多的元素](https://leetcode.cn/problems/guess-the-majority-in-a-hidden-array) +# [1538. 找出隐藏数组中出现次数最多的元素 🔒](https://leetcode.cn/problems/guess-the-majority-in-a-hidden-array) [English Version](/solution/1500-1599/1538.Guess%20the%20Majority%20in%20a%20Hidden%20Array/README_EN.md) diff --git a/solution/1500-1599/1538.Guess the Majority in a Hidden Array/README_EN.md b/solution/1500-1599/1538.Guess the Majority in a Hidden Array/README_EN.md index f9a2435e9ba5a..dad3c8df73e2b 100644 --- a/solution/1500-1599/1538.Guess the Majority in a Hidden Array/README_EN.md +++ b/solution/1500-1599/1538.Guess the Majority in a Hidden Array/README_EN.md @@ -1,4 +1,4 @@ -# [1538. Guess the Majority in a Hidden Array](https://leetcode.com/problems/guess-the-majority-in-a-hidden-array) +# [1538. Guess the Majority in a Hidden Array 🔒](https://leetcode.com/problems/guess-the-majority-in-a-hidden-array) [中文文档](/solution/1500-1599/1538.Guess%20the%20Majority%20in%20a%20Hidden%20Array/README.md) diff --git a/solution/1500-1599/1543.Fix Product Name Format/README.md b/solution/1500-1599/1543.Fix Product Name Format/README.md index 1d0ebc093e31d..e68808aa0e00c 100644 --- a/solution/1500-1599/1543.Fix Product Name Format/README.md +++ b/solution/1500-1599/1543.Fix Product Name Format/README.md @@ -1,4 +1,4 @@ -# [1543. 产品名称格式修复](https://leetcode.cn/problems/fix-product-name-format) +# [1543. 产品名称格式修复 🔒](https://leetcode.cn/problems/fix-product-name-format) [English Version](/solution/1500-1599/1543.Fix%20Product%20Name%20Format/README_EN.md) diff --git a/solution/1500-1599/1543.Fix Product Name Format/README_EN.md b/solution/1500-1599/1543.Fix Product Name Format/README_EN.md index 1964b143d3448..2ecee992e90b4 100644 --- a/solution/1500-1599/1543.Fix Product Name Format/README_EN.md +++ b/solution/1500-1599/1543.Fix Product Name Format/README_EN.md @@ -1,4 +1,4 @@ -# [1543. Fix Product Name Format](https://leetcode.com/problems/fix-product-name-format) +# [1543. Fix Product Name Format 🔒](https://leetcode.com/problems/fix-product-name-format) [中文文档](/solution/1500-1599/1543.Fix%20Product%20Name%20Format/README.md) diff --git a/solution/1500-1599/1548.The Most Similar Path in a Graph/README.md b/solution/1500-1599/1548.The Most Similar Path in a Graph/README.md index caedb12a1180a..7cca89bb0575a 100644 --- a/solution/1500-1599/1548.The Most Similar Path in a Graph/README.md +++ b/solution/1500-1599/1548.The Most Similar Path in a Graph/README.md @@ -1,4 +1,4 @@ -# [1548. 图中最相似的路径](https://leetcode.cn/problems/the-most-similar-path-in-a-graph) +# [1548. 图中最相似的路径 🔒](https://leetcode.cn/problems/the-most-similar-path-in-a-graph) [English Version](/solution/1500-1599/1548.The%20Most%20Similar%20Path%20in%20a%20Graph/README_EN.md) diff --git a/solution/1500-1599/1548.The Most Similar Path in a Graph/README_EN.md b/solution/1500-1599/1548.The Most Similar Path in a Graph/README_EN.md index a7ce5a86670f1..de5fb24461f72 100644 --- a/solution/1500-1599/1548.The Most Similar Path in a Graph/README_EN.md +++ b/solution/1500-1599/1548.The Most Similar Path in a Graph/README_EN.md @@ -1,4 +1,4 @@ -# [1548. The Most Similar Path in a Graph](https://leetcode.com/problems/the-most-similar-path-in-a-graph) +# [1548. The Most Similar Path in a Graph 🔒](https://leetcode.com/problems/the-most-similar-path-in-a-graph) [中文文档](/solution/1500-1599/1548.The%20Most%20Similar%20Path%20in%20a%20Graph/README.md) diff --git a/solution/1500-1599/1549.The Most Recent Orders for Each Product/README.md b/solution/1500-1599/1549.The Most Recent Orders for Each Product/README.md index 8d6421da9fb6d..480f26fc331a4 100644 --- a/solution/1500-1599/1549.The Most Recent Orders for Each Product/README.md +++ b/solution/1500-1599/1549.The Most Recent Orders for Each Product/README.md @@ -1,4 +1,4 @@ -# [1549. 每件商品的最新订单](https://leetcode.cn/problems/the-most-recent-orders-for-each-product) +# [1549. 每件商品的最新订单 🔒](https://leetcode.cn/problems/the-most-recent-orders-for-each-product) [English Version](/solution/1500-1599/1549.The%20Most%20Recent%20Orders%20for%20Each%20Product/README_EN.md) diff --git a/solution/1500-1599/1549.The Most Recent Orders for Each Product/README_EN.md b/solution/1500-1599/1549.The Most Recent Orders for Each Product/README_EN.md index f534ff35dd3a1..eefae0a29c0f7 100644 --- a/solution/1500-1599/1549.The Most Recent Orders for Each Product/README_EN.md +++ b/solution/1500-1599/1549.The Most Recent Orders for Each Product/README_EN.md @@ -1,4 +1,4 @@ -# [1549. The Most Recent Orders for Each Product](https://leetcode.com/problems/the-most-recent-orders-for-each-product) +# [1549. The Most Recent Orders for Each Product 🔒](https://leetcode.com/problems/the-most-recent-orders-for-each-product) [中文文档](/solution/1500-1599/1549.The%20Most%20Recent%20Orders%20for%20Each%20Product/README.md) diff --git a/solution/1500-1599/1554.Strings Differ by One Character/README.md b/solution/1500-1599/1554.Strings Differ by One Character/README.md index c1dd34264702c..83d8bc833d27e 100644 --- a/solution/1500-1599/1554.Strings Differ by One Character/README.md +++ b/solution/1500-1599/1554.Strings Differ by One Character/README.md @@ -1,4 +1,4 @@ -# [1554. 只有一个不同字符的字符串](https://leetcode.cn/problems/strings-differ-by-one-character) +# [1554. 只有一个不同字符的字符串 🔒](https://leetcode.cn/problems/strings-differ-by-one-character) [English Version](/solution/1500-1599/1554.Strings%20Differ%20by%20One%20Character/README_EN.md) diff --git a/solution/1500-1599/1554.Strings Differ by One Character/README_EN.md b/solution/1500-1599/1554.Strings Differ by One Character/README_EN.md index 30c355b8b3f89..37806e88a7462 100644 --- a/solution/1500-1599/1554.Strings Differ by One Character/README_EN.md +++ b/solution/1500-1599/1554.Strings Differ by One Character/README_EN.md @@ -1,4 +1,4 @@ -# [1554. Strings Differ by One Character](https://leetcode.com/problems/strings-differ-by-one-character) +# [1554. Strings Differ by One Character 🔒](https://leetcode.com/problems/strings-differ-by-one-character) [中文文档](/solution/1500-1599/1554.Strings%20Differ%20by%20One%20Character/README.md) diff --git a/solution/1500-1599/1555.Bank Account Summary/README.md b/solution/1500-1599/1555.Bank Account Summary/README.md index eb4ecf619fd1e..b7dea93ad730b 100644 --- a/solution/1500-1599/1555.Bank Account Summary/README.md +++ b/solution/1500-1599/1555.Bank Account Summary/README.md @@ -1,4 +1,4 @@ -# [1555. 银行账户概要](https://leetcode.cn/problems/bank-account-summary) +# [1555. 银行账户概要 🔒](https://leetcode.cn/problems/bank-account-summary) [English Version](/solution/1500-1599/1555.Bank%20Account%20Summary/README_EN.md) diff --git a/solution/1500-1599/1555.Bank Account Summary/README_EN.md b/solution/1500-1599/1555.Bank Account Summary/README_EN.md index a1c46bc550093..cb8c49c5fc708 100644 --- a/solution/1500-1599/1555.Bank Account Summary/README_EN.md +++ b/solution/1500-1599/1555.Bank Account Summary/README_EN.md @@ -1,4 +1,4 @@ -# [1555. Bank Account Summary](https://leetcode.com/problems/bank-account-summary) +# [1555. Bank Account Summary 🔒](https://leetcode.com/problems/bank-account-summary) [中文文档](/solution/1500-1599/1555.Bank%20Account%20Summary/README.md) diff --git a/solution/1500-1599/1564.Put Boxes Into the Warehouse I/README.md b/solution/1500-1599/1564.Put Boxes Into the Warehouse I/README.md index ff4be00c2ebf9..cb7ef8068a52f 100644 --- a/solution/1500-1599/1564.Put Boxes Into the Warehouse I/README.md +++ b/solution/1500-1599/1564.Put Boxes Into the Warehouse I/README.md @@ -1,4 +1,4 @@ -# [1564. 把箱子放进仓库里 I](https://leetcode.cn/problems/put-boxes-into-the-warehouse-i) +# [1564. 把箱子放进仓库里 I 🔒](https://leetcode.cn/problems/put-boxes-into-the-warehouse-i) [English Version](/solution/1500-1599/1564.Put%20Boxes%20Into%20the%20Warehouse%20I/README_EN.md) diff --git a/solution/1500-1599/1564.Put Boxes Into the Warehouse I/README_EN.md b/solution/1500-1599/1564.Put Boxes Into the Warehouse I/README_EN.md index a1906ac89ef8f..43375bb8d3325 100644 --- a/solution/1500-1599/1564.Put Boxes Into the Warehouse I/README_EN.md +++ b/solution/1500-1599/1564.Put Boxes Into the Warehouse I/README_EN.md @@ -1,4 +1,4 @@ -# [1564. Put Boxes Into the Warehouse I](https://leetcode.com/problems/put-boxes-into-the-warehouse-i) +# [1564. Put Boxes Into the Warehouse I 🔒](https://leetcode.com/problems/put-boxes-into-the-warehouse-i) [中文文档](/solution/1500-1599/1564.Put%20Boxes%20Into%20the%20Warehouse%20I/README.md) diff --git a/solution/1500-1599/1565.Unique Orders and Customers Per Month/README.md b/solution/1500-1599/1565.Unique Orders and Customers Per Month/README.md index 94e9a1c37ba74..36b8d97ecde55 100644 --- a/solution/1500-1599/1565.Unique Orders and Customers Per Month/README.md +++ b/solution/1500-1599/1565.Unique Orders and Customers Per Month/README.md @@ -1,4 +1,4 @@ -# [1565. 按月统计订单数与顾客数](https://leetcode.cn/problems/unique-orders-and-customers-per-month) +# [1565. 按月统计订单数与顾客数 🔒](https://leetcode.cn/problems/unique-orders-and-customers-per-month) [English Version](/solution/1500-1599/1565.Unique%20Orders%20and%20Customers%20Per%20Month/README_EN.md) diff --git a/solution/1500-1599/1565.Unique Orders and Customers Per Month/README_EN.md b/solution/1500-1599/1565.Unique Orders and Customers Per Month/README_EN.md index c625b887d74c2..0b6548f8dd5dc 100644 --- a/solution/1500-1599/1565.Unique Orders and Customers Per Month/README_EN.md +++ b/solution/1500-1599/1565.Unique Orders and Customers Per Month/README_EN.md @@ -1,4 +1,4 @@ -# [1565. Unique Orders and Customers Per Month](https://leetcode.com/problems/unique-orders-and-customers-per-month) +# [1565. Unique Orders and Customers Per Month 🔒](https://leetcode.com/problems/unique-orders-and-customers-per-month) [中文文档](/solution/1500-1599/1565.Unique%20Orders%20and%20Customers%20Per%20Month/README.md) diff --git a/solution/1500-1599/1570.Dot Product of Two Sparse Vectors/README.md b/solution/1500-1599/1570.Dot Product of Two Sparse Vectors/README.md index a5ef238972e26..d41f125337532 100644 --- a/solution/1500-1599/1570.Dot Product of Two Sparse Vectors/README.md +++ b/solution/1500-1599/1570.Dot Product of Two Sparse Vectors/README.md @@ -1,4 +1,4 @@ -# [1570. 两个稀疏向量的点积](https://leetcode.cn/problems/dot-product-of-two-sparse-vectors) +# [1570. 两个稀疏向量的点积 🔒](https://leetcode.cn/problems/dot-product-of-two-sparse-vectors) [English Version](/solution/1500-1599/1570.Dot%20Product%20of%20Two%20Sparse%20Vectors/README_EN.md) diff --git a/solution/1500-1599/1570.Dot Product of Two Sparse Vectors/README_EN.md b/solution/1500-1599/1570.Dot Product of Two Sparse Vectors/README_EN.md index 590d889cf386b..32e7e5f154db7 100644 --- a/solution/1500-1599/1570.Dot Product of Two Sparse Vectors/README_EN.md +++ b/solution/1500-1599/1570.Dot Product of Two Sparse Vectors/README_EN.md @@ -1,4 +1,4 @@ -# [1570. Dot Product of Two Sparse Vectors](https://leetcode.com/problems/dot-product-of-two-sparse-vectors) +# [1570. Dot Product of Two Sparse Vectors 🔒](https://leetcode.com/problems/dot-product-of-two-sparse-vectors) [中文文档](/solution/1500-1599/1570.Dot%20Product%20of%20Two%20Sparse%20Vectors/README.md) diff --git a/solution/1500-1599/1571.Warehouse Manager/README.md b/solution/1500-1599/1571.Warehouse Manager/README.md index 7e99d9f4c72d1..bbb301db8ad6e 100644 --- a/solution/1500-1599/1571.Warehouse Manager/README.md +++ b/solution/1500-1599/1571.Warehouse Manager/README.md @@ -1,4 +1,4 @@ -# [1571. 仓库经理](https://leetcode.cn/problems/warehouse-manager) +# [1571. 仓库经理 🔒](https://leetcode.cn/problems/warehouse-manager) [English Version](/solution/1500-1599/1571.Warehouse%20Manager/README_EN.md) diff --git a/solution/1500-1599/1571.Warehouse Manager/README_EN.md b/solution/1500-1599/1571.Warehouse Manager/README_EN.md index 6c214445a39d6..b29d9dbe73d3f 100644 --- a/solution/1500-1599/1571.Warehouse Manager/README_EN.md +++ b/solution/1500-1599/1571.Warehouse Manager/README_EN.md @@ -1,4 +1,4 @@ -# [1571. Warehouse Manager](https://leetcode.com/problems/warehouse-manager) +# [1571. Warehouse Manager 🔒](https://leetcode.com/problems/warehouse-manager) [中文文档](/solution/1500-1599/1571.Warehouse%20Manager/README.md) diff --git a/solution/1500-1599/1580.Put Boxes Into the Warehouse II/README.md b/solution/1500-1599/1580.Put Boxes Into the Warehouse II/README.md index 172b6755aa906..a6f43795463a7 100644 --- a/solution/1500-1599/1580.Put Boxes Into the Warehouse II/README.md +++ b/solution/1500-1599/1580.Put Boxes Into the Warehouse II/README.md @@ -1,4 +1,4 @@ -# [1580. 把箱子放进仓库里 II](https://leetcode.cn/problems/put-boxes-into-the-warehouse-ii) +# [1580. 把箱子放进仓库里 II 🔒](https://leetcode.cn/problems/put-boxes-into-the-warehouse-ii) [English Version](/solution/1500-1599/1580.Put%20Boxes%20Into%20the%20Warehouse%20II/README_EN.md) diff --git a/solution/1500-1599/1580.Put Boxes Into the Warehouse II/README_EN.md b/solution/1500-1599/1580.Put Boxes Into the Warehouse II/README_EN.md index 2aa7c94a996a8..2eec15bc9145a 100644 --- a/solution/1500-1599/1580.Put Boxes Into the Warehouse II/README_EN.md +++ b/solution/1500-1599/1580.Put Boxes Into the Warehouse II/README_EN.md @@ -1,4 +1,4 @@ -# [1580. Put Boxes Into the Warehouse II](https://leetcode.com/problems/put-boxes-into-the-warehouse-ii) +# [1580. Put Boxes Into the Warehouse II 🔒](https://leetcode.com/problems/put-boxes-into-the-warehouse-ii) [中文文档](/solution/1500-1599/1580.Put%20Boxes%20Into%20the%20Warehouse%20II/README.md) diff --git a/solution/1500-1599/1586.Binary Search Tree Iterator II/README.md b/solution/1500-1599/1586.Binary Search Tree Iterator II/README.md index afdf3a1693b85..5535a9b036950 100644 --- a/solution/1500-1599/1586.Binary Search Tree Iterator II/README.md +++ b/solution/1500-1599/1586.Binary Search Tree Iterator II/README.md @@ -1,4 +1,4 @@ -# [1586. 二叉搜索树迭代器 II](https://leetcode.cn/problems/binary-search-tree-iterator-ii) +# [1586. 二叉搜索树迭代器 II 🔒](https://leetcode.cn/problems/binary-search-tree-iterator-ii) [English Version](/solution/1500-1599/1586.Binary%20Search%20Tree%20Iterator%20II/README_EN.md) diff --git a/solution/1500-1599/1586.Binary Search Tree Iterator II/README_EN.md b/solution/1500-1599/1586.Binary Search Tree Iterator II/README_EN.md index 44afe88c990a8..4bd177a1a0e09 100644 --- a/solution/1500-1599/1586.Binary Search Tree Iterator II/README_EN.md +++ b/solution/1500-1599/1586.Binary Search Tree Iterator II/README_EN.md @@ -1,4 +1,4 @@ -# [1586. Binary Search Tree Iterator II](https://leetcode.com/problems/binary-search-tree-iterator-ii) +# [1586. Binary Search Tree Iterator II 🔒](https://leetcode.com/problems/binary-search-tree-iterator-ii) [中文文档](/solution/1500-1599/1586.Binary%20Search%20Tree%20Iterator%20II/README.md) diff --git a/solution/1500-1599/1596.The Most Frequently Ordered Products for Each Customer/README.md b/solution/1500-1599/1596.The Most Frequently Ordered Products for Each Customer/README.md index 55c03fb6f1085..9b75d38aa41e9 100644 --- a/solution/1500-1599/1596.The Most Frequently Ordered Products for Each Customer/README.md +++ b/solution/1500-1599/1596.The Most Frequently Ordered Products for Each Customer/README.md @@ -1,4 +1,4 @@ -# [1596. 每位顾客最经常订购的商品](https://leetcode.cn/problems/the-most-frequently-ordered-products-for-each-customer) +# [1596. 每位顾客最经常订购的商品 🔒](https://leetcode.cn/problems/the-most-frequently-ordered-products-for-each-customer) [English Version](/solution/1500-1599/1596.The%20Most%20Frequently%20Ordered%20Products%20for%20Each%20Customer/README_EN.md) diff --git a/solution/1500-1599/1596.The Most Frequently Ordered Products for Each Customer/README_EN.md b/solution/1500-1599/1596.The Most Frequently Ordered Products for Each Customer/README_EN.md index 7f59b2517fd91..3bbaa78108ceb 100644 --- a/solution/1500-1599/1596.The Most Frequently Ordered Products for Each Customer/README_EN.md +++ b/solution/1500-1599/1596.The Most Frequently Ordered Products for Each Customer/README_EN.md @@ -1,4 +1,4 @@ -# [1596. The Most Frequently Ordered Products for Each Customer](https://leetcode.com/problems/the-most-frequently-ordered-products-for-each-customer) +# [1596. The Most Frequently Ordered Products for Each Customer 🔒](https://leetcode.com/problems/the-most-frequently-ordered-products-for-each-customer) [中文文档](/solution/1500-1599/1596.The%20Most%20Frequently%20Ordered%20Products%20for%20Each%20Customer/README.md) diff --git a/solution/1500-1599/1597.Build Binary Expression Tree From Infix Expression/README.md b/solution/1500-1599/1597.Build Binary Expression Tree From Infix Expression/README.md index 4d40679c25b41..b69a14f4231e9 100644 --- a/solution/1500-1599/1597.Build Binary Expression Tree From Infix Expression/README.md +++ b/solution/1500-1599/1597.Build Binary Expression Tree From Infix Expression/README.md @@ -1,4 +1,4 @@ -# [1597. 根据中缀表达式构造二叉表达式树](https://leetcode.cn/problems/build-binary-expression-tree-from-infix-expression) +# [1597. 根据中缀表达式构造二叉表达式树 🔒](https://leetcode.cn/problems/build-binary-expression-tree-from-infix-expression) [English Version](/solution/1500-1599/1597.Build%20Binary%20Expression%20Tree%20From%20Infix%20Expression/README_EN.md) diff --git a/solution/1500-1599/1597.Build Binary Expression Tree From Infix Expression/README_EN.md b/solution/1500-1599/1597.Build Binary Expression Tree From Infix Expression/README_EN.md index 70b23f894f867..e393b1e5b89d2 100644 --- a/solution/1500-1599/1597.Build Binary Expression Tree From Infix Expression/README_EN.md +++ b/solution/1500-1599/1597.Build Binary Expression Tree From Infix Expression/README_EN.md @@ -1,4 +1,4 @@ -# [1597. Build Binary Expression Tree From Infix Expression](https://leetcode.com/problems/build-binary-expression-tree-from-infix-expression) +# [1597. Build Binary Expression Tree From Infix Expression 🔒](https://leetcode.com/problems/build-binary-expression-tree-from-infix-expression) [中文文档](/solution/1500-1599/1597.Build%20Binary%20Expression%20Tree%20From%20Infix%20Expression/README.md) diff --git a/solution/1600-1699/1602.Find Nearest Right Node in Binary Tree/README.md b/solution/1600-1699/1602.Find Nearest Right Node in Binary Tree/README.md index 7e1dc66141450..a1f1543ff09ae 100644 --- a/solution/1600-1699/1602.Find Nearest Right Node in Binary Tree/README.md +++ b/solution/1600-1699/1602.Find Nearest Right Node in Binary Tree/README.md @@ -1,4 +1,4 @@ -# [1602. 找到二叉树中最近的右侧节点](https://leetcode.cn/problems/find-nearest-right-node-in-binary-tree) +# [1602. 找到二叉树中最近的右侧节点 🔒](https://leetcode.cn/problems/find-nearest-right-node-in-binary-tree) [English Version](/solution/1600-1699/1602.Find%20Nearest%20Right%20Node%20in%20Binary%20Tree/README_EN.md) diff --git a/solution/1600-1699/1602.Find Nearest Right Node in Binary Tree/README_EN.md b/solution/1600-1699/1602.Find Nearest Right Node in Binary Tree/README_EN.md index 5428e0d623817..79d6f01058110 100644 --- a/solution/1600-1699/1602.Find Nearest Right Node in Binary Tree/README_EN.md +++ b/solution/1600-1699/1602.Find Nearest Right Node in Binary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [1602. Find Nearest Right Node in Binary Tree](https://leetcode.com/problems/find-nearest-right-node-in-binary-tree) +# [1602. Find Nearest Right Node in Binary Tree 🔒](https://leetcode.com/problems/find-nearest-right-node-in-binary-tree) [中文文档](/solution/1600-1699/1602.Find%20Nearest%20Right%20Node%20in%20Binary%20Tree/README.md) diff --git a/solution/1600-1699/1607.Sellers With No Sales/README.md b/solution/1600-1699/1607.Sellers With No Sales/README.md index fe76f0514cc71..3bb02df604eb4 100644 --- a/solution/1600-1699/1607.Sellers With No Sales/README.md +++ b/solution/1600-1699/1607.Sellers With No Sales/README.md @@ -1,4 +1,4 @@ -# [1607. 没有卖出的卖家](https://leetcode.cn/problems/sellers-with-no-sales) +# [1607. 没有卖出的卖家 🔒](https://leetcode.cn/problems/sellers-with-no-sales) [English Version](/solution/1600-1699/1607.Sellers%20With%20No%20Sales/README_EN.md) diff --git a/solution/1600-1699/1607.Sellers With No Sales/README_EN.md b/solution/1600-1699/1607.Sellers With No Sales/README_EN.md index 580865ed692cb..76186c8f47baa 100644 --- a/solution/1600-1699/1607.Sellers With No Sales/README_EN.md +++ b/solution/1600-1699/1607.Sellers With No Sales/README_EN.md @@ -1,4 +1,4 @@ -# [1607. Sellers With No Sales](https://leetcode.com/problems/sellers-with-no-sales) +# [1607. Sellers With No Sales 🔒](https://leetcode.com/problems/sellers-with-no-sales) [中文文档](/solution/1600-1699/1607.Sellers%20With%20No%20Sales/README.md) diff --git a/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README.md b/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README.md index 352722a1b0aa8..0b9d5ad141328 100644 --- a/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README.md +++ b/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README.md @@ -1,4 +1,4 @@ -# [1612. 检查两棵二叉表达式树是否等价](https://leetcode.cn/problems/check-if-two-expression-trees-are-equivalent) +# [1612. 检查两棵二叉表达式树是否等价 🔒](https://leetcode.cn/problems/check-if-two-expression-trees-are-equivalent) [English Version](/solution/1600-1699/1612.Check%20If%20Two%20Expression%20Trees%20are%20Equivalent/README_EN.md) diff --git a/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README_EN.md b/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README_EN.md index e481eb78f2a70..ea2136b2db9b7 100644 --- a/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README_EN.md +++ b/solution/1600-1699/1612.Check If Two Expression Trees are Equivalent/README_EN.md @@ -1,4 +1,4 @@ -# [1612. Check If Two Expression Trees are Equivalent](https://leetcode.com/problems/check-if-two-expression-trees-are-equivalent) +# [1612. Check If Two Expression Trees are Equivalent 🔒](https://leetcode.com/problems/check-if-two-expression-trees-are-equivalent) [中文文档](/solution/1600-1699/1612.Check%20If%20Two%20Expression%20Trees%20are%20Equivalent/README.md) diff --git a/solution/1600-1699/1613.Find the Missing IDs/README.md b/solution/1600-1699/1613.Find the Missing IDs/README.md index b26a3f8c2e988..c1c72aa3a3583 100644 --- a/solution/1600-1699/1613.Find the Missing IDs/README.md +++ b/solution/1600-1699/1613.Find the Missing IDs/README.md @@ -1,4 +1,4 @@ -# [1613. 找到遗失的 ID](https://leetcode.cn/problems/find-the-missing-ids) +# [1613. 找到遗失的 ID 🔒](https://leetcode.cn/problems/find-the-missing-ids) [English Version](/solution/1600-1699/1613.Find%20the%20Missing%20IDs/README_EN.md) diff --git a/solution/1600-1699/1613.Find the Missing IDs/README_EN.md b/solution/1600-1699/1613.Find the Missing IDs/README_EN.md index 85533b8cd6dbe..c3f528591a7da 100644 --- a/solution/1600-1699/1613.Find the Missing IDs/README_EN.md +++ b/solution/1600-1699/1613.Find the Missing IDs/README_EN.md @@ -1,4 +1,4 @@ -# [1613. Find the Missing IDs](https://leetcode.com/problems/find-the-missing-ids) +# [1613. Find the Missing IDs 🔒](https://leetcode.com/problems/find-the-missing-ids) [中文文档](/solution/1600-1699/1613.Find%20the%20Missing%20IDs/README.md) diff --git a/solution/1600-1699/1618.Maximum Font to Fit a Sentence in a Screen/README.md b/solution/1600-1699/1618.Maximum Font to Fit a Sentence in a Screen/README.md index bb716961700c3..bcc79c052f5d7 100644 --- a/solution/1600-1699/1618.Maximum Font to Fit a Sentence in a Screen/README.md +++ b/solution/1600-1699/1618.Maximum Font to Fit a Sentence in a Screen/README.md @@ -1,4 +1,4 @@ -# [1618. 找出适应屏幕的最大字号](https://leetcode.cn/problems/maximum-font-to-fit-a-sentence-in-a-screen) +# [1618. 找出适应屏幕的最大字号 🔒](https://leetcode.cn/problems/maximum-font-to-fit-a-sentence-in-a-screen) [English Version](/solution/1600-1699/1618.Maximum%20Font%20to%20Fit%20a%20Sentence%20in%20a%20Screen/README_EN.md) diff --git a/solution/1600-1699/1618.Maximum Font to Fit a Sentence in a Screen/README_EN.md b/solution/1600-1699/1618.Maximum Font to Fit a Sentence in a Screen/README_EN.md index 74db17f4f4da4..f5ebd74b47953 100644 --- a/solution/1600-1699/1618.Maximum Font to Fit a Sentence in a Screen/README_EN.md +++ b/solution/1600-1699/1618.Maximum Font to Fit a Sentence in a Screen/README_EN.md @@ -1,4 +1,4 @@ -# [1618. Maximum Font to Fit a Sentence in a Screen](https://leetcode.com/problems/maximum-font-to-fit-a-sentence-in-a-screen) +# [1618. Maximum Font to Fit a Sentence in a Screen 🔒](https://leetcode.com/problems/maximum-font-to-fit-a-sentence-in-a-screen) [中文文档](/solution/1600-1699/1618.Maximum%20Font%20to%20Fit%20a%20Sentence%20in%20a%20Screen/README.md) diff --git a/solution/1600-1699/1623.All Valid Triplets That Can Represent a Country/README.md b/solution/1600-1699/1623.All Valid Triplets That Can Represent a Country/README.md index 3e710a043e2fe..7a0892172b1dd 100644 --- a/solution/1600-1699/1623.All Valid Triplets That Can Represent a Country/README.md +++ b/solution/1600-1699/1623.All Valid Triplets That Can Represent a Country/README.md @@ -1,4 +1,4 @@ -# [1623. 三人国家代表队](https://leetcode.cn/problems/all-valid-triplets-that-can-represent-a-country) +# [1623. 三人国家代表队 🔒](https://leetcode.cn/problems/all-valid-triplets-that-can-represent-a-country) [English Version](/solution/1600-1699/1623.All%20Valid%20Triplets%20That%20Can%20Represent%20a%20Country/README_EN.md) diff --git a/solution/1600-1699/1623.All Valid Triplets That Can Represent a Country/README_EN.md b/solution/1600-1699/1623.All Valid Triplets That Can Represent a Country/README_EN.md index d8ad02c393a40..fb12e35fe475c 100644 --- a/solution/1600-1699/1623.All Valid Triplets That Can Represent a Country/README_EN.md +++ b/solution/1600-1699/1623.All Valid Triplets That Can Represent a Country/README_EN.md @@ -1,4 +1,4 @@ -# [1623. All Valid Triplets That Can Represent a Country](https://leetcode.com/problems/all-valid-triplets-that-can-represent-a-country) +# [1623. All Valid Triplets That Can Represent a Country 🔒](https://leetcode.com/problems/all-valid-triplets-that-can-represent-a-country) [中文文档](/solution/1600-1699/1623.All%20Valid%20Triplets%20That%20Can%20Represent%20a%20Country/README.md) diff --git a/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README.md b/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README.md index 68c915313e4a5..408f315c30a1d 100644 --- a/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README.md +++ b/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README.md @@ -1,4 +1,4 @@ -# [1628. 设计带解析函数的表达式树](https://leetcode.cn/problems/design-an-expression-tree-with-evaluate-function) +# [1628. 设计带解析函数的表达式树 🔒](https://leetcode.cn/problems/design-an-expression-tree-with-evaluate-function) [English Version](/solution/1600-1699/1628.Design%20an%20Expression%20Tree%20With%20Evaluate%20Function/README_EN.md) diff --git a/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README_EN.md b/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README_EN.md index 4edc6e1ff501f..936a77b67133b 100644 --- a/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README_EN.md +++ b/solution/1600-1699/1628.Design an Expression Tree With Evaluate Function/README_EN.md @@ -1,4 +1,4 @@ -# [1628. Design an Expression Tree With Evaluate Function](https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function) +# [1628. Design an Expression Tree With Evaluate Function 🔒](https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function) [中文文档](/solution/1600-1699/1628.Design%20an%20Expression%20Tree%20With%20Evaluate%20Function/README.md) diff --git a/solution/1600-1699/1634.Add Two Polynomials Represented as Linked Lists/README.md b/solution/1600-1699/1634.Add Two Polynomials Represented as Linked Lists/README.md index 389054c0e8e28..782b0c9385cc3 100644 --- a/solution/1600-1699/1634.Add Two Polynomials Represented as Linked Lists/README.md +++ b/solution/1600-1699/1634.Add Two Polynomials Represented as Linked Lists/README.md @@ -1,4 +1,4 @@ -# [1634. 求两个多项式链表的和](https://leetcode.cn/problems/add-two-polynomials-represented-as-linked-lists) +# [1634. 求两个多项式链表的和 🔒](https://leetcode.cn/problems/add-two-polynomials-represented-as-linked-lists) [English Version](/solution/1600-1699/1634.Add%20Two%20Polynomials%20Represented%20as%20Linked%20Lists/README_EN.md) diff --git a/solution/1600-1699/1634.Add Two Polynomials Represented as Linked Lists/README_EN.md b/solution/1600-1699/1634.Add Two Polynomials Represented as Linked Lists/README_EN.md index edead57465e48..fd0f5db03d246 100644 --- a/solution/1600-1699/1634.Add Two Polynomials Represented as Linked Lists/README_EN.md +++ b/solution/1600-1699/1634.Add Two Polynomials Represented as Linked Lists/README_EN.md @@ -1,4 +1,4 @@ -# [1634. Add Two Polynomials Represented as Linked Lists](https://leetcode.com/problems/add-two-polynomials-represented-as-linked-lists) +# [1634. Add Two Polynomials Represented as Linked Lists 🔒](https://leetcode.com/problems/add-two-polynomials-represented-as-linked-lists) [中文文档](/solution/1600-1699/1634.Add%20Two%20Polynomials%20Represented%20as%20Linked%20Lists/README.md) diff --git a/solution/1600-1699/1635.Hopper Company Queries I/README.md b/solution/1600-1699/1635.Hopper Company Queries I/README.md index e0963c5e1cde3..248561c16e11f 100644 --- a/solution/1600-1699/1635.Hopper Company Queries I/README.md +++ b/solution/1600-1699/1635.Hopper Company Queries I/README.md @@ -1,4 +1,4 @@ -# [1635. Hopper 公司查询 I](https://leetcode.cn/problems/hopper-company-queries-i) +# [1635. Hopper 公司查询 I 🔒](https://leetcode.cn/problems/hopper-company-queries-i) [English Version](/solution/1600-1699/1635.Hopper%20Company%20Queries%20I/README_EN.md) diff --git a/solution/1600-1699/1635.Hopper Company Queries I/README_EN.md b/solution/1600-1699/1635.Hopper Company Queries I/README_EN.md index 7fe82da7f0dd2..346dd96243d7d 100644 --- a/solution/1600-1699/1635.Hopper Company Queries I/README_EN.md +++ b/solution/1600-1699/1635.Hopper Company Queries I/README_EN.md @@ -1,4 +1,4 @@ -# [1635. Hopper Company Queries I](https://leetcode.com/problems/hopper-company-queries-i) +# [1635. Hopper Company Queries I 🔒](https://leetcode.com/problems/hopper-company-queries-i) [中文文档](/solution/1600-1699/1635.Hopper%20Company%20Queries%20I/README.md) diff --git a/solution/1600-1699/1644.Lowest Common Ancestor of a Binary Tree II/README.md b/solution/1600-1699/1644.Lowest Common Ancestor of a Binary Tree II/README.md index 5143384844f89..b672ac4dab4c9 100644 --- a/solution/1600-1699/1644.Lowest Common Ancestor of a Binary Tree II/README.md +++ b/solution/1600-1699/1644.Lowest Common Ancestor of a Binary Tree II/README.md @@ -1,4 +1,4 @@ -# [1644. 二叉树的最近公共祖先 II](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-ii) +# [1644. 二叉树的最近公共祖先 II 🔒](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-ii) [English Version](/solution/1600-1699/1644.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20II/README_EN.md) diff --git a/solution/1600-1699/1644.Lowest Common Ancestor of a Binary Tree II/README_EN.md b/solution/1600-1699/1644.Lowest Common Ancestor of a Binary Tree II/README_EN.md index 8f065e0eb61f3..1f2e9551b6d62 100644 --- a/solution/1600-1699/1644.Lowest Common Ancestor of a Binary Tree II/README_EN.md +++ b/solution/1600-1699/1644.Lowest Common Ancestor of a Binary Tree II/README_EN.md @@ -1,4 +1,4 @@ -# [1644. Lowest Common Ancestor of a Binary Tree II](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii) +# [1644. Lowest Common Ancestor of a Binary Tree II 🔒](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii) [中文文档](/solution/1600-1699/1644.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20II/README.md) diff --git a/solution/1600-1699/1645.Hopper Company Queries II/README.md b/solution/1600-1699/1645.Hopper Company Queries II/README.md index 3c8de950dd8e4..84df60dffd59b 100644 --- a/solution/1600-1699/1645.Hopper Company Queries II/README.md +++ b/solution/1600-1699/1645.Hopper Company Queries II/README.md @@ -1,4 +1,4 @@ -# [1645. Hopper 公司查询 II](https://leetcode.cn/problems/hopper-company-queries-ii) +# [1645. Hopper 公司查询 II 🔒](https://leetcode.cn/problems/hopper-company-queries-ii) [English Version](/solution/1600-1699/1645.Hopper%20Company%20Queries%20II/README_EN.md) diff --git a/solution/1600-1699/1645.Hopper Company Queries II/README_EN.md b/solution/1600-1699/1645.Hopper Company Queries II/README_EN.md index 2cee335000eab..1911ac48cc116 100644 --- a/solution/1600-1699/1645.Hopper Company Queries II/README_EN.md +++ b/solution/1600-1699/1645.Hopper Company Queries II/README_EN.md @@ -1,4 +1,4 @@ -# [1645. Hopper Company Queries II](https://leetcode.com/problems/hopper-company-queries-ii) +# [1645. Hopper Company Queries II 🔒](https://leetcode.com/problems/hopper-company-queries-ii) [中文文档](/solution/1600-1699/1645.Hopper%20Company%20Queries%20II/README.md) diff --git a/solution/1600-1699/1650.Lowest Common Ancestor of a Binary Tree III/README.md b/solution/1600-1699/1650.Lowest Common Ancestor of a Binary Tree III/README.md index d8476fc301369..ba9c439fedcbf 100644 --- a/solution/1600-1699/1650.Lowest Common Ancestor of a Binary Tree III/README.md +++ b/solution/1600-1699/1650.Lowest Common Ancestor of a Binary Tree III/README.md @@ -1,4 +1,4 @@ -# [1650. 二叉树的最近公共祖先 III](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-iii) +# [1650. 二叉树的最近公共祖先 III 🔒](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-iii) [English Version](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README_EN.md) diff --git a/solution/1600-1699/1650.Lowest Common Ancestor of a Binary Tree III/README_EN.md b/solution/1600-1699/1650.Lowest Common Ancestor of a Binary Tree III/README_EN.md index 5a48b6902a72a..de0336a863cf3 100644 --- a/solution/1600-1699/1650.Lowest Common Ancestor of a Binary Tree III/README_EN.md +++ b/solution/1600-1699/1650.Lowest Common Ancestor of a Binary Tree III/README_EN.md @@ -1,4 +1,4 @@ -# [1650. Lowest Common Ancestor of a Binary Tree III](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii) +# [1650. Lowest Common Ancestor of a Binary Tree III 🔒](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii) [中文文档](/solution/1600-1699/1650.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20III/README.md) diff --git a/solution/1600-1699/1651.Hopper Company Queries III/README.md b/solution/1600-1699/1651.Hopper Company Queries III/README.md index 5acbcefe91fe8..0b99083d479be 100644 --- a/solution/1600-1699/1651.Hopper Company Queries III/README.md +++ b/solution/1600-1699/1651.Hopper Company Queries III/README.md @@ -1,4 +1,4 @@ -# [1651. Hopper 公司查询 III](https://leetcode.cn/problems/hopper-company-queries-iii) +# [1651. Hopper 公司查询 III 🔒](https://leetcode.cn/problems/hopper-company-queries-iii) [English Version](/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README_EN.md) diff --git a/solution/1600-1699/1651.Hopper Company Queries III/README_EN.md b/solution/1600-1699/1651.Hopper Company Queries III/README_EN.md index c69372725e043..32b46e04f4348 100644 --- a/solution/1600-1699/1651.Hopper Company Queries III/README_EN.md +++ b/solution/1600-1699/1651.Hopper Company Queries III/README_EN.md @@ -1,4 +1,4 @@ -# [1651. Hopper Company Queries III](https://leetcode.com/problems/hopper-company-queries-iii) +# [1651. Hopper Company Queries III 🔒](https://leetcode.com/problems/hopper-company-queries-iii) [中文文档](/solution/1600-1699/1651.Hopper%20Company%20Queries%20III/README.md) diff --git a/solution/1600-1699/1660.Correct a Binary Tree/README.md b/solution/1600-1699/1660.Correct a Binary Tree/README.md index 4a7dcc3ac87ca..c37b17a23735e 100644 --- a/solution/1600-1699/1660.Correct a Binary Tree/README.md +++ b/solution/1600-1699/1660.Correct a Binary Tree/README.md @@ -1,4 +1,4 @@ -# [1660. 纠正二叉树](https://leetcode.cn/problems/correct-a-binary-tree) +# [1660. 纠正二叉树 🔒](https://leetcode.cn/problems/correct-a-binary-tree) [English Version](/solution/1600-1699/1660.Correct%20a%20Binary%20Tree/README_EN.md) diff --git a/solution/1600-1699/1660.Correct a Binary Tree/README_EN.md b/solution/1600-1699/1660.Correct a Binary Tree/README_EN.md index 5db74d7d7b0e0..df0ea41111545 100644 --- a/solution/1600-1699/1660.Correct a Binary Tree/README_EN.md +++ b/solution/1600-1699/1660.Correct a Binary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [1660. Correct a Binary Tree](https://leetcode.com/problems/correct-a-binary-tree) +# [1660. Correct a Binary Tree 🔒](https://leetcode.com/problems/correct-a-binary-tree) [中文文档](/solution/1600-1699/1660.Correct%20a%20Binary%20Tree/README.md) diff --git a/solution/1600-1699/1666.Change the Root of a Binary Tree/README.md b/solution/1600-1699/1666.Change the Root of a Binary Tree/README.md index 4c667cdc0e189..fb96bf852520a 100644 --- a/solution/1600-1699/1666.Change the Root of a Binary Tree/README.md +++ b/solution/1600-1699/1666.Change the Root of a Binary Tree/README.md @@ -1,4 +1,4 @@ -# [1666. 改变二叉树的根节点](https://leetcode.cn/problems/change-the-root-of-a-binary-tree) +# [1666. 改变二叉树的根节点 🔒](https://leetcode.cn/problems/change-the-root-of-a-binary-tree) [English Version](/solution/1600-1699/1666.Change%20the%20Root%20of%20a%20Binary%20Tree/README_EN.md) diff --git a/solution/1600-1699/1666.Change the Root of a Binary Tree/README_EN.md b/solution/1600-1699/1666.Change the Root of a Binary Tree/README_EN.md index 5e8df663b09d4..84f81727407f8 100644 --- a/solution/1600-1699/1666.Change the Root of a Binary Tree/README_EN.md +++ b/solution/1600-1699/1666.Change the Root of a Binary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [1666. Change the Root of a Binary Tree](https://leetcode.com/problems/change-the-root-of-a-binary-tree) +# [1666. Change the Root of a Binary Tree 🔒](https://leetcode.com/problems/change-the-root-of-a-binary-tree) [中文文档](/solution/1600-1699/1666.Change%20the%20Root%20of%20a%20Binary%20Tree/README.md) diff --git a/solution/1600-1699/1676.Lowest Common Ancestor of a Binary Tree IV/README.md b/solution/1600-1699/1676.Lowest Common Ancestor of a Binary Tree IV/README.md index 12113944ea9aa..395564b931e5b 100644 --- a/solution/1600-1699/1676.Lowest Common Ancestor of a Binary Tree IV/README.md +++ b/solution/1600-1699/1676.Lowest Common Ancestor of a Binary Tree IV/README.md @@ -1,4 +1,4 @@ -# [1676. 二叉树的最近公共祖先 IV](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-iv) +# [1676. 二叉树的最近公共祖先 IV 🔒](https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree-iv) [English Version](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README_EN.md) diff --git a/solution/1600-1699/1676.Lowest Common Ancestor of a Binary Tree IV/README_EN.md b/solution/1600-1699/1676.Lowest Common Ancestor of a Binary Tree IV/README_EN.md index 7822dad76aab5..4056db6615634 100644 --- a/solution/1600-1699/1676.Lowest Common Ancestor of a Binary Tree IV/README_EN.md +++ b/solution/1600-1699/1676.Lowest Common Ancestor of a Binary Tree IV/README_EN.md @@ -1,4 +1,4 @@ -# [1676. Lowest Common Ancestor of a Binary Tree IV](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv) +# [1676. Lowest Common Ancestor of a Binary Tree IV 🔒](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv) [中文文档](/solution/1600-1699/1676.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree%20IV/README.md) diff --git a/solution/1600-1699/1677.Product's Worth Over Invoices/README.md b/solution/1600-1699/1677.Product's Worth Over Invoices/README.md index 92b0cbf1126a3..2fbd1a300c847 100644 --- a/solution/1600-1699/1677.Product's Worth Over Invoices/README.md +++ b/solution/1600-1699/1677.Product's Worth Over Invoices/README.md @@ -1,4 +1,4 @@ -# [1677. 发票中的产品金额](https://leetcode.cn/problems/products-worth-over-invoices) +# [1677. 发票中的产品金额 🔒](https://leetcode.cn/problems/products-worth-over-invoices) [English Version](/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README_EN.md) diff --git a/solution/1600-1699/1677.Product's Worth Over Invoices/README_EN.md b/solution/1600-1699/1677.Product's Worth Over Invoices/README_EN.md index e0a2c76f51fce..ba036ac3c3438 100644 --- a/solution/1600-1699/1677.Product's Worth Over Invoices/README_EN.md +++ b/solution/1600-1699/1677.Product's Worth Over Invoices/README_EN.md @@ -1,4 +1,4 @@ -# [1677. Product's Worth Over Invoices](https://leetcode.com/problems/products-worth-over-invoices) +# [1677. Product's Worth Over Invoices 🔒](https://leetcode.com/problems/products-worth-over-invoices) [中文文档](/solution/1600-1699/1677.Product%27s%20Worth%20Over%20Invoices/README.md) diff --git a/solution/1600-1699/1682.Longest Palindromic Subsequence II/README.md b/solution/1600-1699/1682.Longest Palindromic Subsequence II/README.md index 17698be42a670..ee6a5595b77bd 100644 --- a/solution/1600-1699/1682.Longest Palindromic Subsequence II/README.md +++ b/solution/1600-1699/1682.Longest Palindromic Subsequence II/README.md @@ -1,4 +1,4 @@ -# [1682. 最长回文子序列 II](https://leetcode.cn/problems/longest-palindromic-subsequence-ii) +# [1682. 最长回文子序列 II 🔒](https://leetcode.cn/problems/longest-palindromic-subsequence-ii) [English Version](/solution/1600-1699/1682.Longest%20Palindromic%20Subsequence%20II/README_EN.md) diff --git a/solution/1600-1699/1682.Longest Palindromic Subsequence II/README_EN.md b/solution/1600-1699/1682.Longest Palindromic Subsequence II/README_EN.md index fd7e315b04b33..6734d486f5e22 100644 --- a/solution/1600-1699/1682.Longest Palindromic Subsequence II/README_EN.md +++ b/solution/1600-1699/1682.Longest Palindromic Subsequence II/README_EN.md @@ -1,4 +1,4 @@ -# [1682. Longest Palindromic Subsequence II](https://leetcode.com/problems/longest-palindromic-subsequence-ii) +# [1682. Longest Palindromic Subsequence II 🔒](https://leetcode.com/problems/longest-palindromic-subsequence-ii) [中文文档](/solution/1600-1699/1682.Longest%20Palindromic%20Subsequence%20II/README.md) diff --git a/solution/1600-1699/1692.Count Ways to Distribute Candies/README.md b/solution/1600-1699/1692.Count Ways to Distribute Candies/README.md index a4e0c7dabd1c1..32efcb2611c58 100644 --- a/solution/1600-1699/1692.Count Ways to Distribute Candies/README.md +++ b/solution/1600-1699/1692.Count Ways to Distribute Candies/README.md @@ -1,4 +1,4 @@ -# [1692. 计算分配糖果的不同方式](https://leetcode.cn/problems/count-ways-to-distribute-candies) +# [1692. 计算分配糖果的不同方式 🔒](https://leetcode.cn/problems/count-ways-to-distribute-candies) [English Version](/solution/1600-1699/1692.Count%20Ways%20to%20Distribute%20Candies/README_EN.md) diff --git a/solution/1600-1699/1692.Count Ways to Distribute Candies/README_EN.md b/solution/1600-1699/1692.Count Ways to Distribute Candies/README_EN.md index 1d07961a80130..2fba2f0307b88 100644 --- a/solution/1600-1699/1692.Count Ways to Distribute Candies/README_EN.md +++ b/solution/1600-1699/1692.Count Ways to Distribute Candies/README_EN.md @@ -1,4 +1,4 @@ -# [1692. Count Ways to Distribute Candies](https://leetcode.com/problems/count-ways-to-distribute-candies) +# [1692. Count Ways to Distribute Candies 🔒](https://leetcode.com/problems/count-ways-to-distribute-candies) [中文文档](/solution/1600-1699/1692.Count%20Ways%20to%20Distribute%20Candies/README.md) diff --git a/solution/1600-1699/1698.Number of Distinct Substrings in a String/README.md b/solution/1600-1699/1698.Number of Distinct Substrings in a String/README.md index f9ea6546de65d..614296b3716e3 100644 --- a/solution/1600-1699/1698.Number of Distinct Substrings in a String/README.md +++ b/solution/1600-1699/1698.Number of Distinct Substrings in a String/README.md @@ -1,4 +1,4 @@ -# [1698. 字符串的不同子字符串个数](https://leetcode.cn/problems/number-of-distinct-substrings-in-a-string) +# [1698. 字符串的不同子字符串个数 🔒](https://leetcode.cn/problems/number-of-distinct-substrings-in-a-string) [English Version](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README_EN.md) diff --git a/solution/1600-1699/1698.Number of Distinct Substrings in a String/README_EN.md b/solution/1600-1699/1698.Number of Distinct Substrings in a String/README_EN.md index 4950381856f7d..3cfcfa2a42e7a 100644 --- a/solution/1600-1699/1698.Number of Distinct Substrings in a String/README_EN.md +++ b/solution/1600-1699/1698.Number of Distinct Substrings in a String/README_EN.md @@ -1,4 +1,4 @@ -# [1698. Number of Distinct Substrings in a String](https://leetcode.com/problems/number-of-distinct-substrings-in-a-string) +# [1698. Number of Distinct Substrings in a String 🔒](https://leetcode.com/problems/number-of-distinct-substrings-in-a-string) [中文文档](/solution/1600-1699/1698.Number%20of%20Distinct%20Substrings%20in%20a%20String/README.md) diff --git a/solution/1600-1699/1699.Number of Calls Between Two Persons/README.md b/solution/1600-1699/1699.Number of Calls Between Two Persons/README.md index f2beae587188e..72128884f392e 100644 --- a/solution/1600-1699/1699.Number of Calls Between Two Persons/README.md +++ b/solution/1600-1699/1699.Number of Calls Between Two Persons/README.md @@ -1,4 +1,4 @@ -# [1699. 两人之间的通话次数](https://leetcode.cn/problems/number-of-calls-between-two-persons) +# [1699. 两人之间的通话次数 🔒](https://leetcode.cn/problems/number-of-calls-between-two-persons) [English Version](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README_EN.md) diff --git a/solution/1600-1699/1699.Number of Calls Between Two Persons/README_EN.md b/solution/1600-1699/1699.Number of Calls Between Two Persons/README_EN.md index 22f087ce34aba..49edbdcefbc15 100644 --- a/solution/1600-1699/1699.Number of Calls Between Two Persons/README_EN.md +++ b/solution/1600-1699/1699.Number of Calls Between Two Persons/README_EN.md @@ -1,4 +1,4 @@ -# [1699. Number of Calls Between Two Persons](https://leetcode.com/problems/number-of-calls-between-two-persons) +# [1699. Number of Calls Between Two Persons 🔒](https://leetcode.com/problems/number-of-calls-between-two-persons) [中文文档](/solution/1600-1699/1699.Number%20of%20Calls%20Between%20Two%20Persons/README.md) diff --git a/solution/1700-1799/1708.Largest Subarray Length K/README.md b/solution/1700-1799/1708.Largest Subarray Length K/README.md index e0ba3334dc7ec..7c14fc72083c4 100644 --- a/solution/1700-1799/1708.Largest Subarray Length K/README.md +++ b/solution/1700-1799/1708.Largest Subarray Length K/README.md @@ -1,4 +1,4 @@ -# [1708. 长度为 K 的最大子数组](https://leetcode.cn/problems/largest-subarray-length-k) +# [1708. 长度为 K 的最大子数组 🔒](https://leetcode.cn/problems/largest-subarray-length-k) [English Version](/solution/1700-1799/1708.Largest%20Subarray%20Length%20K/README_EN.md) diff --git a/solution/1700-1799/1708.Largest Subarray Length K/README_EN.md b/solution/1700-1799/1708.Largest Subarray Length K/README_EN.md index 7f18643679a2f..38478c645239a 100644 --- a/solution/1700-1799/1708.Largest Subarray Length K/README_EN.md +++ b/solution/1700-1799/1708.Largest Subarray Length K/README_EN.md @@ -1,4 +1,4 @@ -# [1708. Largest Subarray Length K](https://leetcode.com/problems/largest-subarray-length-k) +# [1708. Largest Subarray Length K 🔒](https://leetcode.com/problems/largest-subarray-length-k) [中文文档](/solution/1700-1799/1708.Largest%20Subarray%20Length%20K/README.md) diff --git a/solution/1700-1799/1709.Biggest Window Between Visits/README.md b/solution/1700-1799/1709.Biggest Window Between Visits/README.md index 2b1ee425aac42..b3c8c3b7ac386 100644 --- a/solution/1700-1799/1709.Biggest Window Between Visits/README.md +++ b/solution/1700-1799/1709.Biggest Window Between Visits/README.md @@ -1,4 +1,4 @@ -# [1709. 访问日期之间最大的空档期](https://leetcode.cn/problems/biggest-window-between-visits) +# [1709. 访问日期之间最大的空档期 🔒](https://leetcode.cn/problems/biggest-window-between-visits) [English Version](/solution/1700-1799/1709.Biggest%20Window%20Between%20Visits/README_EN.md) diff --git a/solution/1700-1799/1709.Biggest Window Between Visits/README_EN.md b/solution/1700-1799/1709.Biggest Window Between Visits/README_EN.md index 2dc8cd801d244..7dd81a25b96f9 100644 --- a/solution/1700-1799/1709.Biggest Window Between Visits/README_EN.md +++ b/solution/1700-1799/1709.Biggest Window Between Visits/README_EN.md @@ -1,4 +1,4 @@ -# [1709. Biggest Window Between Visits](https://leetcode.com/problems/biggest-window-between-visits) +# [1709. Biggest Window Between Visits 🔒](https://leetcode.com/problems/biggest-window-between-visits) [中文文档](/solution/1700-1799/1709.Biggest%20Window%20Between%20Visits/README.md) diff --git a/solution/1700-1799/1714.Sum Of Special Evenly-Spaced Elements In Array/README.md b/solution/1700-1799/1714.Sum Of Special Evenly-Spaced Elements In Array/README.md index 6443fa2240e5f..b66a48f154e38 100644 --- a/solution/1700-1799/1714.Sum Of Special Evenly-Spaced Elements In Array/README.md +++ b/solution/1700-1799/1714.Sum Of Special Evenly-Spaced Elements In Array/README.md @@ -1,4 +1,4 @@ -# [1714. 数组中特殊等间距元素的和](https://leetcode.cn/problems/sum-of-special-evenly-spaced-elements-in-array) +# [1714. 数组中特殊等间距元素的和 🔒](https://leetcode.cn/problems/sum-of-special-evenly-spaced-elements-in-array) [English Version](/solution/1700-1799/1714.Sum%20Of%20Special%20Evenly-Spaced%20Elements%20In%20Array/README_EN.md) diff --git a/solution/1700-1799/1714.Sum Of Special Evenly-Spaced Elements In Array/README_EN.md b/solution/1700-1799/1714.Sum Of Special Evenly-Spaced Elements In Array/README_EN.md index c16b3e31ae53b..75c81f95e6b69 100644 --- a/solution/1700-1799/1714.Sum Of Special Evenly-Spaced Elements In Array/README_EN.md +++ b/solution/1700-1799/1714.Sum Of Special Evenly-Spaced Elements In Array/README_EN.md @@ -1,4 +1,4 @@ -# [1714. Sum Of Special Evenly-Spaced Elements In Array](https://leetcode.com/problems/sum-of-special-evenly-spaced-elements-in-array) +# [1714. Sum Of Special Evenly-Spaced Elements In Array 🔒](https://leetcode.com/problems/sum-of-special-evenly-spaced-elements-in-array) [中文文档](/solution/1700-1799/1714.Sum%20Of%20Special%20Evenly-Spaced%20Elements%20In%20Array/README.md) diff --git a/solution/1700-1799/1715.Count Apples and Oranges/README.md b/solution/1700-1799/1715.Count Apples and Oranges/README.md index 70f3bb77ea3d6..07b37b061b108 100644 --- a/solution/1700-1799/1715.Count Apples and Oranges/README.md +++ b/solution/1700-1799/1715.Count Apples and Oranges/README.md @@ -1,4 +1,4 @@ -# [1715. 苹果和橘子的个数](https://leetcode.cn/problems/count-apples-and-oranges) +# [1715. 苹果和橘子的个数 🔒](https://leetcode.cn/problems/count-apples-and-oranges) [English Version](/solution/1700-1799/1715.Count%20Apples%20and%20Oranges/README_EN.md) diff --git a/solution/1700-1799/1715.Count Apples and Oranges/README_EN.md b/solution/1700-1799/1715.Count Apples and Oranges/README_EN.md index 65f3fdc99b49a..792180d946447 100644 --- a/solution/1700-1799/1715.Count Apples and Oranges/README_EN.md +++ b/solution/1700-1799/1715.Count Apples and Oranges/README_EN.md @@ -1,4 +1,4 @@ -# [1715. Count Apples and Oranges](https://leetcode.com/problems/count-apples-and-oranges) +# [1715. Count Apples and Oranges 🔒](https://leetcode.com/problems/count-apples-and-oranges) [中文文档](/solution/1700-1799/1715.Count%20Apples%20and%20Oranges/README.md) diff --git a/solution/1700-1799/1724.Checking Existence of Edge Length Limited Paths II/README.md b/solution/1700-1799/1724.Checking Existence of Edge Length Limited Paths II/README.md index c105831d3006a..69027424cacdd 100644 --- a/solution/1700-1799/1724.Checking Existence of Edge Length Limited Paths II/README.md +++ b/solution/1700-1799/1724.Checking Existence of Edge Length Limited Paths II/README.md @@ -1,4 +1,4 @@ -# [1724. 检查边长度限制的路径是否存在 II](https://leetcode.cn/problems/checking-existence-of-edge-length-limited-paths-ii) +# [1724. 检查边长度限制的路径是否存在 II 🔒](https://leetcode.cn/problems/checking-existence-of-edge-length-limited-paths-ii) [English Version](/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/README_EN.md) diff --git a/solution/1700-1799/1724.Checking Existence of Edge Length Limited Paths II/README_EN.md b/solution/1700-1799/1724.Checking Existence of Edge Length Limited Paths II/README_EN.md index b07b804c67573..bafd150561b49 100644 --- a/solution/1700-1799/1724.Checking Existence of Edge Length Limited Paths II/README_EN.md +++ b/solution/1700-1799/1724.Checking Existence of Edge Length Limited Paths II/README_EN.md @@ -1,4 +1,4 @@ -# [1724. Checking Existence of Edge Length Limited Paths II](https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths-ii) +# [1724. Checking Existence of Edge Length Limited Paths II 🔒](https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths-ii) [中文文档](/solution/1700-1799/1724.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths%20II/README.md) diff --git a/solution/1700-1799/1730.Shortest Path to Get Food/README.md b/solution/1700-1799/1730.Shortest Path to Get Food/README.md index f1ecc65d98a5d..ba17b356b4a6f 100644 --- a/solution/1700-1799/1730.Shortest Path to Get Food/README.md +++ b/solution/1700-1799/1730.Shortest Path to Get Food/README.md @@ -1,4 +1,4 @@ -# [1730. 获取食物的最短路径](https://leetcode.cn/problems/shortest-path-to-get-food) +# [1730. 获取食物的最短路径 🔒](https://leetcode.cn/problems/shortest-path-to-get-food) [English Version](/solution/1700-1799/1730.Shortest%20Path%20to%20Get%20Food/README_EN.md) diff --git a/solution/1700-1799/1730.Shortest Path to Get Food/README_EN.md b/solution/1700-1799/1730.Shortest Path to Get Food/README_EN.md index 1e21a5ea3bced..43346fa3b0a6e 100644 --- a/solution/1700-1799/1730.Shortest Path to Get Food/README_EN.md +++ b/solution/1700-1799/1730.Shortest Path to Get Food/README_EN.md @@ -1,4 +1,4 @@ -# [1730. Shortest Path to Get Food](https://leetcode.com/problems/shortest-path-to-get-food) +# [1730. Shortest Path to Get Food 🔒](https://leetcode.com/problems/shortest-path-to-get-food) [中文文档](/solution/1700-1799/1730.Shortest%20Path%20to%20Get%20Food/README.md) diff --git a/solution/1700-1799/1740.Find Distance in a Binary Tree/README.md b/solution/1700-1799/1740.Find Distance in a Binary Tree/README.md index 7371594d049fe..1ac823749997d 100644 --- a/solution/1700-1799/1740.Find Distance in a Binary Tree/README.md +++ b/solution/1700-1799/1740.Find Distance in a Binary Tree/README.md @@ -1,4 +1,4 @@ -# [1740. 找到二叉树中的距离](https://leetcode.cn/problems/find-distance-in-a-binary-tree) +# [1740. 找到二叉树中的距离 🔒](https://leetcode.cn/problems/find-distance-in-a-binary-tree) [English Version](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README_EN.md) diff --git a/solution/1700-1799/1740.Find Distance in a Binary Tree/README_EN.md b/solution/1700-1799/1740.Find Distance in a Binary Tree/README_EN.md index 694a6fbdddc03..f2b85bb47bb36 100644 --- a/solution/1700-1799/1740.Find Distance in a Binary Tree/README_EN.md +++ b/solution/1700-1799/1740.Find Distance in a Binary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [1740. Find Distance in a Binary Tree](https://leetcode.com/problems/find-distance-in-a-binary-tree) +# [1740. Find Distance in a Binary Tree 🔒](https://leetcode.com/problems/find-distance-in-a-binary-tree) [中文文档](/solution/1700-1799/1740.Find%20Distance%20in%20a%20Binary%20Tree/README.md) diff --git a/solution/1700-1799/1746.Maximum Subarray Sum After One Operation/README.md b/solution/1700-1799/1746.Maximum Subarray Sum After One Operation/README.md index 6d1916b96edad..8e65a07c02b97 100644 --- a/solution/1700-1799/1746.Maximum Subarray Sum After One Operation/README.md +++ b/solution/1700-1799/1746.Maximum Subarray Sum After One Operation/README.md @@ -1,4 +1,4 @@ -# [1746. 经过一次操作后的最大子数组和](https://leetcode.cn/problems/maximum-subarray-sum-after-one-operation) +# [1746. 经过一次操作后的最大子数组和 🔒](https://leetcode.cn/problems/maximum-subarray-sum-after-one-operation) [English Version](/solution/1700-1799/1746.Maximum%20Subarray%20Sum%20After%20One%20Operation/README_EN.md) diff --git a/solution/1700-1799/1746.Maximum Subarray Sum After One Operation/README_EN.md b/solution/1700-1799/1746.Maximum Subarray Sum After One Operation/README_EN.md index ac83ce055c496..6d4f60002ad1b 100644 --- a/solution/1700-1799/1746.Maximum Subarray Sum After One Operation/README_EN.md +++ b/solution/1700-1799/1746.Maximum Subarray Sum After One Operation/README_EN.md @@ -1,4 +1,4 @@ -# [1746. Maximum Subarray Sum After One Operation](https://leetcode.com/problems/maximum-subarray-sum-after-one-operation) +# [1746. Maximum Subarray Sum After One Operation 🔒](https://leetcode.com/problems/maximum-subarray-sum-after-one-operation) [中文文档](/solution/1700-1799/1746.Maximum%20Subarray%20Sum%20After%20One%20Operation/README.md) diff --git a/solution/1700-1799/1747.Leetflex Banned Accounts/README.md b/solution/1700-1799/1747.Leetflex Banned Accounts/README.md index e4dd6a14332c1..80df45270767c 100644 --- a/solution/1700-1799/1747.Leetflex Banned Accounts/README.md +++ b/solution/1700-1799/1747.Leetflex Banned Accounts/README.md @@ -1,4 +1,4 @@ -# [1747. 应该被禁止的 Leetflex 账户](https://leetcode.cn/problems/leetflex-banned-accounts) +# [1747. 应该被禁止的 Leetflex 账户 🔒](https://leetcode.cn/problems/leetflex-banned-accounts) [English Version](/solution/1700-1799/1747.Leetflex%20Banned%20Accounts/README_EN.md) diff --git a/solution/1700-1799/1747.Leetflex Banned Accounts/README_EN.md b/solution/1700-1799/1747.Leetflex Banned Accounts/README_EN.md index 06464c2a90964..d7cbbcb7df1ed 100644 --- a/solution/1700-1799/1747.Leetflex Banned Accounts/README_EN.md +++ b/solution/1700-1799/1747.Leetflex Banned Accounts/README_EN.md @@ -1,4 +1,4 @@ -# [1747. Leetflex Banned Accounts](https://leetcode.com/problems/leetflex-banned-accounts) +# [1747. Leetflex Banned Accounts 🔒](https://leetcode.com/problems/leetflex-banned-accounts) [中文文档](/solution/1700-1799/1747.Leetflex%20Banned%20Accounts/README.md) diff --git a/solution/1700-1799/1756.Design Most Recently Used Queue/README.md b/solution/1700-1799/1756.Design Most Recently Used Queue/README.md index 739606de5c9b3..08353ec2df9ac 100644 --- a/solution/1700-1799/1756.Design Most Recently Used Queue/README.md +++ b/solution/1700-1799/1756.Design Most Recently Used Queue/README.md @@ -1,4 +1,4 @@ -# [1756. 设计最近使用（MRU）队列](https://leetcode.cn/problems/design-most-recently-used-queue) +# [1756. 设计最近使用（MRU）队列 🔒](https://leetcode.cn/problems/design-most-recently-used-queue) [English Version](/solution/1700-1799/1756.Design%20Most%20Recently%20Used%20Queue/README_EN.md) diff --git a/solution/1700-1799/1756.Design Most Recently Used Queue/README_EN.md b/solution/1700-1799/1756.Design Most Recently Used Queue/README_EN.md index 0499285a5d6f7..5018455442e8c 100644 --- a/solution/1700-1799/1756.Design Most Recently Used Queue/README_EN.md +++ b/solution/1700-1799/1756.Design Most Recently Used Queue/README_EN.md @@ -1,4 +1,4 @@ -# [1756. Design Most Recently Used Queue](https://leetcode.com/problems/design-most-recently-used-queue) +# [1756. Design Most Recently Used Queue 🔒](https://leetcode.com/problems/design-most-recently-used-queue) [中文文档](/solution/1700-1799/1756.Design%20Most%20Recently%20Used%20Queue/README.md) diff --git a/solution/1700-1799/1762.Buildings With an Ocean View/README.md b/solution/1700-1799/1762.Buildings With an Ocean View/README.md index a9aa1fd6d6e37..f38a6724d38de 100644 --- a/solution/1700-1799/1762.Buildings With an Ocean View/README.md +++ b/solution/1700-1799/1762.Buildings With an Ocean View/README.md @@ -1,4 +1,4 @@ -# [1762. 能看到海景的建筑物](https://leetcode.cn/problems/buildings-with-an-ocean-view) +# [1762. 能看到海景的建筑物 🔒](https://leetcode.cn/problems/buildings-with-an-ocean-view) [English Version](/solution/1700-1799/1762.Buildings%20With%20an%20Ocean%20View/README_EN.md) diff --git a/solution/1700-1799/1762.Buildings With an Ocean View/README_EN.md b/solution/1700-1799/1762.Buildings With an Ocean View/README_EN.md index 38272f2d33779..b4e304d62b018 100644 --- a/solution/1700-1799/1762.Buildings With an Ocean View/README_EN.md +++ b/solution/1700-1799/1762.Buildings With an Ocean View/README_EN.md @@ -1,4 +1,4 @@ -# [1762. Buildings With an Ocean View](https://leetcode.com/problems/buildings-with-an-ocean-view) +# [1762. Buildings With an Ocean View 🔒](https://leetcode.com/problems/buildings-with-an-ocean-view) [中文文档](/solution/1700-1799/1762.Buildings%20With%20an%20Ocean%20View/README.md) diff --git a/solution/1700-1799/1767.Find the Subtasks That Did Not Execute/README.md b/solution/1700-1799/1767.Find the Subtasks That Did Not Execute/README.md index 0fdb6df8aad58..eaf354955bfcf 100644 --- a/solution/1700-1799/1767.Find the Subtasks That Did Not Execute/README.md +++ b/solution/1700-1799/1767.Find the Subtasks That Did Not Execute/README.md @@ -1,4 +1,4 @@ -# [1767. 寻找没有被执行的任务对](https://leetcode.cn/problems/find-the-subtasks-that-did-not-execute) +# [1767. 寻找没有被执行的任务对 🔒](https://leetcode.cn/problems/find-the-subtasks-that-did-not-execute) [English Version](/solution/1700-1799/1767.Find%20the%20Subtasks%20That%20Did%20Not%20Execute/README_EN.md) diff --git a/solution/1700-1799/1767.Find the Subtasks That Did Not Execute/README_EN.md b/solution/1700-1799/1767.Find the Subtasks That Did Not Execute/README_EN.md index bafce7554c34d..a668ef59c6ea6 100644 --- a/solution/1700-1799/1767.Find the Subtasks That Did Not Execute/README_EN.md +++ b/solution/1700-1799/1767.Find the Subtasks That Did Not Execute/README_EN.md @@ -1,4 +1,4 @@ -# [1767. Find the Subtasks That Did Not Execute](https://leetcode.com/problems/find-the-subtasks-that-did-not-execute) +# [1767. Find the Subtasks That Did Not Execute 🔒](https://leetcode.com/problems/find-the-subtasks-that-did-not-execute) [中文文档](/solution/1700-1799/1767.Find%20the%20Subtasks%20That%20Did%20Not%20Execute/README.md) diff --git a/solution/1700-1799/1772.Sort Features by Popularity/README.md b/solution/1700-1799/1772.Sort Features by Popularity/README.md index 9c6b582ecc405..c49a4b6470251 100644 --- a/solution/1700-1799/1772.Sort Features by Popularity/README.md +++ b/solution/1700-1799/1772.Sort Features by Popularity/README.md @@ -1,4 +1,4 @@ -# [1772. 按受欢迎程度排列功能](https://leetcode.cn/problems/sort-features-by-popularity) +# [1772. 按受欢迎程度排列功能 🔒](https://leetcode.cn/problems/sort-features-by-popularity) [English Version](/solution/1700-1799/1772.Sort%20Features%20by%20Popularity/README_EN.md) diff --git a/solution/1700-1799/1772.Sort Features by Popularity/README_EN.md b/solution/1700-1799/1772.Sort Features by Popularity/README_EN.md index 15b549b479188..207e2be706908 100644 --- a/solution/1700-1799/1772.Sort Features by Popularity/README_EN.md +++ b/solution/1700-1799/1772.Sort Features by Popularity/README_EN.md @@ -1,4 +1,4 @@ -# [1772. Sort Features by Popularity](https://leetcode.com/problems/sort-features-by-popularity) +# [1772. Sort Features by Popularity 🔒](https://leetcode.com/problems/sort-features-by-popularity) [中文文档](/solution/1700-1799/1772.Sort%20Features%20by%20Popularity/README.md) diff --git a/solution/1700-1799/1777.Product's Price for Each Store/README.md b/solution/1700-1799/1777.Product's Price for Each Store/README.md index e0f9ffa1509b1..c463a2ffae031 100644 --- a/solution/1700-1799/1777.Product's Price for Each Store/README.md +++ b/solution/1700-1799/1777.Product's Price for Each Store/README.md @@ -1,4 +1,4 @@ -# [1777. 每家商店的产品价格](https://leetcode.cn/problems/products-price-for-each-store) +# [1777. 每家商店的产品价格 🔒](https://leetcode.cn/problems/products-price-for-each-store) [English Version](/solution/1700-1799/1777.Product%27s%20Price%20for%20Each%20Store/README_EN.md) diff --git a/solution/1700-1799/1777.Product's Price for Each Store/README_EN.md b/solution/1700-1799/1777.Product's Price for Each Store/README_EN.md index 4661a7f14065d..eb73ef4cf6f7e 100644 --- a/solution/1700-1799/1777.Product's Price for Each Store/README_EN.md +++ b/solution/1700-1799/1777.Product's Price for Each Store/README_EN.md @@ -1,4 +1,4 @@ -# [1777. Product's Price for Each Store](https://leetcode.com/problems/products-price-for-each-store) +# [1777. Product's Price for Each Store 🔒](https://leetcode.com/problems/products-price-for-each-store) [中文文档](/solution/1700-1799/1777.Product%27s%20Price%20for%20Each%20Store/README.md) diff --git a/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README.md b/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README.md index d40e596bfe500..cb71bcd0fb0a9 100644 --- a/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README.md +++ b/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README.md @@ -1,4 +1,4 @@ -# [1778. 未知网格中的最短路径](https://leetcode.cn/problems/shortest-path-in-a-hidden-grid) +# [1778. 未知网格中的最短路径 🔒](https://leetcode.cn/problems/shortest-path-in-a-hidden-grid) [English Version](/solution/1700-1799/1778.Shortest%20Path%20in%20a%20Hidden%20Grid/README_EN.md) diff --git a/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README_EN.md b/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README_EN.md index 69c8f25d5321e..d5f48333d3ed9 100644 --- a/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README_EN.md +++ b/solution/1700-1799/1778.Shortest Path in a Hidden Grid/README_EN.md @@ -1,4 +1,4 @@ -# [1778. Shortest Path in a Hidden Grid](https://leetcode.com/problems/shortest-path-in-a-hidden-grid) +# [1778. Shortest Path in a Hidden Grid 🔒](https://leetcode.com/problems/shortest-path-in-a-hidden-grid) [中文文档](/solution/1700-1799/1778.Shortest%20Path%20in%20a%20Hidden%20Grid/README.md) diff --git a/solution/1700-1799/1783.Grand Slam Titles/README.md b/solution/1700-1799/1783.Grand Slam Titles/README.md index 999015cd9c0ce..c80e18cf31058 100644 --- a/solution/1700-1799/1783.Grand Slam Titles/README.md +++ b/solution/1700-1799/1783.Grand Slam Titles/README.md @@ -1,4 +1,4 @@ -# [1783. 大满贯数量](https://leetcode.cn/problems/grand-slam-titles) +# [1783. 大满贯数量 🔒](https://leetcode.cn/problems/grand-slam-titles) [English Version](/solution/1700-1799/1783.Grand%20Slam%20Titles/README_EN.md) diff --git a/solution/1700-1799/1783.Grand Slam Titles/README_EN.md b/solution/1700-1799/1783.Grand Slam Titles/README_EN.md index 8ffc97946b730..3cd06ccf37444 100644 --- a/solution/1700-1799/1783.Grand Slam Titles/README_EN.md +++ b/solution/1700-1799/1783.Grand Slam Titles/README_EN.md @@ -1,4 +1,4 @@ -# [1783. Grand Slam Titles](https://leetcode.com/problems/grand-slam-titles) +# [1783. Grand Slam Titles 🔒](https://leetcode.com/problems/grand-slam-titles) [中文文档](/solution/1700-1799/1783.Grand%20Slam%20Titles/README.md) diff --git a/solution/1700-1799/1788.Maximize the Beauty of the Garden/README.md b/solution/1700-1799/1788.Maximize the Beauty of the Garden/README.md index 314cbdcfa23a8..3faf590a11a09 100644 --- a/solution/1700-1799/1788.Maximize the Beauty of the Garden/README.md +++ b/solution/1700-1799/1788.Maximize the Beauty of the Garden/README.md @@ -1,4 +1,4 @@ -# [1788. 最大化花园的美观度](https://leetcode.cn/problems/maximize-the-beauty-of-the-garden) +# [1788. 最大化花园的美观度 🔒](https://leetcode.cn/problems/maximize-the-beauty-of-the-garden) [English Version](/solution/1700-1799/1788.Maximize%20the%20Beauty%20of%20the%20Garden/README_EN.md) diff --git a/solution/1700-1799/1788.Maximize the Beauty of the Garden/README_EN.md b/solution/1700-1799/1788.Maximize the Beauty of the Garden/README_EN.md index 74287712bf274..708ffa695faa6 100644 --- a/solution/1700-1799/1788.Maximize the Beauty of the Garden/README_EN.md +++ b/solution/1700-1799/1788.Maximize the Beauty of the Garden/README_EN.md @@ -1,4 +1,4 @@ -# [1788. Maximize the Beauty of the Garden](https://leetcode.com/problems/maximize-the-beauty-of-the-garden) +# [1788. Maximize the Beauty of the Garden 🔒](https://leetcode.com/problems/maximize-the-beauty-of-the-garden) [中文文档](/solution/1700-1799/1788.Maximize%20the%20Beauty%20of%20the%20Garden/README.md) diff --git a/solution/1700-1799/1794.Count Pairs of Equal Substrings With Minimum Difference/README.md b/solution/1700-1799/1794.Count Pairs of Equal Substrings With Minimum Difference/README.md index c6adc1f9f0a7b..1d6e4818a3e6a 100644 --- a/solution/1700-1799/1794.Count Pairs of Equal Substrings With Minimum Difference/README.md +++ b/solution/1700-1799/1794.Count Pairs of Equal Substrings With Minimum Difference/README.md @@ -1,4 +1,4 @@ -# [1794. 统计距离最小的子串对个数](https://leetcode.cn/problems/count-pairs-of-equal-substrings-with-minimum-difference) +# [1794. 统计距离最小的子串对个数 🔒](https://leetcode.cn/problems/count-pairs-of-equal-substrings-with-minimum-difference) [English Version](/solution/1700-1799/1794.Count%20Pairs%20of%20Equal%20Substrings%20With%20Minimum%20Difference/README_EN.md) diff --git a/solution/1700-1799/1794.Count Pairs of Equal Substrings With Minimum Difference/README_EN.md b/solution/1700-1799/1794.Count Pairs of Equal Substrings With Minimum Difference/README_EN.md index c86c509d565e2..82f19bf583b4c 100644 --- a/solution/1700-1799/1794.Count Pairs of Equal Substrings With Minimum Difference/README_EN.md +++ b/solution/1700-1799/1794.Count Pairs of Equal Substrings With Minimum Difference/README_EN.md @@ -1,4 +1,4 @@ -# [1794. Count Pairs of Equal Substrings With Minimum Difference](https://leetcode.com/problems/count-pairs-of-equal-substrings-with-minimum-difference) +# [1794. Count Pairs of Equal Substrings With Minimum Difference 🔒](https://leetcode.com/problems/count-pairs-of-equal-substrings-with-minimum-difference) [中文文档](/solution/1700-1799/1794.Count%20Pairs%20of%20Equal%20Substrings%20With%20Minimum%20Difference/README.md) diff --git a/solution/1800-1899/1804.Implement Trie II (Prefix Tree)/README.md b/solution/1800-1899/1804.Implement Trie II (Prefix Tree)/README.md index 7ced49b110317..d6fe8ee13f68d 100644 --- a/solution/1800-1899/1804.Implement Trie II (Prefix Tree)/README.md +++ b/solution/1800-1899/1804.Implement Trie II (Prefix Tree)/README.md @@ -1,4 +1,4 @@ -# [1804. 实现 Trie （前缀树） II](https://leetcode.cn/problems/implement-trie-ii-prefix-tree) +# [1804. 实现 Trie （前缀树） II 🔒](https://leetcode.cn/problems/implement-trie-ii-prefix-tree) [English Version](/solution/1800-1899/1804.Implement%20Trie%20II%20%28Prefix%20Tree%29/README_EN.md) diff --git a/solution/1800-1899/1804.Implement Trie II (Prefix Tree)/README_EN.md b/solution/1800-1899/1804.Implement Trie II (Prefix Tree)/README_EN.md index e0813900e849b..6d6167ede7849 100644 --- a/solution/1800-1899/1804.Implement Trie II (Prefix Tree)/README_EN.md +++ b/solution/1800-1899/1804.Implement Trie II (Prefix Tree)/README_EN.md @@ -1,4 +1,4 @@ -# [1804. Implement Trie II (Prefix Tree)](https://leetcode.com/problems/implement-trie-ii-prefix-tree) +# [1804. Implement Trie II (Prefix Tree) 🔒](https://leetcode.com/problems/implement-trie-ii-prefix-tree) [中文文档](/solution/1800-1899/1804.Implement%20Trie%20II%20%28Prefix%20Tree%29/README.md) diff --git a/solution/1800-1899/1809.Ad-Free Sessions/README.md b/solution/1800-1899/1809.Ad-Free Sessions/README.md index 6f710ff3ac629..e9251a30bc550 100644 --- a/solution/1800-1899/1809.Ad-Free Sessions/README.md +++ b/solution/1800-1899/1809.Ad-Free Sessions/README.md @@ -1,4 +1,4 @@ -# [1809. 没有广告的剧集](https://leetcode.cn/problems/ad-free-sessions) +# [1809. 没有广告的剧集 🔒](https://leetcode.cn/problems/ad-free-sessions) [English Version](/solution/1800-1899/1809.Ad-Free%20Sessions/README_EN.md) diff --git a/solution/1800-1899/1809.Ad-Free Sessions/README_EN.md b/solution/1800-1899/1809.Ad-Free Sessions/README_EN.md index 58f203e049bf3..4e7448855bc00 100644 --- a/solution/1800-1899/1809.Ad-Free Sessions/README_EN.md +++ b/solution/1800-1899/1809.Ad-Free Sessions/README_EN.md @@ -1,4 +1,4 @@ -# [1809. Ad-Free Sessions](https://leetcode.com/problems/ad-free-sessions) +# [1809. Ad-Free Sessions 🔒](https://leetcode.com/problems/ad-free-sessions) [中文文档](/solution/1800-1899/1809.Ad-Free%20Sessions/README.md) diff --git a/solution/1800-1899/1810.Minimum Path Cost in a Hidden Grid/README.md b/solution/1800-1899/1810.Minimum Path Cost in a Hidden Grid/README.md index a296e52e2289a..b1e616003559f 100644 --- a/solution/1800-1899/1810.Minimum Path Cost in a Hidden Grid/README.md +++ b/solution/1800-1899/1810.Minimum Path Cost in a Hidden Grid/README.md @@ -1,4 +1,4 @@ -# [1810. 隐藏网格下的最小消耗路径](https://leetcode.cn/problems/minimum-path-cost-in-a-hidden-grid) +# [1810. 隐藏网格下的最小消耗路径 🔒](https://leetcode.cn/problems/minimum-path-cost-in-a-hidden-grid) [English Version](/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README_EN.md) diff --git a/solution/1800-1899/1810.Minimum Path Cost in a Hidden Grid/README_EN.md b/solution/1800-1899/1810.Minimum Path Cost in a Hidden Grid/README_EN.md index 69ee42a4c5af5..c1be0d080ba23 100644 --- a/solution/1800-1899/1810.Minimum Path Cost in a Hidden Grid/README_EN.md +++ b/solution/1800-1899/1810.Minimum Path Cost in a Hidden Grid/README_EN.md @@ -1,4 +1,4 @@ -# [1810. Minimum Path Cost in a Hidden Grid](https://leetcode.com/problems/minimum-path-cost-in-a-hidden-grid) +# [1810. Minimum Path Cost in a Hidden Grid 🔒](https://leetcode.com/problems/minimum-path-cost-in-a-hidden-grid) [中文文档](/solution/1800-1899/1810.Minimum%20Path%20Cost%20in%20a%20Hidden%20Grid/README.md) diff --git a/solution/1800-1899/1811.Find Interview Candidates/README.md b/solution/1800-1899/1811.Find Interview Candidates/README.md index da5cfe2f579fb..43ed7d985f190 100644 --- a/solution/1800-1899/1811.Find Interview Candidates/README.md +++ b/solution/1800-1899/1811.Find Interview Candidates/README.md @@ -1,4 +1,4 @@ -# [1811. 寻找面试候选人](https://leetcode.cn/problems/find-interview-candidates) +# [1811. 寻找面试候选人 🔒](https://leetcode.cn/problems/find-interview-candidates) [English Version](/solution/1800-1899/1811.Find%20Interview%20Candidates/README_EN.md) diff --git a/solution/1800-1899/1811.Find Interview Candidates/README_EN.md b/solution/1800-1899/1811.Find Interview Candidates/README_EN.md index 81f02de35212a..e33587f3fff6b 100644 --- a/solution/1800-1899/1811.Find Interview Candidates/README_EN.md +++ b/solution/1800-1899/1811.Find Interview Candidates/README_EN.md @@ -1,4 +1,4 @@ -# [1811. Find Interview Candidates](https://leetcode.com/problems/find-interview-candidates) +# [1811. Find Interview Candidates 🔒](https://leetcode.com/problems/find-interview-candidates) [中文文档](/solution/1800-1899/1811.Find%20Interview%20Candidates/README.md) diff --git a/solution/1800-1899/1820.Maximum Number of Accepted Invitations/README.md b/solution/1800-1899/1820.Maximum Number of Accepted Invitations/README.md index d2b4cdb0c1c40..cc8f69145835a 100644 --- a/solution/1800-1899/1820.Maximum Number of Accepted Invitations/README.md +++ b/solution/1800-1899/1820.Maximum Number of Accepted Invitations/README.md @@ -1,4 +1,4 @@ -# [1820. 最多邀请的个数](https://leetcode.cn/problems/maximum-number-of-accepted-invitations) +# [1820. 最多邀请的个数 🔒](https://leetcode.cn/problems/maximum-number-of-accepted-invitations) [English Version](/solution/1800-1899/1820.Maximum%20Number%20of%20Accepted%20Invitations/README_EN.md) diff --git a/solution/1800-1899/1820.Maximum Number of Accepted Invitations/README_EN.md b/solution/1800-1899/1820.Maximum Number of Accepted Invitations/README_EN.md index 9e89161e8e33d..e34ede1ce9562 100644 --- a/solution/1800-1899/1820.Maximum Number of Accepted Invitations/README_EN.md +++ b/solution/1800-1899/1820.Maximum Number of Accepted Invitations/README_EN.md @@ -1,4 +1,4 @@ -# [1820. Maximum Number of Accepted Invitations](https://leetcode.com/problems/maximum-number-of-accepted-invitations) +# [1820. Maximum Number of Accepted Invitations 🔒](https://leetcode.com/problems/maximum-number-of-accepted-invitations) [中文文档](/solution/1800-1899/1820.Maximum%20Number%20of%20Accepted%20Invitations/README.md) diff --git a/solution/1800-1899/1821.Find Customers With Positive Revenue this Year/README.md b/solution/1800-1899/1821.Find Customers With Positive Revenue this Year/README.md index 039f805d0ffcb..b35339fb48702 100644 --- a/solution/1800-1899/1821.Find Customers With Positive Revenue this Year/README.md +++ b/solution/1800-1899/1821.Find Customers With Positive Revenue this Year/README.md @@ -1,4 +1,4 @@ -# [1821. 寻找今年具有正收入的客户](https://leetcode.cn/problems/find-customers-with-positive-revenue-this-year) +# [1821. 寻找今年具有正收入的客户 🔒](https://leetcode.cn/problems/find-customers-with-positive-revenue-this-year) [English Version](/solution/1800-1899/1821.Find%20Customers%20With%20Positive%20Revenue%20this%20Year/README_EN.md) diff --git a/solution/1800-1899/1821.Find Customers With Positive Revenue this Year/README_EN.md b/solution/1800-1899/1821.Find Customers With Positive Revenue this Year/README_EN.md index 5632234b63c91..33a85fced30bc 100644 --- a/solution/1800-1899/1821.Find Customers With Positive Revenue this Year/README_EN.md +++ b/solution/1800-1899/1821.Find Customers With Positive Revenue this Year/README_EN.md @@ -1,4 +1,4 @@ -# [1821. Find Customers With Positive Revenue this Year](https://leetcode.com/problems/find-customers-with-positive-revenue-this-year) +# [1821. Find Customers With Positive Revenue this Year 🔒](https://leetcode.com/problems/find-customers-with-positive-revenue-this-year) [中文文档](/solution/1800-1899/1821.Find%20Customers%20With%20Positive%20Revenue%20this%20Year/README.md) diff --git a/solution/1800-1899/1826.Faulty Sensor/README.md b/solution/1800-1899/1826.Faulty Sensor/README.md index 317399fae8195..d82927da4ae0f 100644 --- a/solution/1800-1899/1826.Faulty Sensor/README.md +++ b/solution/1800-1899/1826.Faulty Sensor/README.md @@ -1,4 +1,4 @@ -# [1826. 有缺陷的传感器](https://leetcode.cn/problems/faulty-sensor) +# [1826. 有缺陷的传感器 🔒](https://leetcode.cn/problems/faulty-sensor) [English Version](/solution/1800-1899/1826.Faulty%20Sensor/README_EN.md) @@ -64,7 +64,7 @@ 遍历两个数组，找到第一个不相等的位置 $i$。如果 $i \lt n - 1$，循环比较 $sensor1[i + 1]$ 和 $sensor2[i]$，如果不相等，说明传感器 $1$ 有缺陷，返回 $1$；否则比较 $sensor1[i]$ 和 $sensor2[i + 1]$，如果不相等，说明传感器 $2$ 有缺陷，返回 $2$。 -遍历结束，说明无法确定有缺陷的传感器，返回 $-1$。 +遍历结束，说明无法确定有缺陷的传感器 🔒，返回 $-1$。 时间复杂度 $O(n)$，其中 $n$ 为数组长度。空间复杂度 $O(1)$。 diff --git a/solution/1800-1899/1826.Faulty Sensor/README_EN.md b/solution/1800-1899/1826.Faulty Sensor/README_EN.md index a35f15c2fd5f0..820c85d8ff058 100644 --- a/solution/1800-1899/1826.Faulty Sensor/README_EN.md +++ b/solution/1800-1899/1826.Faulty Sensor/README_EN.md @@ -1,4 +1,4 @@ -# [1826. Faulty Sensor](https://leetcode.com/problems/faulty-sensor) +# [1826. Faulty Sensor 🔒](https://leetcode.com/problems/faulty-sensor) [中文文档](/solution/1800-1899/1826.Faulty%20Sensor/README.md) diff --git a/solution/1800-1899/1831.Maximum Transaction Each Day/README.md b/solution/1800-1899/1831.Maximum Transaction Each Day/README.md index 49ad13c937d17..a36194e961da5 100644 --- a/solution/1800-1899/1831.Maximum Transaction Each Day/README.md +++ b/solution/1800-1899/1831.Maximum Transaction Each Day/README.md @@ -1,4 +1,4 @@ -# [1831. 每天的最大交易](https://leetcode.cn/problems/maximum-transaction-each-day) +# [1831. 每天的最大交易 🔒](https://leetcode.cn/problems/maximum-transaction-each-day) [English Version](/solution/1800-1899/1831.Maximum%20Transaction%20Each%20Day/README_EN.md) diff --git a/solution/1800-1899/1831.Maximum Transaction Each Day/README_EN.md b/solution/1800-1899/1831.Maximum Transaction Each Day/README_EN.md index fa2e4daf42104..738772396c038 100644 --- a/solution/1800-1899/1831.Maximum Transaction Each Day/README_EN.md +++ b/solution/1800-1899/1831.Maximum Transaction Each Day/README_EN.md @@ -1,4 +1,4 @@ -# [1831. Maximum Transaction Each Day](https://leetcode.com/problems/maximum-transaction-each-day) +# [1831. Maximum Transaction Each Day 🔒](https://leetcode.com/problems/maximum-transaction-each-day) [中文文档](/solution/1800-1899/1831.Maximum%20Transaction%20Each%20Day/README.md) diff --git a/solution/1800-1899/1836.Remove Duplicates From an Unsorted Linked List/README.md b/solution/1800-1899/1836.Remove Duplicates From an Unsorted Linked List/README.md index 1eb2062df24d5..c900e257eeb1e 100644 --- a/solution/1800-1899/1836.Remove Duplicates From an Unsorted Linked List/README.md +++ b/solution/1800-1899/1836.Remove Duplicates From an Unsorted Linked List/README.md @@ -1,4 +1,4 @@ -# [1836. 从未排序的链表中移除重复元素](https://leetcode.cn/problems/remove-duplicates-from-an-unsorted-linked-list) +# [1836. 从未排序的链表中移除重复元素 🔒](https://leetcode.cn/problems/remove-duplicates-from-an-unsorted-linked-list) [English Version](/solution/1800-1899/1836.Remove%20Duplicates%20From%20an%20Unsorted%20Linked%20List/README_EN.md) diff --git a/solution/1800-1899/1836.Remove Duplicates From an Unsorted Linked List/README_EN.md b/solution/1800-1899/1836.Remove Duplicates From an Unsorted Linked List/README_EN.md index ea50ce867ae1d..956a70b230908 100644 --- a/solution/1800-1899/1836.Remove Duplicates From an Unsorted Linked List/README_EN.md +++ b/solution/1800-1899/1836.Remove Duplicates From an Unsorted Linked List/README_EN.md @@ -1,4 +1,4 @@ -# [1836. Remove Duplicates From an Unsorted Linked List](https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list) +# [1836. Remove Duplicates From an Unsorted Linked List 🔒](https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list) [中文文档](/solution/1800-1899/1836.Remove%20Duplicates%20From%20an%20Unsorted%20Linked%20List/README.md) diff --git a/solution/1800-1899/1841.League Statistics/README.md b/solution/1800-1899/1841.League Statistics/README.md index f67264dddbd2c..6641e029eed18 100644 --- a/solution/1800-1899/1841.League Statistics/README.md +++ b/solution/1800-1899/1841.League Statistics/README.md @@ -1,4 +1,4 @@ -# [1841. 联赛信息统计](https://leetcode.cn/problems/league-statistics) +# [1841. 联赛信息统计 🔒](https://leetcode.cn/problems/league-statistics) [English Version](/solution/1800-1899/1841.League%20Statistics/README_EN.md) diff --git a/solution/1800-1899/1841.League Statistics/README_EN.md b/solution/1800-1899/1841.League Statistics/README_EN.md index f8c444e5359cf..75b5992fc173a 100644 --- a/solution/1800-1899/1841.League Statistics/README_EN.md +++ b/solution/1800-1899/1841.League Statistics/README_EN.md @@ -1,4 +1,4 @@ -# [1841. League Statistics](https://leetcode.com/problems/league-statistics) +# [1841. League Statistics 🔒](https://leetcode.com/problems/league-statistics) [中文文档](/solution/1800-1899/1841.League%20Statistics/README.md) diff --git a/solution/1800-1899/1842.Next Palindrome Using Same Digits/README.md b/solution/1800-1899/1842.Next Palindrome Using Same Digits/README.md index ed09fae71021f..7833dbd63c244 100644 --- a/solution/1800-1899/1842.Next Palindrome Using Same Digits/README.md +++ b/solution/1800-1899/1842.Next Palindrome Using Same Digits/README.md @@ -1,4 +1,4 @@ -# [1842. 下个由相同数字构成的回文串](https://leetcode.cn/problems/next-palindrome-using-same-digits) +# [1842. 下个由相同数字构成的回文串 🔒](https://leetcode.cn/problems/next-palindrome-using-same-digits) [English Version](/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README_EN.md) diff --git a/solution/1800-1899/1842.Next Palindrome Using Same Digits/README_EN.md b/solution/1800-1899/1842.Next Palindrome Using Same Digits/README_EN.md index 047a2095f2a57..51d05cbff10ad 100644 --- a/solution/1800-1899/1842.Next Palindrome Using Same Digits/README_EN.md +++ b/solution/1800-1899/1842.Next Palindrome Using Same Digits/README_EN.md @@ -1,4 +1,4 @@ -# [1842. Next Palindrome Using Same Digits](https://leetcode.com/problems/next-palindrome-using-same-digits) +# [1842. Next Palindrome Using Same Digits 🔒](https://leetcode.com/problems/next-palindrome-using-same-digits) [中文文档](/solution/1800-1899/1842.Next%20Palindrome%20Using%20Same%20Digits/README.md) diff --git a/solution/1800-1899/1843.Suspicious Bank Accounts/README.md b/solution/1800-1899/1843.Suspicious Bank Accounts/README.md index 23fea62d1a484..8fb839a1dcda1 100644 --- a/solution/1800-1899/1843.Suspicious Bank Accounts/README.md +++ b/solution/1800-1899/1843.Suspicious Bank Accounts/README.md @@ -1,4 +1,4 @@ -# [1843. 可疑银行账户](https://leetcode.cn/problems/suspicious-bank-accounts) +# [1843. 可疑银行账户 🔒](https://leetcode.cn/problems/suspicious-bank-accounts) [English Version](/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README_EN.md) diff --git a/solution/1800-1899/1843.Suspicious Bank Accounts/README_EN.md b/solution/1800-1899/1843.Suspicious Bank Accounts/README_EN.md index 190f693199539..bc998db18b2d5 100644 --- a/solution/1800-1899/1843.Suspicious Bank Accounts/README_EN.md +++ b/solution/1800-1899/1843.Suspicious Bank Accounts/README_EN.md @@ -1,4 +1,4 @@ -# [1843. Suspicious Bank Accounts](https://leetcode.com/problems/suspicious-bank-accounts) +# [1843. Suspicious Bank Accounts 🔒](https://leetcode.com/problems/suspicious-bank-accounts) [中文文档](/solution/1800-1899/1843.Suspicious%20Bank%20Accounts/README.md) diff --git a/solution/1800-1899/1852.Distinct Numbers in Each Subarray/README.md b/solution/1800-1899/1852.Distinct Numbers in Each Subarray/README.md index a97e639fddde1..75f9bcde3dc99 100644 --- a/solution/1800-1899/1852.Distinct Numbers in Each Subarray/README.md +++ b/solution/1800-1899/1852.Distinct Numbers in Each Subarray/README.md @@ -1,4 +1,4 @@ -# [1852. 每个子数组的数字种类数](https://leetcode.cn/problems/distinct-numbers-in-each-subarray) +# [1852. 每个子数组的数字种类数 🔒](https://leetcode.cn/problems/distinct-numbers-in-each-subarray) [English Version](/solution/1800-1899/1852.Distinct%20Numbers%20in%20Each%20Subarray/README_EN.md) diff --git a/solution/1800-1899/1852.Distinct Numbers in Each Subarray/README_EN.md b/solution/1800-1899/1852.Distinct Numbers in Each Subarray/README_EN.md index 379fbd0a20e64..960de504ab651 100644 --- a/solution/1800-1899/1852.Distinct Numbers in Each Subarray/README_EN.md +++ b/solution/1800-1899/1852.Distinct Numbers in Each Subarray/README_EN.md @@ -1,4 +1,4 @@ -# [1852. Distinct Numbers in Each Subarray](https://leetcode.com/problems/distinct-numbers-in-each-subarray) +# [1852. Distinct Numbers in Each Subarray 🔒](https://leetcode.com/problems/distinct-numbers-in-each-subarray) [中文文档](/solution/1800-1899/1852.Distinct%20Numbers%20in%20Each%20Subarray/README.md) diff --git a/solution/1800-1899/1853.Convert Date Format/README.md b/solution/1800-1899/1853.Convert Date Format/README.md index fad308d81b1f8..633d774cd673c 100644 --- a/solution/1800-1899/1853.Convert Date Format/README.md +++ b/solution/1800-1899/1853.Convert Date Format/README.md @@ -1,4 +1,4 @@ -# [1853. 转换日期格式](https://leetcode.cn/problems/convert-date-format) +# [1853. 转换日期格式 🔒](https://leetcode.cn/problems/convert-date-format) [English Version](/solution/1800-1899/1853.Convert%20Date%20Format/README_EN.md) diff --git a/solution/1800-1899/1853.Convert Date Format/README_EN.md b/solution/1800-1899/1853.Convert Date Format/README_EN.md index 7bb7f3956350b..071079d1a6113 100644 --- a/solution/1800-1899/1853.Convert Date Format/README_EN.md +++ b/solution/1800-1899/1853.Convert Date Format/README_EN.md @@ -1,4 +1,4 @@ -# [1853. Convert Date Format](https://leetcode.com/problems/convert-date-format) +# [1853. Convert Date Format 🔒](https://leetcode.com/problems/convert-date-format) [中文文档](/solution/1800-1899/1853.Convert%20Date%20Format/README.md) diff --git a/solution/1800-1899/1858.Longest Word With All Prefixes/README.md b/solution/1800-1899/1858.Longest Word With All Prefixes/README.md index bf6682ae012d3..c358d0e1a54c6 100644 --- a/solution/1800-1899/1858.Longest Word With All Prefixes/README.md +++ b/solution/1800-1899/1858.Longest Word With All Prefixes/README.md @@ -1,4 +1,4 @@ -# [1858. 包含所有前缀的最长单词](https://leetcode.cn/problems/longest-word-with-all-prefixes) +# [1858. 包含所有前缀的最长单词 🔒](https://leetcode.cn/problems/longest-word-with-all-prefixes) [English Version](/solution/1800-1899/1858.Longest%20Word%20With%20All%20Prefixes/README_EN.md) diff --git a/solution/1800-1899/1858.Longest Word With All Prefixes/README_EN.md b/solution/1800-1899/1858.Longest Word With All Prefixes/README_EN.md index e30174125057c..6ba091fe6c569 100644 --- a/solution/1800-1899/1858.Longest Word With All Prefixes/README_EN.md +++ b/solution/1800-1899/1858.Longest Word With All Prefixes/README_EN.md @@ -1,4 +1,4 @@ -# [1858. Longest Word With All Prefixes](https://leetcode.com/problems/longest-word-with-all-prefixes) +# [1858. Longest Word With All Prefixes 🔒](https://leetcode.com/problems/longest-word-with-all-prefixes) [中文文档](/solution/1800-1899/1858.Longest%20Word%20With%20All%20Prefixes/README.md) diff --git a/solution/1800-1899/1867.Orders With Maximum Quantity Above Average/README.md b/solution/1800-1899/1867.Orders With Maximum Quantity Above Average/README.md index c83d7c4940ec2..4b073e20f6084 100644 --- a/solution/1800-1899/1867.Orders With Maximum Quantity Above Average/README.md +++ b/solution/1800-1899/1867.Orders With Maximum Quantity Above Average/README.md @@ -1,4 +1,4 @@ -# [1867. 最大数量高于平均水平的订单](https://leetcode.cn/problems/orders-with-maximum-quantity-above-average) +# [1867. 最大数量高于平均水平的订单 🔒](https://leetcode.cn/problems/orders-with-maximum-quantity-above-average) [English Version](/solution/1800-1899/1867.Orders%20With%20Maximum%20Quantity%20Above%20Average/README_EN.md) diff --git a/solution/1800-1899/1867.Orders With Maximum Quantity Above Average/README_EN.md b/solution/1800-1899/1867.Orders With Maximum Quantity Above Average/README_EN.md index b794c0b264afa..a872824948664 100644 --- a/solution/1800-1899/1867.Orders With Maximum Quantity Above Average/README_EN.md +++ b/solution/1800-1899/1867.Orders With Maximum Quantity Above Average/README_EN.md @@ -1,4 +1,4 @@ -# [1867. Orders With Maximum Quantity Above Average](https://leetcode.com/problems/orders-with-maximum-quantity-above-average) +# [1867. Orders With Maximum Quantity Above Average 🔒](https://leetcode.com/problems/orders-with-maximum-quantity-above-average) [中文文档](/solution/1800-1899/1867.Orders%20With%20Maximum%20Quantity%20Above%20Average/README.md) diff --git a/solution/1800-1899/1868.Product of Two Run-Length Encoded Arrays/README.md b/solution/1800-1899/1868.Product of Two Run-Length Encoded Arrays/README.md index 682761337f5b0..f79eab91840bf 100644 --- a/solution/1800-1899/1868.Product of Two Run-Length Encoded Arrays/README.md +++ b/solution/1800-1899/1868.Product of Two Run-Length Encoded Arrays/README.md @@ -1,4 +1,4 @@ -# [1868. 两个行程编码数组的积](https://leetcode.cn/problems/product-of-two-run-length-encoded-arrays) +# [1868. 两个行程编码数组的积 🔒](https://leetcode.cn/problems/product-of-two-run-length-encoded-arrays) [English Version](/solution/1800-1899/1868.Product%20of%20Two%20Run-Length%20Encoded%20Arrays/README_EN.md) diff --git a/solution/1800-1899/1868.Product of Two Run-Length Encoded Arrays/README_EN.md b/solution/1800-1899/1868.Product of Two Run-Length Encoded Arrays/README_EN.md index 22fe0b52d4bb1..3d78c631f5357 100644 --- a/solution/1800-1899/1868.Product of Two Run-Length Encoded Arrays/README_EN.md +++ b/solution/1800-1899/1868.Product of Two Run-Length Encoded Arrays/README_EN.md @@ -1,4 +1,4 @@ -# [1868. Product of Two Run-Length Encoded Arrays](https://leetcode.com/problems/product-of-two-run-length-encoded-arrays) +# [1868. Product of Two Run-Length Encoded Arrays 🔒](https://leetcode.com/problems/product-of-two-run-length-encoded-arrays) [中文文档](/solution/1800-1899/1868.Product%20of%20Two%20Run-Length%20Encoded%20Arrays/README.md) diff --git a/solution/1800-1899/1874.Minimize Product Sum of Two Arrays/README.md b/solution/1800-1899/1874.Minimize Product Sum of Two Arrays/README.md index 0e0a9483484cc..e54bd55e76f23 100644 --- a/solution/1800-1899/1874.Minimize Product Sum of Two Arrays/README.md +++ b/solution/1800-1899/1874.Minimize Product Sum of Two Arrays/README.md @@ -1,4 +1,4 @@ -# [1874. 两个数组的最小乘积和](https://leetcode.cn/problems/minimize-product-sum-of-two-arrays) +# [1874. 两个数组的最小乘积和 🔒](https://leetcode.cn/problems/minimize-product-sum-of-two-arrays) [English Version](/solution/1800-1899/1874.Minimize%20Product%20Sum%20of%20Two%20Arrays/README_EN.md) diff --git a/solution/1800-1899/1874.Minimize Product Sum of Two Arrays/README_EN.md b/solution/1800-1899/1874.Minimize Product Sum of Two Arrays/README_EN.md index fa0475dc91082..b410c395a2681 100644 --- a/solution/1800-1899/1874.Minimize Product Sum of Two Arrays/README_EN.md +++ b/solution/1800-1899/1874.Minimize Product Sum of Two Arrays/README_EN.md @@ -1,4 +1,4 @@ -# [1874. Minimize Product Sum of Two Arrays](https://leetcode.com/problems/minimize-product-sum-of-two-arrays) +# [1874. Minimize Product Sum of Two Arrays 🔒](https://leetcode.com/problems/minimize-product-sum-of-two-arrays) [中文文档](/solution/1800-1899/1874.Minimize%20Product%20Sum%20of%20Two%20Arrays/README.md) diff --git a/solution/1800-1899/1875.Group Employees of the Same Salary/README.md b/solution/1800-1899/1875.Group Employees of the Same Salary/README.md index 25a2ffd6ac1bf..1a58509b3b289 100644 --- a/solution/1800-1899/1875.Group Employees of the Same Salary/README.md +++ b/solution/1800-1899/1875.Group Employees of the Same Salary/README.md @@ -1,4 +1,4 @@ -# [1875. 将工资相同的雇员分组](https://leetcode.cn/problems/group-employees-of-the-same-salary) +# [1875. 将工资相同的雇员分组 🔒](https://leetcode.cn/problems/group-employees-of-the-same-salary) [English Version](/solution/1800-1899/1875.Group%20Employees%20of%20the%20Same%20Salary/README_EN.md) diff --git a/solution/1800-1899/1875.Group Employees of the Same Salary/README_EN.md b/solution/1800-1899/1875.Group Employees of the Same Salary/README_EN.md index 8a568c780ee5d..ef1c9ef73a460 100644 --- a/solution/1800-1899/1875.Group Employees of the Same Salary/README_EN.md +++ b/solution/1800-1899/1875.Group Employees of the Same Salary/README_EN.md @@ -1,4 +1,4 @@ -# [1875. Group Employees of the Same Salary](https://leetcode.com/problems/group-employees-of-the-same-salary) +# [1875. Group Employees of the Same Salary 🔒](https://leetcode.com/problems/group-employees-of-the-same-salary) [中文文档](/solution/1800-1899/1875.Group%20Employees%20of%20the%20Same%20Salary/README.md) diff --git a/solution/1800-1899/1885.Count Pairs in Two Arrays/README.md b/solution/1800-1899/1885.Count Pairs in Two Arrays/README.md index fcc8ff74dae32..df33a9ebcec6a 100644 --- a/solution/1800-1899/1885.Count Pairs in Two Arrays/README.md +++ b/solution/1800-1899/1885.Count Pairs in Two Arrays/README.md @@ -1,4 +1,4 @@ -# [1885. 统计数对](https://leetcode.cn/problems/count-pairs-in-two-arrays) +# [1885. 统计数对 🔒](https://leetcode.cn/problems/count-pairs-in-two-arrays) [English Version](/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README_EN.md) diff --git a/solution/1800-1899/1885.Count Pairs in Two Arrays/README_EN.md b/solution/1800-1899/1885.Count Pairs in Two Arrays/README_EN.md index 04a7b5ed87349..478886ea0df76 100644 --- a/solution/1800-1899/1885.Count Pairs in Two Arrays/README_EN.md +++ b/solution/1800-1899/1885.Count Pairs in Two Arrays/README_EN.md @@ -1,4 +1,4 @@ -# [1885. Count Pairs in Two Arrays](https://leetcode.com/problems/count-pairs-in-two-arrays) +# [1885. Count Pairs in Two Arrays 🔒](https://leetcode.com/problems/count-pairs-in-two-arrays) [中文文档](/solution/1800-1899/1885.Count%20Pairs%20in%20Two%20Arrays/README.md) diff --git a/solution/1800-1899/1891.Cutting Ribbons/README.md b/solution/1800-1899/1891.Cutting Ribbons/README.md index b7e680ae8a566..5d27aa5611070 100644 --- a/solution/1800-1899/1891.Cutting Ribbons/README.md +++ b/solution/1800-1899/1891.Cutting Ribbons/README.md @@ -1,4 +1,4 @@ -# [1891. 割绳子](https://leetcode.cn/problems/cutting-ribbons) +# [1891. 割绳子 🔒](https://leetcode.cn/problems/cutting-ribbons) [English Version](/solution/1800-1899/1891.Cutting%20Ribbons/README_EN.md) diff --git a/solution/1800-1899/1891.Cutting Ribbons/README_EN.md b/solution/1800-1899/1891.Cutting Ribbons/README_EN.md index 43e35dbbf73c7..932636a8e5a18 100644 --- a/solution/1800-1899/1891.Cutting Ribbons/README_EN.md +++ b/solution/1800-1899/1891.Cutting Ribbons/README_EN.md @@ -1,4 +1,4 @@ -# [1891. Cutting Ribbons](https://leetcode.com/problems/cutting-ribbons) +# [1891. Cutting Ribbons 🔒](https://leetcode.com/problems/cutting-ribbons) [中文文档](/solution/1800-1899/1891.Cutting%20Ribbons/README.md) diff --git a/solution/1800-1899/1892.Page Recommendations II/README.md b/solution/1800-1899/1892.Page Recommendations II/README.md index dd1246cba5d8f..9b866c7df8d13 100644 --- a/solution/1800-1899/1892.Page Recommendations II/README.md +++ b/solution/1800-1899/1892.Page Recommendations II/README.md @@ -1,4 +1,4 @@ -# [1892. 页面推荐 Ⅱ](https://leetcode.cn/problems/page-recommendations-ii) +# [1892. 页面推荐 Ⅱ 🔒](https://leetcode.cn/problems/page-recommendations-ii) [English Version](/solution/1800-1899/1892.Page%20Recommendations%20II/README_EN.md) diff --git a/solution/1800-1899/1892.Page Recommendations II/README_EN.md b/solution/1800-1899/1892.Page Recommendations II/README_EN.md index 6cfc8d96d1657..144b225d82280 100644 --- a/solution/1800-1899/1892.Page Recommendations II/README_EN.md +++ b/solution/1800-1899/1892.Page Recommendations II/README_EN.md @@ -1,4 +1,4 @@ -# [1892. Page Recommendations II](https://leetcode.com/problems/page-recommendations-ii) +# [1892. Page Recommendations II 🔒](https://leetcode.com/problems/page-recommendations-ii) [中文文档](/solution/1800-1899/1892.Page%20Recommendations%20II/README.md) diff --git a/solution/1900-1999/1902.Depth of BST Given Insertion Order/README.md b/solution/1900-1999/1902.Depth of BST Given Insertion Order/README.md index b48ab2b058f3a..b5f173bb90884 100644 --- a/solution/1900-1999/1902.Depth of BST Given Insertion Order/README.md +++ b/solution/1900-1999/1902.Depth of BST Given Insertion Order/README.md @@ -1,4 +1,4 @@ -# [1902. 给定二叉搜索树的插入顺序求深度](https://leetcode.cn/problems/depth-of-bst-given-insertion-order) +# [1902. 给定二叉搜索树的插入顺序求深度 🔒](https://leetcode.cn/problems/depth-of-bst-given-insertion-order) [English Version](/solution/1900-1999/1902.Depth%20of%20BST%20Given%20Insertion%20Order/README_EN.md) diff --git a/solution/1900-1999/1902.Depth of BST Given Insertion Order/README_EN.md b/solution/1900-1999/1902.Depth of BST Given Insertion Order/README_EN.md index 82c5db012b7f2..61cf96b31a721 100644 --- a/solution/1900-1999/1902.Depth of BST Given Insertion Order/README_EN.md +++ b/solution/1900-1999/1902.Depth of BST Given Insertion Order/README_EN.md @@ -1,4 +1,4 @@ -# [1902. Depth of BST Given Insertion Order](https://leetcode.com/problems/depth-of-bst-given-insertion-order) +# [1902. Depth of BST Given Insertion Order 🔒](https://leetcode.com/problems/depth-of-bst-given-insertion-order) [中文文档](/solution/1900-1999/1902.Depth%20of%20BST%20Given%20Insertion%20Order/README.md) diff --git a/solution/1900-1999/1908.Game of Nim/README.md b/solution/1900-1999/1908.Game of Nim/README.md index 651fea844e844..54e002b456703 100644 --- a/solution/1900-1999/1908.Game of Nim/README.md +++ b/solution/1900-1999/1908.Game of Nim/README.md @@ -1,4 +1,4 @@ -# [1908. Nim 游戏 II](https://leetcode.cn/problems/game-of-nim) +# [1908. Nim 游戏 II 🔒](https://leetcode.cn/problems/game-of-nim) [English Version](/solution/1900-1999/1908.Game%20of%20Nim/README_EN.md) diff --git a/solution/1900-1999/1908.Game of Nim/README_EN.md b/solution/1900-1999/1908.Game of Nim/README_EN.md index 9b04535a96435..52c78f0e09ad1 100644 --- a/solution/1900-1999/1908.Game of Nim/README_EN.md +++ b/solution/1900-1999/1908.Game of Nim/README_EN.md @@ -1,4 +1,4 @@ -# [1908. Game of Nim](https://leetcode.com/problems/game-of-nim) +# [1908. Game of Nim 🔒](https://leetcode.com/problems/game-of-nim) [中文文档](/solution/1900-1999/1908.Game%20of%20Nim/README.md) diff --git a/solution/1900-1999/1917.Leetcodify Friends Recommendations/README.md b/solution/1900-1999/1917.Leetcodify Friends Recommendations/README.md index bb16fcc64f6bb..2388850f9e262 100644 --- a/solution/1900-1999/1917.Leetcodify Friends Recommendations/README.md +++ b/solution/1900-1999/1917.Leetcodify Friends Recommendations/README.md @@ -1,4 +1,4 @@ -# [1917. Leetcodify 好友推荐](https://leetcode.cn/problems/leetcodify-friends-recommendations) +# [1917. Leetcodify 好友推荐 🔒](https://leetcode.cn/problems/leetcodify-friends-recommendations) [English Version](/solution/1900-1999/1917.Leetcodify%20Friends%20Recommendations/README_EN.md) diff --git a/solution/1900-1999/1917.Leetcodify Friends Recommendations/README_EN.md b/solution/1900-1999/1917.Leetcodify Friends Recommendations/README_EN.md index 3441f53037c82..6e1b2dcad731e 100644 --- a/solution/1900-1999/1917.Leetcodify Friends Recommendations/README_EN.md +++ b/solution/1900-1999/1917.Leetcodify Friends Recommendations/README_EN.md @@ -1,4 +1,4 @@ -# [1917. Leetcodify Friends Recommendations](https://leetcode.com/problems/leetcodify-friends-recommendations) +# [1917. Leetcodify Friends Recommendations 🔒](https://leetcode.com/problems/leetcodify-friends-recommendations) [中文文档](/solution/1900-1999/1917.Leetcodify%20Friends%20Recommendations/README.md) diff --git a/solution/1900-1999/1918.Kth Smallest Subarray Sum/README.md b/solution/1900-1999/1918.Kth Smallest Subarray Sum/README.md index 42892dedfcc60..bc18d66c2b04f 100644 --- a/solution/1900-1999/1918.Kth Smallest Subarray Sum/README.md +++ b/solution/1900-1999/1918.Kth Smallest Subarray Sum/README.md @@ -1,4 +1,4 @@ -# [1918. 第 K 小的子数组和](https://leetcode.cn/problems/kth-smallest-subarray-sum) +# [1918. 第 K 小的子数组和 🔒](https://leetcode.cn/problems/kth-smallest-subarray-sum) [English Version](/solution/1900-1999/1918.Kth%20Smallest%20Subarray%20Sum/README_EN.md) diff --git a/solution/1900-1999/1918.Kth Smallest Subarray Sum/README_EN.md b/solution/1900-1999/1918.Kth Smallest Subarray Sum/README_EN.md index 295f410367378..f94469e8ad3fd 100644 --- a/solution/1900-1999/1918.Kth Smallest Subarray Sum/README_EN.md +++ b/solution/1900-1999/1918.Kth Smallest Subarray Sum/README_EN.md @@ -1,4 +1,4 @@ -# [1918. Kth Smallest Subarray Sum](https://leetcode.com/problems/kth-smallest-subarray-sum) +# [1918. Kth Smallest Subarray Sum 🔒](https://leetcode.com/problems/kth-smallest-subarray-sum) [中文文档](/solution/1900-1999/1918.Kth%20Smallest%20Subarray%20Sum/README.md) diff --git a/solution/1900-1999/1919.Leetcodify Similar Friends/README.md b/solution/1900-1999/1919.Leetcodify Similar Friends/README.md index ba4fb80836fac..0bd4fe75bd3ab 100644 --- a/solution/1900-1999/1919.Leetcodify Similar Friends/README.md +++ b/solution/1900-1999/1919.Leetcodify Similar Friends/README.md @@ -1,4 +1,4 @@ -# [1919. 兴趣相同的朋友](https://leetcode.cn/problems/leetcodify-similar-friends) +# [1919. 兴趣相同的朋友 🔒](https://leetcode.cn/problems/leetcodify-similar-friends) [English Version](/solution/1900-1999/1919.Leetcodify%20Similar%20Friends/README_EN.md) diff --git a/solution/1900-1999/1919.Leetcodify Similar Friends/README_EN.md b/solution/1900-1999/1919.Leetcodify Similar Friends/README_EN.md index f11b1503fb0c1..92877b862f0fe 100644 --- a/solution/1900-1999/1919.Leetcodify Similar Friends/README_EN.md +++ b/solution/1900-1999/1919.Leetcodify Similar Friends/README_EN.md @@ -1,4 +1,4 @@ -# [1919. Leetcodify Similar Friends](https://leetcode.com/problems/leetcodify-similar-friends) +# [1919. Leetcodify Similar Friends 🔒](https://leetcode.com/problems/leetcodify-similar-friends) [中文文档](/solution/1900-1999/1919.Leetcodify%20Similar%20Friends/README.md) diff --git a/solution/1900-1999/1924.Erect the Fence II/README.md b/solution/1900-1999/1924.Erect the Fence II/README.md index 1f1a22c1a290d..7b6f5363318a3 100644 --- a/solution/1900-1999/1924.Erect the Fence II/README.md +++ b/solution/1900-1999/1924.Erect the Fence II/README.md @@ -1,4 +1,4 @@ -# [1924. 安装栅栏 II](https://leetcode.cn/problems/erect-the-fence-ii) +# [1924. 安装栅栏 II 🔒](https://leetcode.cn/problems/erect-the-fence-ii) [English Version](/solution/1900-1999/1924.Erect%20the%20Fence%20II/README_EN.md) diff --git a/solution/1900-1999/1924.Erect the Fence II/README_EN.md b/solution/1900-1999/1924.Erect the Fence II/README_EN.md index 389ebb53571f4..d0692c53a9513 100644 --- a/solution/1900-1999/1924.Erect the Fence II/README_EN.md +++ b/solution/1900-1999/1924.Erect the Fence II/README_EN.md @@ -1,4 +1,4 @@ -# [1924. Erect the Fence II](https://leetcode.com/problems/erect-the-fence-ii) +# [1924. Erect the Fence II 🔒](https://leetcode.com/problems/erect-the-fence-ii) [中文文档](/solution/1900-1999/1924.Erect%20the%20Fence%20II/README.md) diff --git a/solution/1900-1999/1933.Check if String Is Decomposable Into Value-Equal Substrings/README.md b/solution/1900-1999/1933.Check if String Is Decomposable Into Value-Equal Substrings/README.md index f624ec00fbacd..2f9f62f1a092c 100644 --- a/solution/1900-1999/1933.Check if String Is Decomposable Into Value-Equal Substrings/README.md +++ b/solution/1900-1999/1933.Check if String Is Decomposable Into Value-Equal Substrings/README.md @@ -1,4 +1,4 @@ -# [1933. 判断字符串是否可分解为值均等的子串](https://leetcode.cn/problems/check-if-string-is-decomposable-into-value-equal-substrings) +# [1933. 判断字符串是否可分解为值均等的子串 🔒](https://leetcode.cn/problems/check-if-string-is-decomposable-into-value-equal-substrings) [English Version](/solution/1900-1999/1933.Check%20if%20String%20Is%20Decomposable%20Into%20Value-Equal%20Substrings/README_EN.md) diff --git a/solution/1900-1999/1933.Check if String Is Decomposable Into Value-Equal Substrings/README_EN.md b/solution/1900-1999/1933.Check if String Is Decomposable Into Value-Equal Substrings/README_EN.md index 97904bc3a6c6f..ff567e21612c3 100644 --- a/solution/1900-1999/1933.Check if String Is Decomposable Into Value-Equal Substrings/README_EN.md +++ b/solution/1900-1999/1933.Check if String Is Decomposable Into Value-Equal Substrings/README_EN.md @@ -1,4 +1,4 @@ -# [1933. Check if String Is Decomposable Into Value-Equal Substrings](https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings) +# [1933. Check if String Is Decomposable Into Value-Equal Substrings 🔒](https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings) [中文文档](/solution/1900-1999/1933.Check%20if%20String%20Is%20Decomposable%20Into%20Value-Equal%20Substrings/README.md) diff --git a/solution/1900-1999/1939.Users That Actively Request Confirmation Messages/README.md b/solution/1900-1999/1939.Users That Actively Request Confirmation Messages/README.md index d71386f9a3160..49ae246f04bb4 100644 --- a/solution/1900-1999/1939.Users That Actively Request Confirmation Messages/README.md +++ b/solution/1900-1999/1939.Users That Actively Request Confirmation Messages/README.md @@ -1,4 +1,4 @@ -# [1939. 主动请求确认消息的用户](https://leetcode.cn/problems/users-that-actively-request-confirmation-messages) +# [1939. 主动请求确认消息的用户 🔒](https://leetcode.cn/problems/users-that-actively-request-confirmation-messages) [English Version](/solution/1900-1999/1939.Users%20That%20Actively%20Request%20Confirmation%20Messages/README_EN.md) diff --git a/solution/1900-1999/1939.Users That Actively Request Confirmation Messages/README_EN.md b/solution/1900-1999/1939.Users That Actively Request Confirmation Messages/README_EN.md index bd6342a043a4b..1f46fa9e53017 100644 --- a/solution/1900-1999/1939.Users That Actively Request Confirmation Messages/README_EN.md +++ b/solution/1900-1999/1939.Users That Actively Request Confirmation Messages/README_EN.md @@ -1,4 +1,4 @@ -# [1939. Users That Actively Request Confirmation Messages](https://leetcode.com/problems/users-that-actively-request-confirmation-messages) +# [1939. Users That Actively Request Confirmation Messages 🔒](https://leetcode.com/problems/users-that-actively-request-confirmation-messages) [中文文档](/solution/1900-1999/1939.Users%20That%20Actively%20Request%20Confirmation%20Messages/README.md) diff --git a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md index 45fc27cd6b0bd..d5f2ed0307bd2 100644 --- a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md +++ b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README.md @@ -1,4 +1,4 @@ -# [1940. 排序数组之间的最长公共子序列](https://leetcode.cn/problems/longest-common-subsequence-between-sorted-arrays) +# [1940. 排序数组之间的最长公共子序列 🔒](https://leetcode.cn/problems/longest-common-subsequence-between-sorted-arrays) [English Version](/solution/1900-1999/1940.Longest%20Common%20Subsequence%20Between%20Sorted%20Arrays/README_EN.md) diff --git a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md index bf0389a84c6ce..a77d99ed8085d 100644 --- a/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md +++ b/solution/1900-1999/1940.Longest Common Subsequence Between Sorted Arrays/README_EN.md @@ -1,4 +1,4 @@ -# [1940. Longest Common Subsequence Between Sorted Arrays](https://leetcode.com/problems/longest-common-subsequence-between-sorted-arrays) +# [1940. Longest Common Subsequence Between Sorted Arrays 🔒](https://leetcode.com/problems/longest-common-subsequence-between-sorted-arrays) [中文文档](/solution/1900-1999/1940.Longest%20Common%20Subsequence%20Between%20Sorted%20Arrays/README.md) diff --git a/solution/1900-1999/1949.Strong Friendship/README.md b/solution/1900-1999/1949.Strong Friendship/README.md index 40f0f9199e5fc..a477fccaa68fa 100644 --- a/solution/1900-1999/1949.Strong Friendship/README.md +++ b/solution/1900-1999/1949.Strong Friendship/README.md @@ -1,4 +1,4 @@ -# [1949. 坚定的友谊](https://leetcode.cn/problems/strong-friendship) +# [1949. 坚定的友谊 🔒](https://leetcode.cn/problems/strong-friendship) [English Version](/solution/1900-1999/1949.Strong%20Friendship/README_EN.md) diff --git a/solution/1900-1999/1949.Strong Friendship/README_EN.md b/solution/1900-1999/1949.Strong Friendship/README_EN.md index c5dd04ad147a5..e4a5c6c5167af 100644 --- a/solution/1900-1999/1949.Strong Friendship/README_EN.md +++ b/solution/1900-1999/1949.Strong Friendship/README_EN.md @@ -1,4 +1,4 @@ -# [1949. Strong Friendship](https://leetcode.com/problems/strong-friendship) +# [1949. Strong Friendship 🔒](https://leetcode.com/problems/strong-friendship) [中文文档](/solution/1900-1999/1949.Strong%20Friendship/README.md) diff --git a/solution/1900-1999/1950.Maximum of Minimum Values in All Subarrays/README.md b/solution/1900-1999/1950.Maximum of Minimum Values in All Subarrays/README.md index 8afdb1b8266c2..c1b9a44a8040d 100644 --- a/solution/1900-1999/1950.Maximum of Minimum Values in All Subarrays/README.md +++ b/solution/1900-1999/1950.Maximum of Minimum Values in All Subarrays/README.md @@ -1,4 +1,4 @@ -# [1950. 所有子数组最小值中的最大值](https://leetcode.cn/problems/maximum-of-minimum-values-in-all-subarrays) +# [1950. 所有子数组最小值中的最大值 🔒](https://leetcode.cn/problems/maximum-of-minimum-values-in-all-subarrays) [English Version](/solution/1900-1999/1950.Maximum%20of%20Minimum%20Values%20in%20All%20Subarrays/README_EN.md) diff --git a/solution/1900-1999/1950.Maximum of Minimum Values in All Subarrays/README_EN.md b/solution/1900-1999/1950.Maximum of Minimum Values in All Subarrays/README_EN.md index 35df8ac13538a..19cf362f2aadd 100644 --- a/solution/1900-1999/1950.Maximum of Minimum Values in All Subarrays/README_EN.md +++ b/solution/1900-1999/1950.Maximum of Minimum Values in All Subarrays/README_EN.md @@ -1,4 +1,4 @@ -# [1950. Maximum of Minimum Values in All Subarrays](https://leetcode.com/problems/maximum-of-minimum-values-in-all-subarrays) +# [1950. Maximum of Minimum Values in All Subarrays 🔒](https://leetcode.com/problems/maximum-of-minimum-values-in-all-subarrays) [中文文档](/solution/1900-1999/1950.Maximum%20of%20Minimum%20Values%20in%20All%20Subarrays/README.md) diff --git a/solution/1900-1999/1951.All the Pairs With the Maximum Number of Common Followers/README.md b/solution/1900-1999/1951.All the Pairs With the Maximum Number of Common Followers/README.md index 0d5f55c01f258..32c448784b4ea 100644 --- a/solution/1900-1999/1951.All the Pairs With the Maximum Number of Common Followers/README.md +++ b/solution/1900-1999/1951.All the Pairs With the Maximum Number of Common Followers/README.md @@ -1,4 +1,4 @@ -# [1951. 查询具有最多共同关注者的所有两两结对组](https://leetcode.cn/problems/all-the-pairs-with-the-maximum-number-of-common-followers) +# [1951. 查询具有最多共同关注者的所有两两结对组 🔒](https://leetcode.cn/problems/all-the-pairs-with-the-maximum-number-of-common-followers) [English Version](/solution/1900-1999/1951.All%20the%20Pairs%20With%20the%20Maximum%20Number%20of%20Common%20Followers/README_EN.md) diff --git a/solution/1900-1999/1951.All the Pairs With the Maximum Number of Common Followers/README_EN.md b/solution/1900-1999/1951.All the Pairs With the Maximum Number of Common Followers/README_EN.md index ef3d87ee48410..2f861c533aee2 100644 --- a/solution/1900-1999/1951.All the Pairs With the Maximum Number of Common Followers/README_EN.md +++ b/solution/1900-1999/1951.All the Pairs With the Maximum Number of Common Followers/README_EN.md @@ -1,4 +1,4 @@ -# [1951. All the Pairs With the Maximum Number of Common Followers](https://leetcode.com/problems/all-the-pairs-with-the-maximum-number-of-common-followers) +# [1951. All the Pairs With the Maximum Number of Common Followers 🔒](https://leetcode.com/problems/all-the-pairs-with-the-maximum-number-of-common-followers) [中文文档](/solution/1900-1999/1951.All%20the%20Pairs%20With%20the%20Maximum%20Number%20of%20Common%20Followers/README.md) diff --git a/solution/1900-1999/1956.Minimum Time For K Virus Variants to Spread/README.md b/solution/1900-1999/1956.Minimum Time For K Virus Variants to Spread/README.md index 29a357b493687..2414e048fdece 100644 --- a/solution/1900-1999/1956.Minimum Time For K Virus Variants to Spread/README.md +++ b/solution/1900-1999/1956.Minimum Time For K Virus Variants to Spread/README.md @@ -1,4 +1,4 @@ -# [1956. 感染 K 种病毒所需的最短时间](https://leetcode.cn/problems/minimum-time-for-k-virus-variants-to-spread) +# [1956. 感染 K 种病毒所需的最短时间 🔒](https://leetcode.cn/problems/minimum-time-for-k-virus-variants-to-spread) [English Version](/solution/1900-1999/1956.Minimum%20Time%20For%20K%20Virus%20Variants%20to%20Spread/README_EN.md) diff --git a/solution/1900-1999/1956.Minimum Time For K Virus Variants to Spread/README_EN.md b/solution/1900-1999/1956.Minimum Time For K Virus Variants to Spread/README_EN.md index e4bfc99e717c7..da92653e54aa2 100644 --- a/solution/1900-1999/1956.Minimum Time For K Virus Variants to Spread/README_EN.md +++ b/solution/1900-1999/1956.Minimum Time For K Virus Variants to Spread/README_EN.md @@ -1,4 +1,4 @@ -# [1956. Minimum Time For K Virus Variants to Spread](https://leetcode.com/problems/minimum-time-for-k-virus-variants-to-spread) +# [1956. Minimum Time For K Virus Variants to Spread 🔒](https://leetcode.com/problems/minimum-time-for-k-virus-variants-to-spread) [中文文档](/solution/1900-1999/1956.Minimum%20Time%20For%20K%20Virus%20Variants%20to%20Spread/README.md) diff --git a/solution/1900-1999/1966.Binary Searchable Numbers in an Unsorted Array/README.md b/solution/1900-1999/1966.Binary Searchable Numbers in an Unsorted Array/README.md index 56c7fc629f147..1ddf541d25707 100644 --- a/solution/1900-1999/1966.Binary Searchable Numbers in an Unsorted Array/README.md +++ b/solution/1900-1999/1966.Binary Searchable Numbers in an Unsorted Array/README.md @@ -1,4 +1,4 @@ -# [1966. 未排序数组中的可被二分搜索的数](https://leetcode.cn/problems/binary-searchable-numbers-in-an-unsorted-array) +# [1966. 未排序数组中的可被二分搜索的数 🔒](https://leetcode.cn/problems/binary-searchable-numbers-in-an-unsorted-array) [English Version](/solution/1900-1999/1966.Binary%20Searchable%20Numbers%20in%20an%20Unsorted%20Array/README_EN.md) diff --git a/solution/1900-1999/1966.Binary Searchable Numbers in an Unsorted Array/README_EN.md b/solution/1900-1999/1966.Binary Searchable Numbers in an Unsorted Array/README_EN.md index f9d514f7d5111..dfdb88fad1d8b 100644 --- a/solution/1900-1999/1966.Binary Searchable Numbers in an Unsorted Array/README_EN.md +++ b/solution/1900-1999/1966.Binary Searchable Numbers in an Unsorted Array/README_EN.md @@ -1,4 +1,4 @@ -# [1966. Binary Searchable Numbers in an Unsorted Array](https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array) +# [1966. Binary Searchable Numbers in an Unsorted Array 🔒](https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array) [中文文档](/solution/1900-1999/1966.Binary%20Searchable%20Numbers%20in%20an%20Unsorted%20Array/README.md) diff --git a/solution/1900-1999/1972.First and Last Call On the Same Day/README.md b/solution/1900-1999/1972.First and Last Call On the Same Day/README.md index 8a9f8b82469a6..91c9f2187cdbf 100644 --- a/solution/1900-1999/1972.First and Last Call On the Same Day/README.md +++ b/solution/1900-1999/1972.First and Last Call On the Same Day/README.md @@ -1,4 +1,4 @@ -# [1972. 同一天的第一个电话和最后一个电话](https://leetcode.cn/problems/first-and-last-call-on-the-same-day) +# [1972. 同一天的第一个电话和最后一个电话 🔒](https://leetcode.cn/problems/first-and-last-call-on-the-same-day) [English Version](/solution/1900-1999/1972.First%20and%20Last%20Call%20On%20the%20Same%20Day/README_EN.md) diff --git a/solution/1900-1999/1972.First and Last Call On the Same Day/README_EN.md b/solution/1900-1999/1972.First and Last Call On the Same Day/README_EN.md index f586cc50a252c..2bb3ce4bd6b98 100644 --- a/solution/1900-1999/1972.First and Last Call On the Same Day/README_EN.md +++ b/solution/1900-1999/1972.First and Last Call On the Same Day/README_EN.md @@ -1,4 +1,4 @@ -# [1972. First and Last Call On the Same Day](https://leetcode.com/problems/first-and-last-call-on-the-same-day) +# [1972. First and Last Call On the Same Day 🔒](https://leetcode.com/problems/first-and-last-call-on-the-same-day) [中文文档](/solution/1900-1999/1972.First%20and%20Last%20Call%20On%20the%20Same%20Day/README.md) diff --git a/solution/1900-1999/1973.Count Nodes Equal to Sum of Descendants/README.md b/solution/1900-1999/1973.Count Nodes Equal to Sum of Descendants/README.md index a790897761e8d..d94bf932c6cac 100644 --- a/solution/1900-1999/1973.Count Nodes Equal to Sum of Descendants/README.md +++ b/solution/1900-1999/1973.Count Nodes Equal to Sum of Descendants/README.md @@ -1,4 +1,4 @@ -# [1973. 值等于子节点值之和的节点数量](https://leetcode.cn/problems/count-nodes-equal-to-sum-of-descendants) +# [1973. 值等于子节点值之和的节点数量 🔒](https://leetcode.cn/problems/count-nodes-equal-to-sum-of-descendants) [English Version](/solution/1900-1999/1973.Count%20Nodes%20Equal%20to%20Sum%20of%20Descendants/README_EN.md) diff --git a/solution/1900-1999/1973.Count Nodes Equal to Sum of Descendants/README_EN.md b/solution/1900-1999/1973.Count Nodes Equal to Sum of Descendants/README_EN.md index 0eef8d8aadabc..80c05b7cf7609 100644 --- a/solution/1900-1999/1973.Count Nodes Equal to Sum of Descendants/README_EN.md +++ b/solution/1900-1999/1973.Count Nodes Equal to Sum of Descendants/README_EN.md @@ -1,4 +1,4 @@ -# [1973. Count Nodes Equal to Sum of Descendants](https://leetcode.com/problems/count-nodes-equal-to-sum-of-descendants) +# [1973. Count Nodes Equal to Sum of Descendants 🔒](https://leetcode.com/problems/count-nodes-equal-to-sum-of-descendants) [中文文档](/solution/1900-1999/1973.Count%20Nodes%20Equal%20to%20Sum%20of%20Descendants/README.md) diff --git a/solution/1900-1999/1983.Widest Pair of Indices With Equal Range Sum/README.md b/solution/1900-1999/1983.Widest Pair of Indices With Equal Range Sum/README.md index 235815eb54f3c..048a3096e9393 100644 --- a/solution/1900-1999/1983.Widest Pair of Indices With Equal Range Sum/README.md +++ b/solution/1900-1999/1983.Widest Pair of Indices With Equal Range Sum/README.md @@ -1,4 +1,4 @@ -# [1983. 范围和相等的最宽索引对](https://leetcode.cn/problems/widest-pair-of-indices-with-equal-range-sum) +# [1983. 范围和相等的最宽索引对 🔒](https://leetcode.cn/problems/widest-pair-of-indices-with-equal-range-sum) [English Version](/solution/1900-1999/1983.Widest%20Pair%20of%20Indices%20With%20Equal%20Range%20Sum/README_EN.md) diff --git a/solution/1900-1999/1983.Widest Pair of Indices With Equal Range Sum/README_EN.md b/solution/1900-1999/1983.Widest Pair of Indices With Equal Range Sum/README_EN.md index 4fc7c7a628c9b..5426607328377 100644 --- a/solution/1900-1999/1983.Widest Pair of Indices With Equal Range Sum/README_EN.md +++ b/solution/1900-1999/1983.Widest Pair of Indices With Equal Range Sum/README_EN.md @@ -1,4 +1,4 @@ -# [1983. Widest Pair of Indices With Equal Range Sum](https://leetcode.com/problems/widest-pair-of-indices-with-equal-range-sum) +# [1983. Widest Pair of Indices With Equal Range Sum 🔒](https://leetcode.com/problems/widest-pair-of-indices-with-equal-range-sum) [中文文档](/solution/1900-1999/1983.Widest%20Pair%20of%20Indices%20With%20Equal%20Range%20Sum/README.md) diff --git a/solution/1900-1999/1988.Find Cutoff Score for Each School/README.md b/solution/1900-1999/1988.Find Cutoff Score for Each School/README.md index bc45095814c78..e155c7a107bb9 100644 --- a/solution/1900-1999/1988.Find Cutoff Score for Each School/README.md +++ b/solution/1900-1999/1988.Find Cutoff Score for Each School/README.md @@ -1,4 +1,4 @@ -# [1988. 找出每所学校的最低分数要求](https://leetcode.cn/problems/find-cutoff-score-for-each-school) +# [1988. 找出每所学校的最低分数要求 🔒](https://leetcode.cn/problems/find-cutoff-score-for-each-school) [English Version](/solution/1900-1999/1988.Find%20Cutoff%20Score%20for%20Each%20School/README_EN.md) diff --git a/solution/1900-1999/1988.Find Cutoff Score for Each School/README_EN.md b/solution/1900-1999/1988.Find Cutoff Score for Each School/README_EN.md index 213ebff3ed883..7acafbd465822 100644 --- a/solution/1900-1999/1988.Find Cutoff Score for Each School/README_EN.md +++ b/solution/1900-1999/1988.Find Cutoff Score for Each School/README_EN.md @@ -1,4 +1,4 @@ -# [1988. Find Cutoff Score for Each School](https://leetcode.com/problems/find-cutoff-score-for-each-school) +# [1988. Find Cutoff Score for Each School 🔒](https://leetcode.com/problems/find-cutoff-score-for-each-school) [中文文档](/solution/1900-1999/1988.Find%20Cutoff%20Score%20for%20Each%20School/README.md) diff --git a/solution/1900-1999/1989.Maximum Number of People That Can Be Caught in Tag/README.md b/solution/1900-1999/1989.Maximum Number of People That Can Be Caught in Tag/README.md index ffdf456b5301a..c76ded80dc5ce 100644 --- a/solution/1900-1999/1989.Maximum Number of People That Can Be Caught in Tag/README.md +++ b/solution/1900-1999/1989.Maximum Number of People That Can Be Caught in Tag/README.md @@ -1,4 +1,4 @@ -# [1989. 捉迷藏中可捕获的最大人数](https://leetcode.cn/problems/maximum-number-of-people-that-can-be-caught-in-tag) +# [1989. 捉迷藏中可捕获的最大人数 🔒](https://leetcode.cn/problems/maximum-number-of-people-that-can-be-caught-in-tag) [English Version](/solution/1900-1999/1989.Maximum%20Number%20of%20People%20That%20Can%20Be%20Caught%20in%20Tag/README_EN.md) diff --git a/solution/1900-1999/1989.Maximum Number of People That Can Be Caught in Tag/README_EN.md b/solution/1900-1999/1989.Maximum Number of People That Can Be Caught in Tag/README_EN.md index 96708238de82c..38fa71f923a00 100644 --- a/solution/1900-1999/1989.Maximum Number of People That Can Be Caught in Tag/README_EN.md +++ b/solution/1900-1999/1989.Maximum Number of People That Can Be Caught in Tag/README_EN.md @@ -1,4 +1,4 @@ -# [1989. Maximum Number of People That Can Be Caught in Tag](https://leetcode.com/problems/maximum-number-of-people-that-can-be-caught-in-tag) +# [1989. Maximum Number of People That Can Be Caught in Tag 🔒](https://leetcode.com/problems/maximum-number-of-people-that-can-be-caught-in-tag) [中文文档](/solution/1900-1999/1989.Maximum%20Number%20of%20People%20That%20Can%20Be%20Caught%20in%20Tag/README.md) diff --git a/solution/1900-1999/1990.Count the Number of Experiments/README.md b/solution/1900-1999/1990.Count the Number of Experiments/README.md index b10d10003c5fa..fc6e0bf3f4f08 100644 --- a/solution/1900-1999/1990.Count the Number of Experiments/README.md +++ b/solution/1900-1999/1990.Count the Number of Experiments/README.md @@ -1,4 +1,4 @@ -# [1990. 统计实验的数量](https://leetcode.cn/problems/count-the-number-of-experiments) +# [1990. 统计实验的数量 🔒](https://leetcode.cn/problems/count-the-number-of-experiments) [English Version](/solution/1900-1999/1990.Count%20the%20Number%20of%20Experiments/README_EN.md) diff --git a/solution/1900-1999/1990.Count the Number of Experiments/README_EN.md b/solution/1900-1999/1990.Count the Number of Experiments/README_EN.md index 9e0691b1cbe23..be0a296194666 100644 --- a/solution/1900-1999/1990.Count the Number of Experiments/README_EN.md +++ b/solution/1900-1999/1990.Count the Number of Experiments/README_EN.md @@ -1,4 +1,4 @@ -# [1990. Count the Number of Experiments](https://leetcode.com/problems/count-the-number-of-experiments) +# [1990. Count the Number of Experiments 🔒](https://leetcode.com/problems/count-the-number-of-experiments) [中文文档](/solution/1900-1999/1990.Count%20the%20Number%20of%20Experiments/README.md) diff --git a/solution/1900-1999/1999.Smallest Greater Multiple Made of Two Digits/README.md b/solution/1900-1999/1999.Smallest Greater Multiple Made of Two Digits/README.md index 6df62523d60b5..652f2d15832ea 100644 --- a/solution/1900-1999/1999.Smallest Greater Multiple Made of Two Digits/README.md +++ b/solution/1900-1999/1999.Smallest Greater Multiple Made of Two Digits/README.md @@ -1,4 +1,4 @@ -# [1999. 最小的仅由两个数组成的倍数](https://leetcode.cn/problems/smallest-greater-multiple-made-of-two-digits) +# [1999. 最小的仅由两个数组成的倍数 🔒](https://leetcode.cn/problems/smallest-greater-multiple-made-of-two-digits) [English Version](/solution/1900-1999/1999.Smallest%20Greater%20Multiple%20Made%20of%20Two%20Digits/README_EN.md) diff --git a/solution/1900-1999/1999.Smallest Greater Multiple Made of Two Digits/README_EN.md b/solution/1900-1999/1999.Smallest Greater Multiple Made of Two Digits/README_EN.md index bb95e35897295..acba9e16eac2d 100644 --- a/solution/1900-1999/1999.Smallest Greater Multiple Made of Two Digits/README_EN.md +++ b/solution/1900-1999/1999.Smallest Greater Multiple Made of Two Digits/README_EN.md @@ -1,4 +1,4 @@ -# [1999. Smallest Greater Multiple Made of Two Digits](https://leetcode.com/problems/smallest-greater-multiple-made-of-two-digits) +# [1999. Smallest Greater Multiple Made of Two Digits 🔒](https://leetcode.com/problems/smallest-greater-multiple-made-of-two-digits) [中文文档](/solution/1900-1999/1999.Smallest%20Greater%20Multiple%20Made%20of%20Two%20Digits/README.md) diff --git a/solution/2000-2099/2004.The Number of Seniors and Juniors to Join the Company/README.md b/solution/2000-2099/2004.The Number of Seniors and Juniors to Join the Company/README.md index 49e9d7487c11f..e09b8a89d1b40 100644 --- a/solution/2000-2099/2004.The Number of Seniors and Juniors to Join the Company/README.md +++ b/solution/2000-2099/2004.The Number of Seniors and Juniors to Join the Company/README.md @@ -1,4 +1,4 @@ -# [2004. 职员招聘人数](https://leetcode.cn/problems/the-number-of-seniors-and-juniors-to-join-the-company) +# [2004. 职员招聘人数 🔒](https://leetcode.cn/problems/the-number-of-seniors-and-juniors-to-join-the-company) [English Version](/solution/2000-2099/2004.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company/README_EN.md) @@ -96,7 +96,7 @@ Candidates table: 相似题目： -- [2010. 职员招聘人数 II](https://github.com/doocs/leetcode/blob/main/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README.md) +- [2010. 职员招聘人数 🔒 II](https://github.com/doocs/leetcode/blob/main/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README.md) diff --git a/solution/2000-2099/2004.The Number of Seniors and Juniors to Join the Company/README_EN.md b/solution/2000-2099/2004.The Number of Seniors and Juniors to Join the Company/README_EN.md index b2997cdc8e2e4..120e7c18713d6 100644 --- a/solution/2000-2099/2004.The Number of Seniors and Juniors to Join the Company/README_EN.md +++ b/solution/2000-2099/2004.The Number of Seniors and Juniors to Join the Company/README_EN.md @@ -1,4 +1,4 @@ -# [2004. The Number of Seniors and Juniors to Join the Company](https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company) +# [2004. The Number of Seniors and Juniors to Join the Company 🔒](https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company) [中文文档](/solution/2000-2099/2004.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company/README.md) diff --git a/solution/2000-2099/2005.Subtree Removal Game with Fibonacci Tree/README.md b/solution/2000-2099/2005.Subtree Removal Game with Fibonacci Tree/README.md index ab2d997c5cb40..09bb67c9bb764 100644 --- a/solution/2000-2099/2005.Subtree Removal Game with Fibonacci Tree/README.md +++ b/solution/2000-2099/2005.Subtree Removal Game with Fibonacci Tree/README.md @@ -1,4 +1,4 @@ -# [2005. 斐波那契树的移除子树游戏](https://leetcode.cn/problems/subtree-removal-game-with-fibonacci-tree) +# [2005. 斐波那契树的移除子树游戏 🔒](https://leetcode.cn/problems/subtree-removal-game-with-fibonacci-tree) [English Version](/solution/2000-2099/2005.Subtree%20Removal%20Game%20with%20Fibonacci%20Tree/README_EN.md) diff --git a/solution/2000-2099/2005.Subtree Removal Game with Fibonacci Tree/README_EN.md b/solution/2000-2099/2005.Subtree Removal Game with Fibonacci Tree/README_EN.md index 1af97981cdb4e..141a55187fe83 100644 --- a/solution/2000-2099/2005.Subtree Removal Game with Fibonacci Tree/README_EN.md +++ b/solution/2000-2099/2005.Subtree Removal Game with Fibonacci Tree/README_EN.md @@ -1,4 +1,4 @@ -# [2005. Subtree Removal Game with Fibonacci Tree](https://leetcode.com/problems/subtree-removal-game-with-fibonacci-tree) +# [2005. Subtree Removal Game with Fibonacci Tree 🔒](https://leetcode.com/problems/subtree-removal-game-with-fibonacci-tree) [中文文档](/solution/2000-2099/2005.Subtree%20Removal%20Game%20with%20Fibonacci%20Tree/README.md) diff --git a/solution/2000-2099/2010.The Number of Seniors and Juniors to Join the Company II/README.md b/solution/2000-2099/2010.The Number of Seniors and Juniors to Join the Company II/README.md index 1d6bd07adcf43..064aae3426205 100644 --- a/solution/2000-2099/2010.The Number of Seniors and Juniors to Join the Company II/README.md +++ b/solution/2000-2099/2010.The Number of Seniors and Juniors to Join the Company II/README.md @@ -1,4 +1,4 @@ -# [2010. 职员招聘人数 II](https://leetcode.cn/problems/the-number-of-seniors-and-juniors-to-join-the-company-ii) +# [2010. 职员招聘人数 II 🔒](https://leetcode.cn/problems/the-number-of-seniors-and-juniors-to-join-the-company-ii) [English Version](/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README_EN.md) diff --git a/solution/2000-2099/2010.The Number of Seniors and Juniors to Join the Company II/README_EN.md b/solution/2000-2099/2010.The Number of Seniors and Juniors to Join the Company II/README_EN.md index 1ad72e3a24aa4..f0f85201f7172 100644 --- a/solution/2000-2099/2010.The Number of Seniors and Juniors to Join the Company II/README_EN.md +++ b/solution/2000-2099/2010.The Number of Seniors and Juniors to Join the Company II/README_EN.md @@ -1,4 +1,4 @@ -# [2010. The Number of Seniors and Juniors to Join the Company II](https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company-ii) +# [2010. The Number of Seniors and Juniors to Join the Company II 🔒](https://leetcode.com/problems/the-number-of-seniors-and-juniors-to-join-the-company-ii) [中文文档](/solution/2000-2099/2010.The%20Number%20of%20Seniors%20and%20Juniors%20to%20Join%20the%20Company%20II/README.md) diff --git a/solution/2000-2099/2015.Average Height of Buildings in Each Segment/README.md b/solution/2000-2099/2015.Average Height of Buildings in Each Segment/README.md index dd9cda504b84e..41b0bca6302a0 100644 --- a/solution/2000-2099/2015.Average Height of Buildings in Each Segment/README.md +++ b/solution/2000-2099/2015.Average Height of Buildings in Each Segment/README.md @@ -1,4 +1,4 @@ -# [2015. 每段建筑物的平均高度](https://leetcode.cn/problems/average-height-of-buildings-in-each-segment) +# [2015. 每段建筑物的平均高度 🔒](https://leetcode.cn/problems/average-height-of-buildings-in-each-segment) [English Version](/solution/2000-2099/2015.Average%20Height%20of%20Buildings%20in%20Each%20Segment/README_EN.md) diff --git a/solution/2000-2099/2015.Average Height of Buildings in Each Segment/README_EN.md b/solution/2000-2099/2015.Average Height of Buildings in Each Segment/README_EN.md index 6ddaec29517ce..a0b65b3e30493 100644 --- a/solution/2000-2099/2015.Average Height of Buildings in Each Segment/README_EN.md +++ b/solution/2000-2099/2015.Average Height of Buildings in Each Segment/README_EN.md @@ -1,4 +1,4 @@ -# [2015. Average Height of Buildings in Each Segment](https://leetcode.com/problems/average-height-of-buildings-in-each-segment) +# [2015. Average Height of Buildings in Each Segment 🔒](https://leetcode.com/problems/average-height-of-buildings-in-each-segment) [中文文档](/solution/2000-2099/2015.Average%20Height%20of%20Buildings%20in%20Each%20Segment/README.md) diff --git a/solution/2000-2099/2020.Number of Accounts That Did Not Stream/README.md b/solution/2000-2099/2020.Number of Accounts That Did Not Stream/README.md index 55421fe954ac8..dfe87a4284da4 100644 --- a/solution/2000-2099/2020.Number of Accounts That Did Not Stream/README.md +++ b/solution/2000-2099/2020.Number of Accounts That Did Not Stream/README.md @@ -1,4 +1,4 @@ -# [2020. 无流量的帐户数](https://leetcode.cn/problems/number-of-accounts-that-did-not-stream) +# [2020. 无流量的帐户数 🔒](https://leetcode.cn/problems/number-of-accounts-that-did-not-stream) [English Version](/solution/2000-2099/2020.Number%20of%20Accounts%20That%20Did%20Not%20Stream/README_EN.md) diff --git a/solution/2000-2099/2020.Number of Accounts That Did Not Stream/README_EN.md b/solution/2000-2099/2020.Number of Accounts That Did Not Stream/README_EN.md index 81ba45c09aa30..d4195f4324a5d 100644 --- a/solution/2000-2099/2020.Number of Accounts That Did Not Stream/README_EN.md +++ b/solution/2000-2099/2020.Number of Accounts That Did Not Stream/README_EN.md @@ -1,4 +1,4 @@ -# [2020. Number of Accounts That Did Not Stream](https://leetcode.com/problems/number-of-accounts-that-did-not-stream) +# [2020. Number of Accounts That Did Not Stream 🔒](https://leetcode.com/problems/number-of-accounts-that-did-not-stream) [中文文档](/solution/2000-2099/2020.Number%20of%20Accounts%20That%20Did%20Not%20Stream/README.md) diff --git a/solution/2000-2099/2021.Brightest Position on Street/README.md b/solution/2000-2099/2021.Brightest Position on Street/README.md index f0b29ea94eeb7..b450039657207 100644 --- a/solution/2000-2099/2021.Brightest Position on Street/README.md +++ b/solution/2000-2099/2021.Brightest Position on Street/README.md @@ -1,4 +1,4 @@ -# [2021. 街上最亮的位置](https://leetcode.cn/problems/brightest-position-on-street) +# [2021. 街上最亮的位置 🔒](https://leetcode.cn/problems/brightest-position-on-street) [English Version](/solution/2000-2099/2021.Brightest%20Position%20on%20Street/README_EN.md) diff --git a/solution/2000-2099/2021.Brightest Position on Street/README_EN.md b/solution/2000-2099/2021.Brightest Position on Street/README_EN.md index 3736a7174e796..76aa40f6613da 100644 --- a/solution/2000-2099/2021.Brightest Position on Street/README_EN.md +++ b/solution/2000-2099/2021.Brightest Position on Street/README_EN.md @@ -1,4 +1,4 @@ -# [2021. Brightest Position on Street](https://leetcode.com/problems/brightest-position-on-street) +# [2021. Brightest Position on Street 🔒](https://leetcode.com/problems/brightest-position-on-street) [中文文档](/solution/2000-2099/2021.Brightest%20Position%20on%20Street/README.md) diff --git a/solution/2000-2099/2026.Low-Quality Problems/README.md b/solution/2000-2099/2026.Low-Quality Problems/README.md index 4baa6f8191e00..9a102d86dd222 100644 --- a/solution/2000-2099/2026.Low-Quality Problems/README.md +++ b/solution/2000-2099/2026.Low-Quality Problems/README.md @@ -1,4 +1,4 @@ -# [2026. 低质量的问题](https://leetcode.cn/problems/low-quality-problems) +# [2026. 低质量的问题 🔒](https://leetcode.cn/problems/low-quality-problems) [English Version](/solution/2000-2099/2026.Low-Quality%20Problems/README_EN.md) diff --git a/solution/2000-2099/2026.Low-Quality Problems/README_EN.md b/solution/2000-2099/2026.Low-Quality Problems/README_EN.md index 61754e35c0b30..d4ac82736a412 100644 --- a/solution/2000-2099/2026.Low-Quality Problems/README_EN.md +++ b/solution/2000-2099/2026.Low-Quality Problems/README_EN.md @@ -1,4 +1,4 @@ -# [2026. Low-Quality Problems](https://leetcode.com/problems/low-quality-problems) +# [2026. Low-Quality Problems 🔒](https://leetcode.com/problems/low-quality-problems) [中文文档](/solution/2000-2099/2026.Low-Quality%20Problems/README.md) diff --git a/solution/2000-2099/2031.Count Subarrays With More Ones Than Zeros/README.md b/solution/2000-2099/2031.Count Subarrays With More Ones Than Zeros/README.md index f5e3bdd53c098..2b4bc02544a6e 100644 --- a/solution/2000-2099/2031.Count Subarrays With More Ones Than Zeros/README.md +++ b/solution/2000-2099/2031.Count Subarrays With More Ones Than Zeros/README.md @@ -1,4 +1,4 @@ -# [2031. 1 比 0 多的子数组个数](https://leetcode.cn/problems/count-subarrays-with-more-ones-than-zeros) +# [2031. 1 比 0 多的子数组个数 🔒](https://leetcode.cn/problems/count-subarrays-with-more-ones-than-zeros) [English Version](/solution/2000-2099/2031.Count%20Subarrays%20With%20More%20Ones%20Than%20Zeros/README_EN.md) diff --git a/solution/2000-2099/2031.Count Subarrays With More Ones Than Zeros/README_EN.md b/solution/2000-2099/2031.Count Subarrays With More Ones Than Zeros/README_EN.md index 78be213c7537e..de625ed649f6c 100644 --- a/solution/2000-2099/2031.Count Subarrays With More Ones Than Zeros/README_EN.md +++ b/solution/2000-2099/2031.Count Subarrays With More Ones Than Zeros/README_EN.md @@ -1,4 +1,4 @@ -# [2031. Count Subarrays With More Ones Than Zeros](https://leetcode.com/problems/count-subarrays-with-more-ones-than-zeros) +# [2031. Count Subarrays With More Ones Than Zeros 🔒](https://leetcode.com/problems/count-subarrays-with-more-ones-than-zeros) [中文文档](/solution/2000-2099/2031.Count%20Subarrays%20With%20More%20Ones%20Than%20Zeros/README.md) diff --git a/solution/2000-2099/2036.Maximum Alternating Subarray Sum/README.md b/solution/2000-2099/2036.Maximum Alternating Subarray Sum/README.md index 109651ad11ed6..edde523336234 100644 --- a/solution/2000-2099/2036.Maximum Alternating Subarray Sum/README.md +++ b/solution/2000-2099/2036.Maximum Alternating Subarray Sum/README.md @@ -1,4 +1,4 @@ -# [2036. 最大交替子数组和](https://leetcode.cn/problems/maximum-alternating-subarray-sum) +# [2036. 最大交替子数组和 🔒](https://leetcode.cn/problems/maximum-alternating-subarray-sum) [English Version](/solution/2000-2099/2036.Maximum%20Alternating%20Subarray%20Sum/README_EN.md) diff --git a/solution/2000-2099/2036.Maximum Alternating Subarray Sum/README_EN.md b/solution/2000-2099/2036.Maximum Alternating Subarray Sum/README_EN.md index d9eac1f59fd65..22ae78090dacf 100644 --- a/solution/2000-2099/2036.Maximum Alternating Subarray Sum/README_EN.md +++ b/solution/2000-2099/2036.Maximum Alternating Subarray Sum/README_EN.md @@ -1,4 +1,4 @@ -# [2036. Maximum Alternating Subarray Sum](https://leetcode.com/problems/maximum-alternating-subarray-sum) +# [2036. Maximum Alternating Subarray Sum 🔒](https://leetcode.com/problems/maximum-alternating-subarray-sum) [中文文档](/solution/2000-2099/2036.Maximum%20Alternating%20Subarray%20Sum/README.md) diff --git a/solution/2000-2099/2041.Accepted Candidates From the Interviews/README.md b/solution/2000-2099/2041.Accepted Candidates From the Interviews/README.md index 0b90983e36e57..ac82f5a385de9 100644 --- a/solution/2000-2099/2041.Accepted Candidates From the Interviews/README.md +++ b/solution/2000-2099/2041.Accepted Candidates From the Interviews/README.md @@ -1,4 +1,4 @@ -# [2041. 面试中被录取的候选人](https://leetcode.cn/problems/accepted-candidates-from-the-interviews) +# [2041. 面试中被录取的候选人 🔒](https://leetcode.cn/problems/accepted-candidates-from-the-interviews) [English Version](/solution/2000-2099/2041.Accepted%20Candidates%20From%20the%20Interviews/README_EN.md) diff --git a/solution/2000-2099/2041.Accepted Candidates From the Interviews/README_EN.md b/solution/2000-2099/2041.Accepted Candidates From the Interviews/README_EN.md index 45d2813e54e91..bd507491e5132 100644 --- a/solution/2000-2099/2041.Accepted Candidates From the Interviews/README_EN.md +++ b/solution/2000-2099/2041.Accepted Candidates From the Interviews/README_EN.md @@ -1,4 +1,4 @@ -# [2041. Accepted Candidates From the Interviews](https://leetcode.com/problems/accepted-candidates-from-the-interviews) +# [2041. Accepted Candidates From the Interviews 🔒](https://leetcode.com/problems/accepted-candidates-from-the-interviews) [中文文档](/solution/2000-2099/2041.Accepted%20Candidates%20From%20the%20Interviews/README.md) diff --git a/solution/2000-2099/2046.Sort Linked List Already Sorted Using Absolute Values/README.md b/solution/2000-2099/2046.Sort Linked List Already Sorted Using Absolute Values/README.md index 13639acfddbd8..ea538eacddfbb 100644 --- a/solution/2000-2099/2046.Sort Linked List Already Sorted Using Absolute Values/README.md +++ b/solution/2000-2099/2046.Sort Linked List Already Sorted Using Absolute Values/README.md @@ -1,4 +1,4 @@ -# [2046. 给按照绝对值排序的链表排序](https://leetcode.cn/problems/sort-linked-list-already-sorted-using-absolute-values) +# [2046. 给按照绝对值排序的链表排序 🔒](https://leetcode.cn/problems/sort-linked-list-already-sorted-using-absolute-values) [English Version](/solution/2000-2099/2046.Sort%20Linked%20List%20Already%20Sorted%20Using%20Absolute%20Values/README_EN.md) diff --git a/solution/2000-2099/2046.Sort Linked List Already Sorted Using Absolute Values/README_EN.md b/solution/2000-2099/2046.Sort Linked List Already Sorted Using Absolute Values/README_EN.md index b2732c58c1435..85837a666315e 100644 --- a/solution/2000-2099/2046.Sort Linked List Already Sorted Using Absolute Values/README_EN.md +++ b/solution/2000-2099/2046.Sort Linked List Already Sorted Using Absolute Values/README_EN.md @@ -1,4 +1,4 @@ -# [2046. Sort Linked List Already Sorted Using Absolute Values](https://leetcode.com/problems/sort-linked-list-already-sorted-using-absolute-values) +# [2046. Sort Linked List Already Sorted Using Absolute Values 🔒](https://leetcode.com/problems/sort-linked-list-already-sorted-using-absolute-values) [中文文档](/solution/2000-2099/2046.Sort%20Linked%20List%20Already%20Sorted%20Using%20Absolute%20Values/README.md) diff --git a/solution/2000-2099/2051.The Category of Each Member in the Store/README.md b/solution/2000-2099/2051.The Category of Each Member in the Store/README.md index ee4c2b1540b35..fb27bd86b77e8 100644 --- a/solution/2000-2099/2051.The Category of Each Member in the Store/README.md +++ b/solution/2000-2099/2051.The Category of Each Member in the Store/README.md @@ -1,4 +1,4 @@ -# [2051. 商店中每个成员的级别](https://leetcode.cn/problems/the-category-of-each-member-in-the-store) +# [2051. 商店中每个成员的级别 🔒](https://leetcode.cn/problems/the-category-of-each-member-in-the-store) [English Version](/solution/2000-2099/2051.The%20Category%20of%20Each%20Member%20in%20the%20Store/README_EN.md) diff --git a/solution/2000-2099/2051.The Category of Each Member in the Store/README_EN.md b/solution/2000-2099/2051.The Category of Each Member in the Store/README_EN.md index 106d56ab810dd..2ce19bb40ed91 100644 --- a/solution/2000-2099/2051.The Category of Each Member in the Store/README_EN.md +++ b/solution/2000-2099/2051.The Category of Each Member in the Store/README_EN.md @@ -1,4 +1,4 @@ -# [2051. The Category of Each Member in the Store](https://leetcode.com/problems/the-category-of-each-member-in-the-store) +# [2051. The Category of Each Member in the Store 🔒](https://leetcode.com/problems/the-category-of-each-member-in-the-store) [中文文档](/solution/2000-2099/2051.The%20Category%20of%20Each%20Member%20in%20the%20Store/README.md) diff --git a/solution/2000-2099/2052.Minimum Cost to Separate Sentence Into Rows/README.md b/solution/2000-2099/2052.Minimum Cost to Separate Sentence Into Rows/README.md index adff9c4b30050..fcae910c779e6 100644 --- a/solution/2000-2099/2052.Minimum Cost to Separate Sentence Into Rows/README.md +++ b/solution/2000-2099/2052.Minimum Cost to Separate Sentence Into Rows/README.md @@ -1,4 +1,4 @@ -# [2052. 将句子分隔成行的最低成本](https://leetcode.cn/problems/minimum-cost-to-separate-sentence-into-rows) +# [2052. 将句子分隔成行的最低成本 🔒](https://leetcode.cn/problems/minimum-cost-to-separate-sentence-into-rows) [English Version](/solution/2000-2099/2052.Minimum%20Cost%20to%20Separate%20Sentence%20Into%20Rows/README_EN.md) diff --git a/solution/2000-2099/2052.Minimum Cost to Separate Sentence Into Rows/README_EN.md b/solution/2000-2099/2052.Minimum Cost to Separate Sentence Into Rows/README_EN.md index 28999b3a8931e..78d4778c55f85 100644 --- a/solution/2000-2099/2052.Minimum Cost to Separate Sentence Into Rows/README_EN.md +++ b/solution/2000-2099/2052.Minimum Cost to Separate Sentence Into Rows/README_EN.md @@ -1,4 +1,4 @@ -# [2052. Minimum Cost to Separate Sentence Into Rows](https://leetcode.com/problems/minimum-cost-to-separate-sentence-into-rows) +# [2052. Minimum Cost to Separate Sentence Into Rows 🔒](https://leetcode.com/problems/minimum-cost-to-separate-sentence-into-rows) [中文文档](/solution/2000-2099/2052.Minimum%20Cost%20to%20Separate%20Sentence%20Into%20Rows/README.md) diff --git a/solution/2000-2099/2061.Number of Spaces Cleaning Robot Cleaned/README.md b/solution/2000-2099/2061.Number of Spaces Cleaning Robot Cleaned/README.md index 69fd6844717d3..6f84ad3c0e472 100644 --- a/solution/2000-2099/2061.Number of Spaces Cleaning Robot Cleaned/README.md +++ b/solution/2000-2099/2061.Number of Spaces Cleaning Robot Cleaned/README.md @@ -1,4 +1,4 @@ -# [2061. 扫地机器人清扫过的空间个数](https://leetcode.cn/problems/number-of-spaces-cleaning-robot-cleaned) +# [2061. 扫地机器人清扫过的空间个数 🔒](https://leetcode.cn/problems/number-of-spaces-cleaning-robot-cleaned) [English Version](/solution/2000-2099/2061.Number%20of%20Spaces%20Cleaning%20Robot%20Cleaned/README_EN.md) diff --git a/solution/2000-2099/2061.Number of Spaces Cleaning Robot Cleaned/README_EN.md b/solution/2000-2099/2061.Number of Spaces Cleaning Robot Cleaned/README_EN.md index 934909bd2c7f5..f36637179514e 100644 --- a/solution/2000-2099/2061.Number of Spaces Cleaning Robot Cleaned/README_EN.md +++ b/solution/2000-2099/2061.Number of Spaces Cleaning Robot Cleaned/README_EN.md @@ -1,4 +1,4 @@ -# [2061. Number of Spaces Cleaning Robot Cleaned](https://leetcode.com/problems/number-of-spaces-cleaning-robot-cleaned) +# [2061. Number of Spaces Cleaning Robot Cleaned 🔒](https://leetcode.com/problems/number-of-spaces-cleaning-robot-cleaned) [中文文档](/solution/2000-2099/2061.Number%20of%20Spaces%20Cleaning%20Robot%20Cleaned/README.md) diff --git a/solution/2000-2099/2066.Account Balance/README.md b/solution/2000-2099/2066.Account Balance/README.md index 7bf7fb108bf53..66eed32688c16 100644 --- a/solution/2000-2099/2066.Account Balance/README.md +++ b/solution/2000-2099/2066.Account Balance/README.md @@ -1,4 +1,4 @@ -# [2066. 账户余额](https://leetcode.cn/problems/account-balance) +# [2066. 账户余额 🔒](https://leetcode.cn/problems/account-balance) [English Version](/solution/2000-2099/2066.Account%20Balance/README_EN.md) diff --git a/solution/2000-2099/2066.Account Balance/README_EN.md b/solution/2000-2099/2066.Account Balance/README_EN.md index 39fa875905b42..64a822362bc9e 100644 --- a/solution/2000-2099/2066.Account Balance/README_EN.md +++ b/solution/2000-2099/2066.Account Balance/README_EN.md @@ -1,4 +1,4 @@ -# [2066. Account Balance](https://leetcode.com/problems/account-balance) +# [2066. Account Balance 🔒](https://leetcode.com/problems/account-balance) [中文文档](/solution/2000-2099/2066.Account%20Balance/README.md) diff --git a/solution/2000-2099/2067.Number of Equal Count Substrings/README.md b/solution/2000-2099/2067.Number of Equal Count Substrings/README.md index 8504fbb886139..7bfe2dc6aacae 100644 --- a/solution/2000-2099/2067.Number of Equal Count Substrings/README.md +++ b/solution/2000-2099/2067.Number of Equal Count Substrings/README.md @@ -1,4 +1,4 @@ -# [2067. 等计数子串的数量](https://leetcode.cn/problems/number-of-equal-count-substrings) +# [2067. 等计数子串的数量 🔒](https://leetcode.cn/problems/number-of-equal-count-substrings) [English Version](/solution/2000-2099/2067.Number%20of%20Equal%20Count%20Substrings/README_EN.md) diff --git a/solution/2000-2099/2067.Number of Equal Count Substrings/README_EN.md b/solution/2000-2099/2067.Number of Equal Count Substrings/README_EN.md index 6f2f598610518..fb2cb7bf41bd3 100644 --- a/solution/2000-2099/2067.Number of Equal Count Substrings/README_EN.md +++ b/solution/2000-2099/2067.Number of Equal Count Substrings/README_EN.md @@ -1,4 +1,4 @@ -# [2067. Number of Equal Count Substrings](https://leetcode.com/problems/number-of-equal-count-substrings) +# [2067. Number of Equal Count Substrings 🔒](https://leetcode.com/problems/number-of-equal-count-substrings) [中文文档](/solution/2000-2099/2067.Number%20of%20Equal%20Count%20Substrings/README.md) diff --git a/solution/2000-2099/2072.The Winner University/README.md b/solution/2000-2099/2072.The Winner University/README.md index 49506e5a644c3..1f7191f2e1633 100644 --- a/solution/2000-2099/2072.The Winner University/README.md +++ b/solution/2000-2099/2072.The Winner University/README.md @@ -1,4 +1,4 @@ -# [2072. 赢得比赛的大学](https://leetcode.cn/problems/the-winner-university) +# [2072. 赢得比赛的大学 🔒](https://leetcode.cn/problems/the-winner-university) [English Version](/solution/2000-2099/2072.The%20Winner%20University/README_EN.md) diff --git a/solution/2000-2099/2072.The Winner University/README_EN.md b/solution/2000-2099/2072.The Winner University/README_EN.md index d7e5ae0305f86..2c0e5f2fe1b07 100644 --- a/solution/2000-2099/2072.The Winner University/README_EN.md +++ b/solution/2000-2099/2072.The Winner University/README_EN.md @@ -1,4 +1,4 @@ -# [2072. The Winner University](https://leetcode.com/problems/the-winner-university) +# [2072. The Winner University 🔒](https://leetcode.com/problems/the-winner-university) [中文文档](/solution/2000-2099/2072.The%20Winner%20University/README.md) diff --git a/solution/2000-2099/2077.Paths in Maze That Lead to Same Room/README.md b/solution/2000-2099/2077.Paths in Maze That Lead to Same Room/README.md index a77b933286f1b..a5802c08cfc02 100644 --- a/solution/2000-2099/2077.Paths in Maze That Lead to Same Room/README.md +++ b/solution/2000-2099/2077.Paths in Maze That Lead to Same Room/README.md @@ -1,4 +1,4 @@ -# [2077. 殊途同归](https://leetcode.cn/problems/paths-in-maze-that-lead-to-same-room) +# [2077. 殊途同归 🔒](https://leetcode.cn/problems/paths-in-maze-that-lead-to-same-room) [English Version](/solution/2000-2099/2077.Paths%20in%20Maze%20That%20Lead%20to%20Same%20Room/README_EN.md) diff --git a/solution/2000-2099/2077.Paths in Maze That Lead to Same Room/README_EN.md b/solution/2000-2099/2077.Paths in Maze That Lead to Same Room/README_EN.md index 4680e9e6955e2..fead54fbe3909 100644 --- a/solution/2000-2099/2077.Paths in Maze That Lead to Same Room/README_EN.md +++ b/solution/2000-2099/2077.Paths in Maze That Lead to Same Room/README_EN.md @@ -1,4 +1,4 @@ -# [2077. Paths in Maze That Lead to Same Room](https://leetcode.com/problems/paths-in-maze-that-lead-to-same-room) +# [2077. Paths in Maze That Lead to Same Room 🔒](https://leetcode.com/problems/paths-in-maze-that-lead-to-same-room) [中文文档](/solution/2000-2099/2077.Paths%20in%20Maze%20That%20Lead%20to%20Same%20Room/README.md) diff --git a/solution/2000-2099/2082.The Number of Rich Customers/README.md b/solution/2000-2099/2082.The Number of Rich Customers/README.md index 8266afcbfddf5..96ea00210cec2 100644 --- a/solution/2000-2099/2082.The Number of Rich Customers/README.md +++ b/solution/2000-2099/2082.The Number of Rich Customers/README.md @@ -1,4 +1,4 @@ -# [2082. 富有客户的数量](https://leetcode.cn/problems/the-number-of-rich-customers) +# [2082. 富有客户的数量 🔒](https://leetcode.cn/problems/the-number-of-rich-customers) [English Version](/solution/2000-2099/2082.The%20Number%20of%20Rich%20Customers/README_EN.md) diff --git a/solution/2000-2099/2082.The Number of Rich Customers/README_EN.md b/solution/2000-2099/2082.The Number of Rich Customers/README_EN.md index 49b64e47ae1b0..8cd2bfce9f655 100644 --- a/solution/2000-2099/2082.The Number of Rich Customers/README_EN.md +++ b/solution/2000-2099/2082.The Number of Rich Customers/README_EN.md @@ -1,4 +1,4 @@ -# [2082. The Number of Rich Customers](https://leetcode.com/problems/the-number-of-rich-customers) +# [2082. The Number of Rich Customers 🔒](https://leetcode.com/problems/the-number-of-rich-customers) [中文文档](/solution/2000-2099/2082.The%20Number%20of%20Rich%20Customers/README.md) diff --git a/solution/2000-2099/2083.Substrings That Begin and End With the Same Letter/README.md b/solution/2000-2099/2083.Substrings That Begin and End With the Same Letter/README.md index b5e4dfe0f2d04..528e4bf314992 100644 --- a/solution/2000-2099/2083.Substrings That Begin and End With the Same Letter/README.md +++ b/solution/2000-2099/2083.Substrings That Begin and End With the Same Letter/README.md @@ -1,4 +1,4 @@ -# [2083. 求以相同字母开头和结尾的子串总数](https://leetcode.cn/problems/substrings-that-begin-and-end-with-the-same-letter) +# [2083. 求以相同字母开头和结尾的子串总数 🔒](https://leetcode.cn/problems/substrings-that-begin-and-end-with-the-same-letter) [English Version](/solution/2000-2099/2083.Substrings%20That%20Begin%20and%20End%20With%20the%20Same%20Letter/README_EN.md) diff --git a/solution/2000-2099/2083.Substrings That Begin and End With the Same Letter/README_EN.md b/solution/2000-2099/2083.Substrings That Begin and End With the Same Letter/README_EN.md index 39aeca539c866..b3e9130ad922c 100644 --- a/solution/2000-2099/2083.Substrings That Begin and End With the Same Letter/README_EN.md +++ b/solution/2000-2099/2083.Substrings That Begin and End With the Same Letter/README_EN.md @@ -1,4 +1,4 @@ -# [2083. Substrings That Begin and End With the Same Letter](https://leetcode.com/problems/substrings-that-begin-and-end-with-the-same-letter) +# [2083. Substrings That Begin and End With the Same Letter 🔒](https://leetcode.com/problems/substrings-that-begin-and-end-with-the-same-letter) [中文文档](/solution/2000-2099/2083.Substrings%20That%20Begin%20and%20End%20With%20the%20Same%20Letter/README.md) diff --git a/solution/2000-2099/2084.Drop Type 1 Orders for Customers With Type 0 Orders/README.md b/solution/2000-2099/2084.Drop Type 1 Orders for Customers With Type 0 Orders/README.md index 773216fc1988c..93ce08cf752a0 100644 --- a/solution/2000-2099/2084.Drop Type 1 Orders for Customers With Type 0 Orders/README.md +++ b/solution/2000-2099/2084.Drop Type 1 Orders for Customers With Type 0 Orders/README.md @@ -1,4 +1,4 @@ -# [2084. 为订单类型为 0 的客户删除类型为 1 的订单](https://leetcode.cn/problems/drop-type-1-orders-for-customers-with-type-0-orders) +# [2084. 为订单类型为 0 的客户删除类型为 1 的订单 🔒](https://leetcode.cn/problems/drop-type-1-orders-for-customers-with-type-0-orders) [English Version](/solution/2000-2099/2084.Drop%20Type%201%20Orders%20for%20Customers%20With%20Type%200%20Orders/README_EN.md) diff --git a/solution/2000-2099/2084.Drop Type 1 Orders for Customers With Type 0 Orders/README_EN.md b/solution/2000-2099/2084.Drop Type 1 Orders for Customers With Type 0 Orders/README_EN.md index 8a8e7e8524b15..4584866b38498 100644 --- a/solution/2000-2099/2084.Drop Type 1 Orders for Customers With Type 0 Orders/README_EN.md +++ b/solution/2000-2099/2084.Drop Type 1 Orders for Customers With Type 0 Orders/README_EN.md @@ -1,4 +1,4 @@ -# [2084. Drop Type 1 Orders for Customers With Type 0 Orders](https://leetcode.com/problems/drop-type-1-orders-for-customers-with-type-0-orders) +# [2084. Drop Type 1 Orders for Customers With Type 0 Orders 🔒](https://leetcode.com/problems/drop-type-1-orders-for-customers-with-type-0-orders) [中文文档](/solution/2000-2099/2084.Drop%20Type%201%20Orders%20for%20Customers%20With%20Type%200%20Orders/README.md) diff --git a/solution/2000-2099/2093.Minimum Cost to Reach City With Discounts/README.md b/solution/2000-2099/2093.Minimum Cost to Reach City With Discounts/README.md index 6b250885b39db..72181fea0623a 100644 --- a/solution/2000-2099/2093.Minimum Cost to Reach City With Discounts/README.md +++ b/solution/2000-2099/2093.Minimum Cost to Reach City With Discounts/README.md @@ -1,4 +1,4 @@ -# [2093. 前往目标城市的最小费用](https://leetcode.cn/problems/minimum-cost-to-reach-city-with-discounts) +# [2093. 前往目标城市的最小费用 🔒](https://leetcode.cn/problems/minimum-cost-to-reach-city-with-discounts) [English Version](/solution/2000-2099/2093.Minimum%20Cost%20to%20Reach%20City%20With%20Discounts/README_EN.md) diff --git a/solution/2000-2099/2093.Minimum Cost to Reach City With Discounts/README_EN.md b/solution/2000-2099/2093.Minimum Cost to Reach City With Discounts/README_EN.md index cf99b0369b22c..f16b126530ac1 100644 --- a/solution/2000-2099/2093.Minimum Cost to Reach City With Discounts/README_EN.md +++ b/solution/2000-2099/2093.Minimum Cost to Reach City With Discounts/README_EN.md @@ -1,4 +1,4 @@ -# [2093. Minimum Cost to Reach City With Discounts](https://leetcode.com/problems/minimum-cost-to-reach-city-with-discounts) +# [2093. Minimum Cost to Reach City With Discounts 🔒](https://leetcode.com/problems/minimum-cost-to-reach-city-with-discounts) [中文文档](/solution/2000-2099/2093.Minimum%20Cost%20to%20Reach%20City%20With%20Discounts/README.md) diff --git a/solution/2000-2099/2098.Subsequence of Size K With the Largest Even Sum/README.md b/solution/2000-2099/2098.Subsequence of Size K With the Largest Even Sum/README.md index 1261175c9b096..257db19202099 100644 --- a/solution/2000-2099/2098.Subsequence of Size K With the Largest Even Sum/README.md +++ b/solution/2000-2099/2098.Subsequence of Size K With the Largest Even Sum/README.md @@ -1,4 +1,4 @@ -# [2098. 长度为 K 的最大偶数和子序列](https://leetcode.cn/problems/subsequence-of-size-k-with-the-largest-even-sum) +# [2098. 长度为 K 的最大偶数和子序列 🔒](https://leetcode.cn/problems/subsequence-of-size-k-with-the-largest-even-sum) [English Version](/solution/2000-2099/2098.Subsequence%20of%20Size%20K%20With%20the%20Largest%20Even%20Sum/README_EN.md) diff --git a/solution/2000-2099/2098.Subsequence of Size K With the Largest Even Sum/README_EN.md b/solution/2000-2099/2098.Subsequence of Size K With the Largest Even Sum/README_EN.md index 3841baa77ba59..cb403cf6d920b 100644 --- a/solution/2000-2099/2098.Subsequence of Size K With the Largest Even Sum/README_EN.md +++ b/solution/2000-2099/2098.Subsequence of Size K With the Largest Even Sum/README_EN.md @@ -1,4 +1,4 @@ -# [2098. Subsequence of Size K With the Largest Even Sum](https://leetcode.com/problems/subsequence-of-size-k-with-the-largest-even-sum) +# [2098. Subsequence of Size K With the Largest Even Sum 🔒](https://leetcode.com/problems/subsequence-of-size-k-with-the-largest-even-sum) [中文文档](/solution/2000-2099/2098.Subsequence%20of%20Size%20K%20With%20the%20Largest%20Even%20Sum/README.md) diff --git a/solution/2100-2199/2107.Number of Unique Flavors After Sharing K Candies/README.md b/solution/2100-2199/2107.Number of Unique Flavors After Sharing K Candies/README.md index 9b27191e038ff..79b0de282215a 100644 --- a/solution/2100-2199/2107.Number of Unique Flavors After Sharing K Candies/README.md +++ b/solution/2100-2199/2107.Number of Unique Flavors After Sharing K Candies/README.md @@ -1,4 +1,4 @@ -# [2107. 分享 K 个糖果后独特口味的数量](https://leetcode.cn/problems/number-of-unique-flavors-after-sharing-k-candies) +# [2107. 分享 K 个糖果后独特口味的数量 🔒](https://leetcode.cn/problems/number-of-unique-flavors-after-sharing-k-candies) [English Version](/solution/2100-2199/2107.Number%20of%20Unique%20Flavors%20After%20Sharing%20K%20Candies/README_EN.md) diff --git a/solution/2100-2199/2107.Number of Unique Flavors After Sharing K Candies/README_EN.md b/solution/2100-2199/2107.Number of Unique Flavors After Sharing K Candies/README_EN.md index 39d75808de9a7..57f6b79811f79 100644 --- a/solution/2100-2199/2107.Number of Unique Flavors After Sharing K Candies/README_EN.md +++ b/solution/2100-2199/2107.Number of Unique Flavors After Sharing K Candies/README_EN.md @@ -1,4 +1,4 @@ -# [2107. Number of Unique Flavors After Sharing K Candies](https://leetcode.com/problems/number-of-unique-flavors-after-sharing-k-candies) +# [2107. Number of Unique Flavors After Sharing K Candies 🔒](https://leetcode.com/problems/number-of-unique-flavors-after-sharing-k-candies) [中文文档](/solution/2100-2199/2107.Number%20of%20Unique%20Flavors%20After%20Sharing%20K%20Candies/README.md) diff --git a/solution/2100-2199/2112.The Airport With the Most Traffic/README.md b/solution/2100-2199/2112.The Airport With the Most Traffic/README.md index b2677f8476d46..41bb28d4dd8ec 100644 --- a/solution/2100-2199/2112.The Airport With the Most Traffic/README.md +++ b/solution/2100-2199/2112.The Airport With the Most Traffic/README.md @@ -1,4 +1,4 @@ -# [2112. 最繁忙的机场](https://leetcode.cn/problems/the-airport-with-the-most-traffic) +# [2112. 最繁忙的机场 🔒](https://leetcode.cn/problems/the-airport-with-the-most-traffic) [English Version](/solution/2100-2199/2112.The%20Airport%20With%20the%20Most%20Traffic/README_EN.md) diff --git a/solution/2100-2199/2112.The Airport With the Most Traffic/README_EN.md b/solution/2100-2199/2112.The Airport With the Most Traffic/README_EN.md index aac0e779f490b..31b046bffbf88 100644 --- a/solution/2100-2199/2112.The Airport With the Most Traffic/README_EN.md +++ b/solution/2100-2199/2112.The Airport With the Most Traffic/README_EN.md @@ -1,4 +1,4 @@ -# [2112. The Airport With the Most Traffic](https://leetcode.com/problems/the-airport-with-the-most-traffic) +# [2112. The Airport With the Most Traffic 🔒](https://leetcode.com/problems/the-airport-with-the-most-traffic) [中文文档](/solution/2100-2199/2112.The%20Airport%20With%20the%20Most%20Traffic/README.md) diff --git a/solution/2100-2199/2113.Elements in Array After Removing and Replacing Elements/README.md b/solution/2100-2199/2113.Elements in Array After Removing and Replacing Elements/README.md index fd62bce3bddec..aa2908d874433 100644 --- a/solution/2100-2199/2113.Elements in Array After Removing and Replacing Elements/README.md +++ b/solution/2100-2199/2113.Elements in Array After Removing and Replacing Elements/README.md @@ -1,4 +1,4 @@ -# [2113. 查询删除和添加元素后的数组](https://leetcode.cn/problems/elements-in-array-after-removing-and-replacing-elements) +# [2113. 查询删除和添加元素后的数组 🔒](https://leetcode.cn/problems/elements-in-array-after-removing-and-replacing-elements) [English Version](/solution/2100-2199/2113.Elements%20in%20Array%20After%20Removing%20and%20Replacing%20Elements/README_EN.md) diff --git a/solution/2100-2199/2113.Elements in Array After Removing and Replacing Elements/README_EN.md b/solution/2100-2199/2113.Elements in Array After Removing and Replacing Elements/README_EN.md index 34037e2b4d39d..01692d3c5dce2 100644 --- a/solution/2100-2199/2113.Elements in Array After Removing and Replacing Elements/README_EN.md +++ b/solution/2100-2199/2113.Elements in Array After Removing and Replacing Elements/README_EN.md @@ -1,4 +1,4 @@ -# [2113. Elements in Array After Removing and Replacing Elements](https://leetcode.com/problems/elements-in-array-after-removing-and-replacing-elements) +# [2113. Elements in Array After Removing and Replacing Elements 🔒](https://leetcode.com/problems/elements-in-array-after-removing-and-replacing-elements) [中文文档](/solution/2100-2199/2113.Elements%20in%20Array%20After%20Removing%20and%20Replacing%20Elements/README.md) diff --git a/solution/2100-2199/2118.Build the Equation/README.md b/solution/2100-2199/2118.Build the Equation/README.md index d70cad2ce992d..8d9e342c522e7 100644 --- a/solution/2100-2199/2118.Build the Equation/README.md +++ b/solution/2100-2199/2118.Build the Equation/README.md @@ -1,4 +1,4 @@ -# [2118. 建立方程](https://leetcode.cn/problems/build-the-equation) +# [2118. 建立方程 🔒](https://leetcode.cn/problems/build-the-equation) [English Version](/solution/2100-2199/2118.Build%20the%20Equation/README_EN.md) diff --git a/solution/2100-2199/2118.Build the Equation/README_EN.md b/solution/2100-2199/2118.Build the Equation/README_EN.md index d8122fcd9ab53..95ff729709508 100644 --- a/solution/2100-2199/2118.Build the Equation/README_EN.md +++ b/solution/2100-2199/2118.Build the Equation/README_EN.md @@ -1,4 +1,4 @@ -# [2118. Build the Equation](https://leetcode.com/problems/build-the-equation) +# [2118. Build the Equation 🔒](https://leetcode.com/problems/build-the-equation) [中文文档](/solution/2100-2199/2118.Build%20the%20Equation/README.md) diff --git a/solution/2100-2199/2123.Minimum Operations to Remove Adjacent Ones in Matrix/README.md b/solution/2100-2199/2123.Minimum Operations to Remove Adjacent Ones in Matrix/README.md index 99e92e4498452..1cd96d7237762 100644 --- a/solution/2100-2199/2123.Minimum Operations to Remove Adjacent Ones in Matrix/README.md +++ b/solution/2100-2199/2123.Minimum Operations to Remove Adjacent Ones in Matrix/README.md @@ -1,4 +1,4 @@ -# [2123. 使矩阵中的 1 互不相邻的最小操作数](https://leetcode.cn/problems/minimum-operations-to-remove-adjacent-ones-in-matrix) +# [2123. 使矩阵中的 1 互不相邻的最小操作数 🔒](https://leetcode.cn/problems/minimum-operations-to-remove-adjacent-ones-in-matrix) [English Version](/solution/2100-2199/2123.Minimum%20Operations%20to%20Remove%20Adjacent%20Ones%20in%20Matrix/README_EN.md) diff --git a/solution/2100-2199/2123.Minimum Operations to Remove Adjacent Ones in Matrix/README_EN.md b/solution/2100-2199/2123.Minimum Operations to Remove Adjacent Ones in Matrix/README_EN.md index 912c81eb7580a..633f0cc39ebf5 100644 --- a/solution/2100-2199/2123.Minimum Operations to Remove Adjacent Ones in Matrix/README_EN.md +++ b/solution/2100-2199/2123.Minimum Operations to Remove Adjacent Ones in Matrix/README_EN.md @@ -1,4 +1,4 @@ -# [2123. Minimum Operations to Remove Adjacent Ones in Matrix](https://leetcode.com/problems/minimum-operations-to-remove-adjacent-ones-in-matrix) +# [2123. Minimum Operations to Remove Adjacent Ones in Matrix 🔒](https://leetcode.com/problems/minimum-operations-to-remove-adjacent-ones-in-matrix) [中文文档](/solution/2100-2199/2123.Minimum%20Operations%20to%20Remove%20Adjacent%20Ones%20in%20Matrix/README.md) diff --git a/solution/2100-2199/2128.Remove All Ones With Row and Column Flips/README.md b/solution/2100-2199/2128.Remove All Ones With Row and Column Flips/README.md index d5d414a8a6090..e1b757573452b 100644 --- a/solution/2100-2199/2128.Remove All Ones With Row and Column Flips/README.md +++ b/solution/2100-2199/2128.Remove All Ones With Row and Column Flips/README.md @@ -1,4 +1,4 @@ -# [2128. 通过翻转行或列来去除所有的 1](https://leetcode.cn/problems/remove-all-ones-with-row-and-column-flips) +# [2128. 通过翻转行或列来去除所有的 1 🔒](https://leetcode.cn/problems/remove-all-ones-with-row-and-column-flips) [English Version](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README_EN.md) diff --git a/solution/2100-2199/2128.Remove All Ones With Row and Column Flips/README_EN.md b/solution/2100-2199/2128.Remove All Ones With Row and Column Flips/README_EN.md index e3bcab6656d1f..5712f14ae8245 100644 --- a/solution/2100-2199/2128.Remove All Ones With Row and Column Flips/README_EN.md +++ b/solution/2100-2199/2128.Remove All Ones With Row and Column Flips/README_EN.md @@ -1,4 +1,4 @@ -# [2128. Remove All Ones With Row and Column Flips](https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips) +# [2128. Remove All Ones With Row and Column Flips 🔒](https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips) [中文文档](/solution/2100-2199/2128.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips/README.md) diff --git a/solution/2100-2199/2137.Pour Water Between Buckets to Make Water Levels Equal/README.md b/solution/2100-2199/2137.Pour Water Between Buckets to Make Water Levels Equal/README.md index 5f07ba66bf25c..d604720bf527a 100644 --- a/solution/2100-2199/2137.Pour Water Between Buckets to Make Water Levels Equal/README.md +++ b/solution/2100-2199/2137.Pour Water Between Buckets to Make Water Levels Equal/README.md @@ -1,4 +1,4 @@ -# [2137. 通过倒水操作让所有的水桶所含水量相等](https://leetcode.cn/problems/pour-water-between-buckets-to-make-water-levels-equal) +# [2137. 通过倒水操作让所有的水桶所含水量相等 🔒](https://leetcode.cn/problems/pour-water-between-buckets-to-make-water-levels-equal) [English Version](/solution/2100-2199/2137.Pour%20Water%20Between%20Buckets%20to%20Make%20Water%20Levels%20Equal/README_EN.md) diff --git a/solution/2100-2199/2137.Pour Water Between Buckets to Make Water Levels Equal/README_EN.md b/solution/2100-2199/2137.Pour Water Between Buckets to Make Water Levels Equal/README_EN.md index 259767a74e8b9..b2ff84a47b500 100644 --- a/solution/2100-2199/2137.Pour Water Between Buckets to Make Water Levels Equal/README_EN.md +++ b/solution/2100-2199/2137.Pour Water Between Buckets to Make Water Levels Equal/README_EN.md @@ -1,4 +1,4 @@ -# [2137. Pour Water Between Buckets to Make Water Levels Equal](https://leetcode.com/problems/pour-water-between-buckets-to-make-water-levels-equal) +# [2137. Pour Water Between Buckets to Make Water Levels Equal 🔒](https://leetcode.com/problems/pour-water-between-buckets-to-make-water-levels-equal) [中文文档](/solution/2100-2199/2137.Pour%20Water%20Between%20Buckets%20to%20Make%20Water%20Levels%20Equal/README.md) diff --git a/solution/2100-2199/2142.The Number of Passengers in Each Bus I/README.md b/solution/2100-2199/2142.The Number of Passengers in Each Bus I/README.md index f721142c6236f..bc65c36f23e04 100644 --- a/solution/2100-2199/2142.The Number of Passengers in Each Bus I/README.md +++ b/solution/2100-2199/2142.The Number of Passengers in Each Bus I/README.md @@ -1,4 +1,4 @@ -# [2142. 每辆车的乘客人数 I](https://leetcode.cn/problems/the-number-of-passengers-in-each-bus-i) +# [2142. 每辆车的乘客人数 I 🔒](https://leetcode.cn/problems/the-number-of-passengers-in-each-bus-i) [English Version](/solution/2100-2199/2142.The%20Number%20of%20Passengers%20in%20Each%20Bus%20I/README_EN.md) diff --git a/solution/2100-2199/2142.The Number of Passengers in Each Bus I/README_EN.md b/solution/2100-2199/2142.The Number of Passengers in Each Bus I/README_EN.md index be2d0ced807b0..c615abd50ddde 100644 --- a/solution/2100-2199/2142.The Number of Passengers in Each Bus I/README_EN.md +++ b/solution/2100-2199/2142.The Number of Passengers in Each Bus I/README_EN.md @@ -1,4 +1,4 @@ -# [2142. The Number of Passengers in Each Bus I](https://leetcode.com/problems/the-number-of-passengers-in-each-bus-i) +# [2142. The Number of Passengers in Each Bus I 🔒](https://leetcode.com/problems/the-number-of-passengers-in-each-bus-i) [中文文档](/solution/2100-2199/2142.The%20Number%20of%20Passengers%20in%20Each%20Bus%20I/README.md) diff --git a/solution/2100-2199/2143.Choose Numbers From Two Arrays in Range/README.md b/solution/2100-2199/2143.Choose Numbers From Two Arrays in Range/README.md index 8833b593e443f..b06007ce9d93d 100644 --- a/solution/2100-2199/2143.Choose Numbers From Two Arrays in Range/README.md +++ b/solution/2100-2199/2143.Choose Numbers From Two Arrays in Range/README.md @@ -1,4 +1,4 @@ -# [2143. 在两个数组的区间中选取数字](https://leetcode.cn/problems/choose-numbers-from-two-arrays-in-range) +# [2143. 在两个数组的区间中选取数字 🔒](https://leetcode.cn/problems/choose-numbers-from-two-arrays-in-range) [English Version](/solution/2100-2199/2143.Choose%20Numbers%20From%20Two%20Arrays%20in%20Range/README_EN.md) diff --git a/solution/2100-2199/2143.Choose Numbers From Two Arrays in Range/README_EN.md b/solution/2100-2199/2143.Choose Numbers From Two Arrays in Range/README_EN.md index 95e4427a028bc..33ff98e1d5a45 100644 --- a/solution/2100-2199/2143.Choose Numbers From Two Arrays in Range/README_EN.md +++ b/solution/2100-2199/2143.Choose Numbers From Two Arrays in Range/README_EN.md @@ -1,4 +1,4 @@ -# [2143. Choose Numbers From Two Arrays in Range](https://leetcode.com/problems/choose-numbers-from-two-arrays-in-range) +# [2143. Choose Numbers From Two Arrays in Range 🔒](https://leetcode.com/problems/choose-numbers-from-two-arrays-in-range) [中文文档](/solution/2100-2199/2143.Choose%20Numbers%20From%20Two%20Arrays%20in%20Range/README.md) diff --git a/solution/2100-2199/2152.Minimum Number of Lines to Cover Points/README.md b/solution/2100-2199/2152.Minimum Number of Lines to Cover Points/README.md index 95ad845285283..a5ab8771b4a17 100644 --- a/solution/2100-2199/2152.Minimum Number of Lines to Cover Points/README.md +++ b/solution/2100-2199/2152.Minimum Number of Lines to Cover Points/README.md @@ -1,4 +1,4 @@ -# [2152. 穿过所有点的所需最少直线数量](https://leetcode.cn/problems/minimum-number-of-lines-to-cover-points) +# [2152. 穿过所有点的所需最少直线数量 🔒](https://leetcode.cn/problems/minimum-number-of-lines-to-cover-points) [English Version](/solution/2100-2199/2152.Minimum%20Number%20of%20Lines%20to%20Cover%20Points/README_EN.md) diff --git a/solution/2100-2199/2152.Minimum Number of Lines to Cover Points/README_EN.md b/solution/2100-2199/2152.Minimum Number of Lines to Cover Points/README_EN.md index 76a645363a2e8..b491d855c6fc3 100644 --- a/solution/2100-2199/2152.Minimum Number of Lines to Cover Points/README_EN.md +++ b/solution/2100-2199/2152.Minimum Number of Lines to Cover Points/README_EN.md @@ -1,4 +1,4 @@ -# [2152. Minimum Number of Lines to Cover Points](https://leetcode.com/problems/minimum-number-of-lines-to-cover-points) +# [2152. Minimum Number of Lines to Cover Points 🔒](https://leetcode.com/problems/minimum-number-of-lines-to-cover-points) [中文文档](/solution/2100-2199/2152.Minimum%20Number%20of%20Lines%20to%20Cover%20Points/README.md) diff --git a/solution/2100-2199/2153.The Number of Passengers in Each Bus II/README.md b/solution/2100-2199/2153.The Number of Passengers in Each Bus II/README.md index b79da363050f3..9d3d1ac14fe20 100644 --- a/solution/2100-2199/2153.The Number of Passengers in Each Bus II/README.md +++ b/solution/2100-2199/2153.The Number of Passengers in Each Bus II/README.md @@ -1,4 +1,4 @@ -# [2153. 每辆车的乘客人数 II](https://leetcode.cn/problems/the-number-of-passengers-in-each-bus-ii) +# [2153. 每辆车的乘客人数 II 🔒](https://leetcode.cn/problems/the-number-of-passengers-in-each-bus-ii) [English Version](/solution/2100-2199/2153.The%20Number%20of%20Passengers%20in%20Each%20Bus%20II/README_EN.md) diff --git a/solution/2100-2199/2153.The Number of Passengers in Each Bus II/README_EN.md b/solution/2100-2199/2153.The Number of Passengers in Each Bus II/README_EN.md index 2ce74a3030b2a..296478a05227e 100644 --- a/solution/2100-2199/2153.The Number of Passengers in Each Bus II/README_EN.md +++ b/solution/2100-2199/2153.The Number of Passengers in Each Bus II/README_EN.md @@ -1,4 +1,4 @@ -# [2153. The Number of Passengers in Each Bus II](https://leetcode.com/problems/the-number-of-passengers-in-each-bus-ii) +# [2153. The Number of Passengers in Each Bus II 🔒](https://leetcode.com/problems/the-number-of-passengers-in-each-bus-ii) [中文文档](/solution/2100-2199/2153.The%20Number%20of%20Passengers%20in%20Each%20Bus%20II/README.md) diff --git a/solution/2100-2199/2158.Amount of New Area Painted Each Day/README.md b/solution/2100-2199/2158.Amount of New Area Painted Each Day/README.md index 062d17267938f..0a3cf1fba1c64 100644 --- a/solution/2100-2199/2158.Amount of New Area Painted Each Day/README.md +++ b/solution/2100-2199/2158.Amount of New Area Painted Each Day/README.md @@ -1,4 +1,4 @@ -# [2158. 每天绘制新区域的数量](https://leetcode.cn/problems/amount-of-new-area-painted-each-day) +# [2158. 每天绘制新区域的数量 🔒](https://leetcode.cn/problems/amount-of-new-area-painted-each-day) [English Version](/solution/2100-2199/2158.Amount%20of%20New%20Area%20Painted%20Each%20Day/README_EN.md) diff --git a/solution/2100-2199/2158.Amount of New Area Painted Each Day/README_EN.md b/solution/2100-2199/2158.Amount of New Area Painted Each Day/README_EN.md index 727a99e1eb673..81d19cd5dc45e 100644 --- a/solution/2100-2199/2158.Amount of New Area Painted Each Day/README_EN.md +++ b/solution/2100-2199/2158.Amount of New Area Painted Each Day/README_EN.md @@ -1,4 +1,4 @@ -# [2158. Amount of New Area Painted Each Day](https://leetcode.com/problems/amount-of-new-area-painted-each-day) +# [2158. Amount of New Area Painted Each Day 🔒](https://leetcode.com/problems/amount-of-new-area-painted-each-day) [中文文档](/solution/2100-2199/2158.Amount%20of%20New%20Area%20Painted%20Each%20Day/README.md) diff --git a/solution/2100-2199/2159.Order Two Columns Independently/README.md b/solution/2100-2199/2159.Order Two Columns Independently/README.md index 626d0d3f71ad8..2a0dac9d37237 100644 --- a/solution/2100-2199/2159.Order Two Columns Independently/README.md +++ b/solution/2100-2199/2159.Order Two Columns Independently/README.md @@ -1,4 +1,4 @@ -# [2159. 分别排序两列](https://leetcode.cn/problems/order-two-columns-independently) +# [2159. 分别排序两列 🔒](https://leetcode.cn/problems/order-two-columns-independently) [English Version](/solution/2100-2199/2159.Order%20Two%20Columns%20Independently/README_EN.md) diff --git a/solution/2100-2199/2159.Order Two Columns Independently/README_EN.md b/solution/2100-2199/2159.Order Two Columns Independently/README_EN.md index fd5326a178854..e5dd51c444f41 100644 --- a/solution/2100-2199/2159.Order Two Columns Independently/README_EN.md +++ b/solution/2100-2199/2159.Order Two Columns Independently/README_EN.md @@ -1,4 +1,4 @@ -# [2159. Order Two Columns Independently](https://leetcode.com/problems/order-two-columns-independently) +# [2159. Order Two Columns Independently 🔒](https://leetcode.com/problems/order-two-columns-independently) [中文文档](/solution/2100-2199/2159.Order%20Two%20Columns%20Independently/README.md) diff --git a/solution/2100-2199/2168.Unique Substrings With Equal Digit Frequency/README.md b/solution/2100-2199/2168.Unique Substrings With Equal Digit Frequency/README.md index b2a9249861aaf..fac589aa7b47d 100644 --- a/solution/2100-2199/2168.Unique Substrings With Equal Digit Frequency/README.md +++ b/solution/2100-2199/2168.Unique Substrings With Equal Digit Frequency/README.md @@ -1,4 +1,4 @@ -# [2168. 每个数字的频率都相同的独特子字符串的数量](https://leetcode.cn/problems/unique-substrings-with-equal-digit-frequency) +# [2168. 每个数字的频率都相同的独特子字符串的数量 🔒](https://leetcode.cn/problems/unique-substrings-with-equal-digit-frequency) [English Version](/solution/2100-2199/2168.Unique%20Substrings%20With%20Equal%20Digit%20Frequency/README_EN.md) diff --git a/solution/2100-2199/2168.Unique Substrings With Equal Digit Frequency/README_EN.md b/solution/2100-2199/2168.Unique Substrings With Equal Digit Frequency/README_EN.md index 66069e98bb158..d572bd812c638 100644 --- a/solution/2100-2199/2168.Unique Substrings With Equal Digit Frequency/README_EN.md +++ b/solution/2100-2199/2168.Unique Substrings With Equal Digit Frequency/README_EN.md @@ -1,4 +1,4 @@ -# [2168. Unique Substrings With Equal Digit Frequency](https://leetcode.com/problems/unique-substrings-with-equal-digit-frequency) +# [2168. Unique Substrings With Equal Digit Frequency 🔒](https://leetcode.com/problems/unique-substrings-with-equal-digit-frequency) [中文文档](/solution/2100-2199/2168.Unique%20Substrings%20With%20Equal%20Digit%20Frequency/README.md) diff --git a/solution/2100-2199/2173.Longest Winning Streak/README.md b/solution/2100-2199/2173.Longest Winning Streak/README.md index 9a848328315d1..65a2187ebeae2 100644 --- a/solution/2100-2199/2173.Longest Winning Streak/README.md +++ b/solution/2100-2199/2173.Longest Winning Streak/README.md @@ -1,4 +1,4 @@ -# [2173. 最多连胜的次数](https://leetcode.cn/problems/longest-winning-streak) +# [2173. 最多连胜的次数 🔒](https://leetcode.cn/problems/longest-winning-streak) [English Version](/solution/2100-2199/2173.Longest%20Winning%20Streak/README_EN.md) diff --git a/solution/2100-2199/2173.Longest Winning Streak/README_EN.md b/solution/2100-2199/2173.Longest Winning Streak/README_EN.md index f46aaf75c5a64..7a42ee994b3ea 100644 --- a/solution/2100-2199/2173.Longest Winning Streak/README_EN.md +++ b/solution/2100-2199/2173.Longest Winning Streak/README_EN.md @@ -1,4 +1,4 @@ -# [2173. Longest Winning Streak](https://leetcode.com/problems/longest-winning-streak) +# [2173. Longest Winning Streak 🔒](https://leetcode.com/problems/longest-winning-streak) [中文文档](/solution/2100-2199/2173.Longest%20Winning%20Streak/README.md) diff --git a/solution/2100-2199/2174.Remove All Ones With Row and Column Flips II/README.md b/solution/2100-2199/2174.Remove All Ones With Row and Column Flips II/README.md index 39d3dac0872b5..4833d0462898c 100644 --- a/solution/2100-2199/2174.Remove All Ones With Row and Column Flips II/README.md +++ b/solution/2100-2199/2174.Remove All Ones With Row and Column Flips II/README.md @@ -1,4 +1,4 @@ -# [2174. 通过翻转行或列来去除所有的 1 II](https://leetcode.cn/problems/remove-all-ones-with-row-and-column-flips-ii) +# [2174. 通过翻转行或列来去除所有的 1 II 🔒](https://leetcode.cn/problems/remove-all-ones-with-row-and-column-flips-ii) [English Version](/solution/2100-2199/2174.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips%20II/README_EN.md) diff --git a/solution/2100-2199/2174.Remove All Ones With Row and Column Flips II/README_EN.md b/solution/2100-2199/2174.Remove All Ones With Row and Column Flips II/README_EN.md index dbc2f4a5f42b5..58a0a44e26810 100644 --- a/solution/2100-2199/2174.Remove All Ones With Row and Column Flips II/README_EN.md +++ b/solution/2100-2199/2174.Remove All Ones With Row and Column Flips II/README_EN.md @@ -1,4 +1,4 @@ -# [2174. Remove All Ones With Row and Column Flips II](https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips-ii) +# [2174. Remove All Ones With Row and Column Flips II 🔒](https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips-ii) [中文文档](/solution/2100-2199/2174.Remove%20All%20Ones%20With%20Row%20and%20Column%20Flips%20II/README.md) diff --git a/solution/2100-2199/2175.The Change in Global Rankings/README.md b/solution/2100-2199/2175.The Change in Global Rankings/README.md index cac10011455fc..cb60bf7149688 100644 --- a/solution/2100-2199/2175.The Change in Global Rankings/README.md +++ b/solution/2100-2199/2175.The Change in Global Rankings/README.md @@ -1,4 +1,4 @@ -# [2175. 世界排名的变化](https://leetcode.cn/problems/the-change-in-global-rankings) +# [2175. 世界排名的变化 🔒](https://leetcode.cn/problems/the-change-in-global-rankings) [English Version](/solution/2100-2199/2175.The%20Change%20in%20Global%20Rankings/README_EN.md) diff --git a/solution/2100-2199/2175.The Change in Global Rankings/README_EN.md b/solution/2100-2199/2175.The Change in Global Rankings/README_EN.md index fa828c01fcbbf..759aa7c2a9b85 100644 --- a/solution/2100-2199/2175.The Change in Global Rankings/README_EN.md +++ b/solution/2100-2199/2175.The Change in Global Rankings/README_EN.md @@ -1,4 +1,4 @@ -# [2175. The Change in Global Rankings](https://leetcode.com/problems/the-change-in-global-rankings) +# [2175. The Change in Global Rankings 🔒](https://leetcode.com/problems/the-change-in-global-rankings) [中文文档](/solution/2100-2199/2175.The%20Change%20in%20Global%20Rankings/README.md) diff --git a/solution/2100-2199/2184.Number of Ways to Build Sturdy Brick Wall/README.md b/solution/2100-2199/2184.Number of Ways to Build Sturdy Brick Wall/README.md index 22266f01d24bc..25ec61b371483 100644 --- a/solution/2100-2199/2184.Number of Ways to Build Sturdy Brick Wall/README.md +++ b/solution/2100-2199/2184.Number of Ways to Build Sturdy Brick Wall/README.md @@ -1,4 +1,4 @@ -# [2184. 建造坚实的砖墙的方法数](https://leetcode.cn/problems/number-of-ways-to-build-sturdy-brick-wall) +# [2184. 建造坚实的砖墙的方法数 🔒](https://leetcode.cn/problems/number-of-ways-to-build-sturdy-brick-wall) [English Version](/solution/2100-2199/2184.Number%20of%20Ways%20to%20Build%20Sturdy%20Brick%20Wall/README_EN.md) diff --git a/solution/2100-2199/2184.Number of Ways to Build Sturdy Brick Wall/README_EN.md b/solution/2100-2199/2184.Number of Ways to Build Sturdy Brick Wall/README_EN.md index f0469bfe052bc..bdd01e011a979 100644 --- a/solution/2100-2199/2184.Number of Ways to Build Sturdy Brick Wall/README_EN.md +++ b/solution/2100-2199/2184.Number of Ways to Build Sturdy Brick Wall/README_EN.md @@ -1,4 +1,4 @@ -# [2184. Number of Ways to Build Sturdy Brick Wall](https://leetcode.com/problems/number-of-ways-to-build-sturdy-brick-wall) +# [2184. Number of Ways to Build Sturdy Brick Wall 🔒](https://leetcode.com/problems/number-of-ways-to-build-sturdy-brick-wall) [中文文档](/solution/2100-2199/2184.Number%20of%20Ways%20to%20Build%20Sturdy%20Brick%20Wall/README.md) diff --git a/solution/2100-2199/2189.Number of Ways to Build House of Cards/README.md b/solution/2100-2199/2189.Number of Ways to Build House of Cards/README.md index 37aa745a7074e..ab6bfd9481de7 100644 --- a/solution/2100-2199/2189.Number of Ways to Build House of Cards/README.md +++ b/solution/2100-2199/2189.Number of Ways to Build House of Cards/README.md @@ -1,4 +1,4 @@ -# [2189. 建造纸牌屋的方法数](https://leetcode.cn/problems/number-of-ways-to-build-house-of-cards) +# [2189. 建造纸牌屋的方法数 🔒](https://leetcode.cn/problems/number-of-ways-to-build-house-of-cards) [English Version](/solution/2100-2199/2189.Number%20of%20Ways%20to%20Build%20House%20of%20Cards/README_EN.md) diff --git a/solution/2100-2199/2189.Number of Ways to Build House of Cards/README_EN.md b/solution/2100-2199/2189.Number of Ways to Build House of Cards/README_EN.md index b37d05a197a84..476745386f241 100644 --- a/solution/2100-2199/2189.Number of Ways to Build House of Cards/README_EN.md +++ b/solution/2100-2199/2189.Number of Ways to Build House of Cards/README_EN.md @@ -1,4 +1,4 @@ -# [2189. Number of Ways to Build House of Cards](https://leetcode.com/problems/number-of-ways-to-build-house-of-cards) +# [2189. Number of Ways to Build House of Cards 🔒](https://leetcode.com/problems/number-of-ways-to-build-house-of-cards) [中文文档](/solution/2100-2199/2189.Number%20of%20Ways%20to%20Build%20House%20of%20Cards/README.md) diff --git a/solution/2100-2199/2198.Number of Single Divisor Triplets/README.md b/solution/2100-2199/2198.Number of Single Divisor Triplets/README.md index c5ece8ec49a3c..29bab925ae91b 100644 --- a/solution/2100-2199/2198.Number of Single Divisor Triplets/README.md +++ b/solution/2100-2199/2198.Number of Single Divisor Triplets/README.md @@ -1,4 +1,4 @@ -# [2198. 单因数三元组](https://leetcode.cn/problems/number-of-single-divisor-triplets) +# [2198. 单因数三元组 🔒](https://leetcode.cn/problems/number-of-single-divisor-triplets) [English Version](/solution/2100-2199/2198.Number%20of%20Single%20Divisor%20Triplets/README_EN.md) diff --git a/solution/2100-2199/2198.Number of Single Divisor Triplets/README_EN.md b/solution/2100-2199/2198.Number of Single Divisor Triplets/README_EN.md index 85814a04a8c68..0f207e78688c4 100644 --- a/solution/2100-2199/2198.Number of Single Divisor Triplets/README_EN.md +++ b/solution/2100-2199/2198.Number of Single Divisor Triplets/README_EN.md @@ -1,4 +1,4 @@ -# [2198. Number of Single Divisor Triplets](https://leetcode.com/problems/number-of-single-divisor-triplets) +# [2198. Number of Single Divisor Triplets 🔒](https://leetcode.com/problems/number-of-single-divisor-triplets) [中文文档](/solution/2100-2199/2198.Number%20of%20Single%20Divisor%20Triplets/README.md) diff --git a/solution/2100-2199/2199.Finding the Topic of Each Post/README.md b/solution/2100-2199/2199.Finding the Topic of Each Post/README.md index 95f07f25d4052..952c17a23adc6 100644 --- a/solution/2100-2199/2199.Finding the Topic of Each Post/README.md +++ b/solution/2100-2199/2199.Finding the Topic of Each Post/README.md @@ -1,4 +1,4 @@ -# [2199. 找到每篇文章的主题](https://leetcode.cn/problems/finding-the-topic-of-each-post) +# [2199. 找到每篇文章的主题 🔒](https://leetcode.cn/problems/finding-the-topic-of-each-post) [English Version](/solution/2100-2199/2199.Finding%20the%20Topic%20of%20Each%20Post/README_EN.md) diff --git a/solution/2100-2199/2199.Finding the Topic of Each Post/README_EN.md b/solution/2100-2199/2199.Finding the Topic of Each Post/README_EN.md index 799514820ea2a..5ce30f708857b 100644 --- a/solution/2100-2199/2199.Finding the Topic of Each Post/README_EN.md +++ b/solution/2100-2199/2199.Finding the Topic of Each Post/README_EN.md @@ -1,4 +1,4 @@ -# [2199. Finding the Topic of Each Post](https://leetcode.com/problems/finding-the-topic-of-each-post) +# [2199. Finding the Topic of Each Post 🔒](https://leetcode.com/problems/finding-the-topic-of-each-post) [中文文档](/solution/2100-2199/2199.Finding%20the%20Topic%20of%20Each%20Post/README.md) diff --git a/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README.md b/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README.md index dbdabe887dee4..b18cac56b5d07 100644 --- a/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README.md +++ b/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README.md @@ -1,4 +1,4 @@ -# [2204. 无向图中到环的距离](https://leetcode.cn/problems/distance-to-a-cycle-in-undirected-graph) +# [2204. 无向图中到环的距离 🔒](https://leetcode.cn/problems/distance-to-a-cycle-in-undirected-graph) [English Version](/solution/2200-2299/2204.Distance%20to%20a%20Cycle%20in%20Undirected%20Graph/README_EN.md) diff --git a/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README_EN.md b/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README_EN.md index fb2eef2e6f53d..3da1fc3263b57 100644 --- a/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README_EN.md +++ b/solution/2200-2299/2204.Distance to a Cycle in Undirected Graph/README_EN.md @@ -1,4 +1,4 @@ -# [2204. Distance to a Cycle in Undirected Graph](https://leetcode.com/problems/distance-to-a-cycle-in-undirected-graph) +# [2204. Distance to a Cycle in Undirected Graph 🔒](https://leetcode.com/problems/distance-to-a-cycle-in-undirected-graph) [中文文档](/solution/2200-2299/2204.Distance%20to%20a%20Cycle%20in%20Undirected%20Graph/README.md) diff --git a/solution/2200-2299/2205.The Number of Users That Are Eligible for Discount/README.md b/solution/2200-2299/2205.The Number of Users That Are Eligible for Discount/README.md index f17682fe65235..c03dbf36e3163 100644 --- a/solution/2200-2299/2205.The Number of Users That Are Eligible for Discount/README.md +++ b/solution/2200-2299/2205.The Number of Users That Are Eligible for Discount/README.md @@ -1,4 +1,4 @@ -# [2205. 有资格享受折扣的用户数量](https://leetcode.cn/problems/the-number-of-users-that-are-eligible-for-discount) +# [2205. 有资格享受折扣的用户数量 🔒](https://leetcode.cn/problems/the-number-of-users-that-are-eligible-for-discount) [English Version](/solution/2200-2299/2205.The%20Number%20of%20Users%20That%20Are%20Eligible%20for%20Discount/README_EN.md) diff --git a/solution/2200-2299/2205.The Number of Users That Are Eligible for Discount/README_EN.md b/solution/2200-2299/2205.The Number of Users That Are Eligible for Discount/README_EN.md index 45987edba7630..897f1c4d2db4c 100644 --- a/solution/2200-2299/2205.The Number of Users That Are Eligible for Discount/README_EN.md +++ b/solution/2200-2299/2205.The Number of Users That Are Eligible for Discount/README_EN.md @@ -1,4 +1,4 @@ -# [2205. The Number of Users That Are Eligible for Discount](https://leetcode.com/problems/the-number-of-users-that-are-eligible-for-discount) +# [2205. The Number of Users That Are Eligible for Discount 🔒](https://leetcode.com/problems/the-number-of-users-that-are-eligible-for-discount) [中文文档](/solution/2200-2299/2205.The%20Number%20of%20Users%20That%20Are%20Eligible%20for%20Discount/README.md) diff --git a/solution/2200-2299/2214.Minimum Health to Beat Game/README.md b/solution/2200-2299/2214.Minimum Health to Beat Game/README.md index 53d7e3ec58971..1cf645ab72987 100644 --- a/solution/2200-2299/2214.Minimum Health to Beat Game/README.md +++ b/solution/2200-2299/2214.Minimum Health to Beat Game/README.md @@ -1,4 +1,4 @@ -# [2214. 通关游戏所需的最低生命值](https://leetcode.cn/problems/minimum-health-to-beat-game) +# [2214. 通关游戏所需的最低生命值 🔒](https://leetcode.cn/problems/minimum-health-to-beat-game) [English Version](/solution/2200-2299/2214.Minimum%20Health%20to%20Beat%20Game/README_EN.md) diff --git a/solution/2200-2299/2214.Minimum Health to Beat Game/README_EN.md b/solution/2200-2299/2214.Minimum Health to Beat Game/README_EN.md index 0f24da63287c7..bcba11d85f37d 100644 --- a/solution/2200-2299/2214.Minimum Health to Beat Game/README_EN.md +++ b/solution/2200-2299/2214.Minimum Health to Beat Game/README_EN.md @@ -1,4 +1,4 @@ -# [2214. Minimum Health to Beat Game](https://leetcode.com/problems/minimum-health-to-beat-game) +# [2214. Minimum Health to Beat Game 🔒](https://leetcode.com/problems/minimum-health-to-beat-game) [中文文档](/solution/2200-2299/2214.Minimum%20Health%20to%20Beat%20Game/README.md) diff --git a/solution/2200-2299/2219.Maximum Sum Score of Array/README.md b/solution/2200-2299/2219.Maximum Sum Score of Array/README.md index e6cff4a7d1198..4c0d144c5fe37 100644 --- a/solution/2200-2299/2219.Maximum Sum Score of Array/README.md +++ b/solution/2200-2299/2219.Maximum Sum Score of Array/README.md @@ -1,4 +1,4 @@ -# [2219. 数组的最大总分](https://leetcode.cn/problems/maximum-sum-score-of-array) +# [2219. 数组的最大总分 🔒](https://leetcode.cn/problems/maximum-sum-score-of-array) [English Version](/solution/2200-2299/2219.Maximum%20Sum%20Score%20of%20Array/README_EN.md) diff --git a/solution/2200-2299/2219.Maximum Sum Score of Array/README_EN.md b/solution/2200-2299/2219.Maximum Sum Score of Array/README_EN.md index c5f3c8bcbefd9..8149ac22ef407 100644 --- a/solution/2200-2299/2219.Maximum Sum Score of Array/README_EN.md +++ b/solution/2200-2299/2219.Maximum Sum Score of Array/README_EN.md @@ -1,4 +1,4 @@ -# [2219. Maximum Sum Score of Array](https://leetcode.com/problems/maximum-sum-score-of-array) +# [2219. Maximum Sum Score of Array 🔒](https://leetcode.com/problems/maximum-sum-score-of-array) [中文文档](/solution/2200-2299/2219.Maximum%20Sum%20Score%20of%20Array/README.md) diff --git a/solution/2200-2299/2228.Users With Two Purchases Within Seven Days/README.md b/solution/2200-2299/2228.Users With Two Purchases Within Seven Days/README.md index 80813d8e624d3..a367908a65450 100644 --- a/solution/2200-2299/2228.Users With Two Purchases Within Seven Days/README.md +++ b/solution/2200-2299/2228.Users With Two Purchases Within Seven Days/README.md @@ -1,4 +1,4 @@ -# [2228. 7 天内两次购买的用户](https://leetcode.cn/problems/users-with-two-purchases-within-seven-days) +# [2228. 7 天内两次购买的用户 🔒](https://leetcode.cn/problems/users-with-two-purchases-within-seven-days) [English Version](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README_EN.md) diff --git a/solution/2200-2299/2228.Users With Two Purchases Within Seven Days/README_EN.md b/solution/2200-2299/2228.Users With Two Purchases Within Seven Days/README_EN.md index c9f6a8fa43e9f..b22ecfa978aa5 100644 --- a/solution/2200-2299/2228.Users With Two Purchases Within Seven Days/README_EN.md +++ b/solution/2200-2299/2228.Users With Two Purchases Within Seven Days/README_EN.md @@ -1,4 +1,4 @@ -# [2228. Users With Two Purchases Within Seven Days](https://leetcode.com/problems/users-with-two-purchases-within-seven-days) +# [2228. Users With Two Purchases Within Seven Days 🔒](https://leetcode.com/problems/users-with-two-purchases-within-seven-days) [中文文档](/solution/2200-2299/2228.Users%20With%20Two%20Purchases%20Within%20Seven%20Days/README.md) diff --git a/solution/2200-2299/2229.Check if an Array Is Consecutive/README.md b/solution/2200-2299/2229.Check if an Array Is Consecutive/README.md index 528d97bdd233c..6309f8e00afae 100644 --- a/solution/2200-2299/2229.Check if an Array Is Consecutive/README.md +++ b/solution/2200-2299/2229.Check if an Array Is Consecutive/README.md @@ -1,4 +1,4 @@ -# [2229. 检查数组是否连贯](https://leetcode.cn/problems/check-if-an-array-is-consecutive) +# [2229. 检查数组是否连贯 🔒](https://leetcode.cn/problems/check-if-an-array-is-consecutive) [English Version](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README_EN.md) diff --git a/solution/2200-2299/2229.Check if an Array Is Consecutive/README_EN.md b/solution/2200-2299/2229.Check if an Array Is Consecutive/README_EN.md index c8947f552109c..be2d25621b63f 100644 --- a/solution/2200-2299/2229.Check if an Array Is Consecutive/README_EN.md +++ b/solution/2200-2299/2229.Check if an Array Is Consecutive/README_EN.md @@ -1,4 +1,4 @@ -# [2229. Check if an Array Is Consecutive](https://leetcode.com/problems/check-if-an-array-is-consecutive) +# [2229. Check if an Array Is Consecutive 🔒](https://leetcode.com/problems/check-if-an-array-is-consecutive) [中文文档](/solution/2200-2299/2229.Check%20if%20an%20Array%20Is%20Consecutive/README.md) diff --git a/solution/2200-2299/2230.The Users That Are Eligible for Discount/README.md b/solution/2200-2299/2230.The Users That Are Eligible for Discount/README.md index d938f07e05892..e533fb5e928f1 100644 --- a/solution/2200-2299/2230.The Users That Are Eligible for Discount/README.md +++ b/solution/2200-2299/2230.The Users That Are Eligible for Discount/README.md @@ -1,4 +1,4 @@ -# [2230. 查找可享受优惠的用户](https://leetcode.cn/problems/the-users-that-are-eligible-for-discount) +# [2230. 查找可享受优惠的用户 🔒](https://leetcode.cn/problems/the-users-that-are-eligible-for-discount) [English Version](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README_EN.md) diff --git a/solution/2200-2299/2230.The Users That Are Eligible for Discount/README_EN.md b/solution/2200-2299/2230.The Users That Are Eligible for Discount/README_EN.md index b3c499e6fe4d9..71664f2001e03 100644 --- a/solution/2200-2299/2230.The Users That Are Eligible for Discount/README_EN.md +++ b/solution/2200-2299/2230.The Users That Are Eligible for Discount/README_EN.md @@ -1,4 +1,4 @@ -# [2230. The Users That Are Eligible for Discount](https://leetcode.com/problems/the-users-that-are-eligible-for-discount) +# [2230. The Users That Are Eligible for Discount 🔒](https://leetcode.com/problems/the-users-that-are-eligible-for-discount) [中文文档](/solution/2200-2299/2230.The%20Users%20That%20Are%20Eligible%20for%20Discount/README.md) diff --git a/solution/2200-2299/2237.Count Positions on Street With Required Brightness/README.md b/solution/2200-2299/2237.Count Positions on Street With Required Brightness/README.md index f70056b2c61ec..2181f87c512be 100644 --- a/solution/2200-2299/2237.Count Positions on Street With Required Brightness/README.md +++ b/solution/2200-2299/2237.Count Positions on Street With Required Brightness/README.md @@ -1,4 +1,4 @@ -# [2237. 计算街道上满足所需亮度的位置数量](https://leetcode.cn/problems/count-positions-on-street-with-required-brightness) +# [2237. 计算街道上满足所需亮度的位置数量 🔒](https://leetcode.cn/problems/count-positions-on-street-with-required-brightness) [English Version](/solution/2200-2299/2237.Count%20Positions%20on%20Street%20With%20Required%20Brightness/README_EN.md) diff --git a/solution/2200-2299/2237.Count Positions on Street With Required Brightness/README_EN.md b/solution/2200-2299/2237.Count Positions on Street With Required Brightness/README_EN.md index 36a144bb6233b..fc98535d7c0ab 100644 --- a/solution/2200-2299/2237.Count Positions on Street With Required Brightness/README_EN.md +++ b/solution/2200-2299/2237.Count Positions on Street With Required Brightness/README_EN.md @@ -1,4 +1,4 @@ -# [2237. Count Positions on Street With Required Brightness](https://leetcode.com/problems/count-positions-on-street-with-required-brightness) +# [2237. Count Positions on Street With Required Brightness 🔒](https://leetcode.com/problems/count-positions-on-street-with-required-brightness) [中文文档](/solution/2200-2299/2237.Count%20Positions%20on%20Street%20With%20Required%20Brightness/README.md) diff --git a/solution/2200-2299/2238.Number of Times a Driver Was a Passenger/README.md b/solution/2200-2299/2238.Number of Times a Driver Was a Passenger/README.md index 15417e0aaa14f..9f5b56f26121a 100644 --- a/solution/2200-2299/2238.Number of Times a Driver Was a Passenger/README.md +++ b/solution/2200-2299/2238.Number of Times a Driver Was a Passenger/README.md @@ -1,4 +1,4 @@ -# [2238. 司机成为乘客的次数](https://leetcode.cn/problems/number-of-times-a-driver-was-a-passenger) +# [2238. 司机成为乘客的次数 🔒](https://leetcode.cn/problems/number-of-times-a-driver-was-a-passenger) [English Version](/solution/2200-2299/2238.Number%20of%20Times%20a%20Driver%20Was%20a%20Passenger/README_EN.md) diff --git a/solution/2200-2299/2238.Number of Times a Driver Was a Passenger/README_EN.md b/solution/2200-2299/2238.Number of Times a Driver Was a Passenger/README_EN.md index 6f951feb7c19e..7630c89b706a8 100644 --- a/solution/2200-2299/2238.Number of Times a Driver Was a Passenger/README_EN.md +++ b/solution/2200-2299/2238.Number of Times a Driver Was a Passenger/README_EN.md @@ -1,4 +1,4 @@ -# [2238. Number of Times a Driver Was a Passenger](https://leetcode.com/problems/number-of-times-a-driver-was-a-passenger) +# [2238. Number of Times a Driver Was a Passenger 🔒](https://leetcode.com/problems/number-of-times-a-driver-was-a-passenger) [中文文档](/solution/2200-2299/2238.Number%20of%20Times%20a%20Driver%20Was%20a%20Passenger/README.md) diff --git a/solution/2200-2299/2247.Maximum Cost of Trip With K Highways/README.md b/solution/2200-2299/2247.Maximum Cost of Trip With K Highways/README.md index 8814fd4e802e8..d1f06d8bdb10d 100644 --- a/solution/2200-2299/2247.Maximum Cost of Trip With K Highways/README.md +++ b/solution/2200-2299/2247.Maximum Cost of Trip With K Highways/README.md @@ -1,4 +1,4 @@ -# [2247. K 条高速公路的最大旅行费用](https://leetcode.cn/problems/maximum-cost-of-trip-with-k-highways) +# [2247. K 条高速公路的最大旅行费用 🔒](https://leetcode.cn/problems/maximum-cost-of-trip-with-k-highways) [English Version](/solution/2200-2299/2247.Maximum%20Cost%20of%20Trip%20With%20K%20Highways/README_EN.md) diff --git a/solution/2200-2299/2247.Maximum Cost of Trip With K Highways/README_EN.md b/solution/2200-2299/2247.Maximum Cost of Trip With K Highways/README_EN.md index c56714d4773de..9e9de8e979ebc 100644 --- a/solution/2200-2299/2247.Maximum Cost of Trip With K Highways/README_EN.md +++ b/solution/2200-2299/2247.Maximum Cost of Trip With K Highways/README_EN.md @@ -1,4 +1,4 @@ -# [2247. Maximum Cost of Trip With K Highways](https://leetcode.com/problems/maximum-cost-of-trip-with-k-highways) +# [2247. Maximum Cost of Trip With K Highways 🔒](https://leetcode.com/problems/maximum-cost-of-trip-with-k-highways) [中文文档](/solution/2200-2299/2247.Maximum%20Cost%20of%20Trip%20With%20K%20Highways/README.md) diff --git a/solution/2200-2299/2252.Dynamic Pivoting of a Table/README.md b/solution/2200-2299/2252.Dynamic Pivoting of a Table/README.md index 3c3a46624345e..6290c59296fac 100644 --- a/solution/2200-2299/2252.Dynamic Pivoting of a Table/README.md +++ b/solution/2200-2299/2252.Dynamic Pivoting of a Table/README.md @@ -1,4 +1,4 @@ -# [2252. 表的动态旋转](https://leetcode.cn/problems/dynamic-pivoting-of-a-table) +# [2252. 表的动态旋转 🔒](https://leetcode.cn/problems/dynamic-pivoting-of-a-table) [English Version](/solution/2200-2299/2252.Dynamic%20Pivoting%20of%20a%20Table/README_EN.md) diff --git a/solution/2200-2299/2252.Dynamic Pivoting of a Table/README_EN.md b/solution/2200-2299/2252.Dynamic Pivoting of a Table/README_EN.md index 9143a8d7090c5..1c8deef13a676 100644 --- a/solution/2200-2299/2252.Dynamic Pivoting of a Table/README_EN.md +++ b/solution/2200-2299/2252.Dynamic Pivoting of a Table/README_EN.md @@ -1,4 +1,4 @@ -# [2252. Dynamic Pivoting of a Table](https://leetcode.com/problems/dynamic-pivoting-of-a-table) +# [2252. Dynamic Pivoting of a Table 🔒](https://leetcode.com/problems/dynamic-pivoting-of-a-table) [中文文档](/solution/2200-2299/2252.Dynamic%20Pivoting%20of%20a%20Table/README.md) diff --git a/solution/2200-2299/2253.Dynamic Unpivoting of a Table/README.md b/solution/2200-2299/2253.Dynamic Unpivoting of a Table/README.md index f0098f5bb5e88..53652d9a271e7 100644 --- a/solution/2200-2299/2253.Dynamic Unpivoting of a Table/README.md +++ b/solution/2200-2299/2253.Dynamic Unpivoting of a Table/README.md @@ -1,4 +1,4 @@ -# [2253. 动态取消表的旋转](https://leetcode.cn/problems/dynamic-unpivoting-of-a-table) +# [2253. 动态取消表的旋转 🔒](https://leetcode.cn/problems/dynamic-unpivoting-of-a-table) [English Version](/solution/2200-2299/2253.Dynamic%20Unpivoting%20of%20a%20Table/README_EN.md) diff --git a/solution/2200-2299/2253.Dynamic Unpivoting of a Table/README_EN.md b/solution/2200-2299/2253.Dynamic Unpivoting of a Table/README_EN.md index 906715b03959b..a5b2cf0fc9b87 100644 --- a/solution/2200-2299/2253.Dynamic Unpivoting of a Table/README_EN.md +++ b/solution/2200-2299/2253.Dynamic Unpivoting of a Table/README_EN.md @@ -1,4 +1,4 @@ -# [2253. Dynamic Unpivoting of a Table](https://leetcode.com/problems/dynamic-unpivoting-of-a-table) +# [2253. Dynamic Unpivoting of a Table 🔒](https://leetcode.com/problems/dynamic-unpivoting-of-a-table) [中文文档](/solution/2200-2299/2253.Dynamic%20Unpivoting%20of%20a%20Table/README.md) diff --git a/solution/2200-2299/2254.Design Video Sharing Platform/README.md b/solution/2200-2299/2254.Design Video Sharing Platform/README.md index af7b7fc69d74c..e6cf98f38faac 100644 --- a/solution/2200-2299/2254.Design Video Sharing Platform/README.md +++ b/solution/2200-2299/2254.Design Video Sharing Platform/README.md @@ -1,4 +1,4 @@ -# [2254. 设计视频共享平台](https://leetcode.cn/problems/design-video-sharing-platform) +# [2254. 设计视频共享平台 🔒](https://leetcode.cn/problems/design-video-sharing-platform) [English Version](/solution/2200-2299/2254.Design%20Video%20Sharing%20Platform/README_EN.md) diff --git a/solution/2200-2299/2254.Design Video Sharing Platform/README_EN.md b/solution/2200-2299/2254.Design Video Sharing Platform/README_EN.md index d72b50638c15f..69b9a8ea883c4 100644 --- a/solution/2200-2299/2254.Design Video Sharing Platform/README_EN.md +++ b/solution/2200-2299/2254.Design Video Sharing Platform/README_EN.md @@ -1,4 +1,4 @@ -# [2254. Design Video Sharing Platform](https://leetcode.com/problems/design-video-sharing-platform) +# [2254. Design Video Sharing Platform 🔒](https://leetcode.com/problems/design-video-sharing-platform) [中文文档](/solution/2200-2299/2254.Design%20Video%20Sharing%20Platform/README.md) diff --git a/solution/2200-2299/2263.Make Array Non-decreasing or Non-increasing/README.md b/solution/2200-2299/2263.Make Array Non-decreasing or Non-increasing/README.md index 46f2f0f878300..6af9bf236bedc 100644 --- a/solution/2200-2299/2263.Make Array Non-decreasing or Non-increasing/README.md +++ b/solution/2200-2299/2263.Make Array Non-decreasing or Non-increasing/README.md @@ -1,4 +1,4 @@ -# [2263. 数组变为有序的最小操作次数](https://leetcode.cn/problems/make-array-non-decreasing-or-non-increasing) +# [2263. 数组变为有序的最小操作次数 🔒](https://leetcode.cn/problems/make-array-non-decreasing-or-non-increasing) [English Version](/solution/2200-2299/2263.Make%20Array%20Non-decreasing%20or%20Non-increasing/README_EN.md) diff --git a/solution/2200-2299/2263.Make Array Non-decreasing or Non-increasing/README_EN.md b/solution/2200-2299/2263.Make Array Non-decreasing or Non-increasing/README_EN.md index 97c9c17bcac93..bcab6187450ff 100644 --- a/solution/2200-2299/2263.Make Array Non-decreasing or Non-increasing/README_EN.md +++ b/solution/2200-2299/2263.Make Array Non-decreasing or Non-increasing/README_EN.md @@ -1,4 +1,4 @@ -# [2263. Make Array Non-decreasing or Non-increasing](https://leetcode.com/problems/make-array-non-decreasing-or-non-increasing) +# [2263. Make Array Non-decreasing or Non-increasing 🔒](https://leetcode.com/problems/make-array-non-decreasing-or-non-increasing) [中文文档](/solution/2200-2299/2263.Make%20Array%20Non-decreasing%20or%20Non-increasing/README.md) diff --git a/solution/2200-2299/2268.Minimum Number of Keypresses/README.md b/solution/2200-2299/2268.Minimum Number of Keypresses/README.md index 92ecfe67ab25f..c99a8a46ba3fa 100644 --- a/solution/2200-2299/2268.Minimum Number of Keypresses/README.md +++ b/solution/2200-2299/2268.Minimum Number of Keypresses/README.md @@ -1,4 +1,4 @@ -# [2268. 最少按键次数](https://leetcode.cn/problems/minimum-number-of-keypresses) +# [2268. 最少按键次数 🔒](https://leetcode.cn/problems/minimum-number-of-keypresses) [English Version](/solution/2200-2299/2268.Minimum%20Number%20of%20Keypresses/README_EN.md) diff --git a/solution/2200-2299/2268.Minimum Number of Keypresses/README_EN.md b/solution/2200-2299/2268.Minimum Number of Keypresses/README_EN.md index 7594cbe5a3695..8d92cc411b631 100644 --- a/solution/2200-2299/2268.Minimum Number of Keypresses/README_EN.md +++ b/solution/2200-2299/2268.Minimum Number of Keypresses/README_EN.md @@ -1,4 +1,4 @@ -# [2268. Minimum Number of Keypresses](https://leetcode.com/problems/minimum-number-of-keypresses) +# [2268. Minimum Number of Keypresses 🔒](https://leetcode.com/problems/minimum-number-of-keypresses) [中文文档](/solution/2200-2299/2268.Minimum%20Number%20of%20Keypresses/README.md) diff --git a/solution/2200-2299/2277.Closest Node to Path in Tree/README.md b/solution/2200-2299/2277.Closest Node to Path in Tree/README.md index bf63477ab9993..ce42de06c6862 100644 --- a/solution/2200-2299/2277.Closest Node to Path in Tree/README.md +++ b/solution/2200-2299/2277.Closest Node to Path in Tree/README.md @@ -1,4 +1,4 @@ -# [2277. 树中最接近路径的节点](https://leetcode.cn/problems/closest-node-to-path-in-tree) +# [2277. 树中最接近路径的节点 🔒](https://leetcode.cn/problems/closest-node-to-path-in-tree) [English Version](/solution/2200-2299/2277.Closest%20Node%20to%20Path%20in%20Tree/README_EN.md) diff --git a/solution/2200-2299/2277.Closest Node to Path in Tree/README_EN.md b/solution/2200-2299/2277.Closest Node to Path in Tree/README_EN.md index 00db15abdc4ac..cf09b71638742 100644 --- a/solution/2200-2299/2277.Closest Node to Path in Tree/README_EN.md +++ b/solution/2200-2299/2277.Closest Node to Path in Tree/README_EN.md @@ -1,4 +1,4 @@ -# [2277. Closest Node to Path in Tree](https://leetcode.com/problems/closest-node-to-path-in-tree) +# [2277. Closest Node to Path in Tree 🔒](https://leetcode.com/problems/closest-node-to-path-in-tree) [中文文档](/solution/2200-2299/2277.Closest%20Node%20to%20Path%20in%20Tree/README.md) diff --git a/solution/2200-2299/2282.Number of People That Can Be Seen in a Grid/README.md b/solution/2200-2299/2282.Number of People That Can Be Seen in a Grid/README.md index 466a13b0f4657..03817b878252a 100644 --- a/solution/2200-2299/2282.Number of People That Can Be Seen in a Grid/README.md +++ b/solution/2200-2299/2282.Number of People That Can Be Seen in a Grid/README.md @@ -1,4 +1,4 @@ -# [2282. 在一个网格中可以看到的人数](https://leetcode.cn/problems/number-of-people-that-can-be-seen-in-a-grid) +# [2282. 在一个网格中可以看到的人数 🔒](https://leetcode.cn/problems/number-of-people-that-can-be-seen-in-a-grid) [English Version](/solution/2200-2299/2282.Number%20of%20People%20That%20Can%20Be%20Seen%20in%20a%20Grid/README_EN.md) diff --git a/solution/2200-2299/2282.Number of People That Can Be Seen in a Grid/README_EN.md b/solution/2200-2299/2282.Number of People That Can Be Seen in a Grid/README_EN.md index 0ebc1cb62b580..8c6e96511b46d 100644 --- a/solution/2200-2299/2282.Number of People That Can Be Seen in a Grid/README_EN.md +++ b/solution/2200-2299/2282.Number of People That Can Be Seen in a Grid/README_EN.md @@ -1,4 +1,4 @@ -# [2282. Number of People That Can Be Seen in a Grid](https://leetcode.com/problems/number-of-people-that-can-be-seen-in-a-grid) +# [2282. Number of People That Can Be Seen in a Grid 🔒](https://leetcode.com/problems/number-of-people-that-can-be-seen-in-a-grid) [中文文档](/solution/2200-2299/2282.Number%20of%20People%20That%20Can%20Be%20Seen%20in%20a%20Grid/README.md) diff --git a/solution/2200-2299/2291.Maximum Profit From Trading Stocks/README.md b/solution/2200-2299/2291.Maximum Profit From Trading Stocks/README.md index ff455cdeeda95..d099aa6daaa13 100644 --- a/solution/2200-2299/2291.Maximum Profit From Trading Stocks/README.md +++ b/solution/2200-2299/2291.Maximum Profit From Trading Stocks/README.md @@ -1,4 +1,4 @@ -# [2291. 最大股票收益](https://leetcode.cn/problems/maximum-profit-from-trading-stocks) +# [2291. 最大股票收益 🔒](https://leetcode.cn/problems/maximum-profit-from-trading-stocks) [English Version](/solution/2200-2299/2291.Maximum%20Profit%20From%20Trading%20Stocks/README_EN.md) diff --git a/solution/2200-2299/2291.Maximum Profit From Trading Stocks/README_EN.md b/solution/2200-2299/2291.Maximum Profit From Trading Stocks/README_EN.md index 0211187f98646..e18bc4856a2b3 100644 --- a/solution/2200-2299/2291.Maximum Profit From Trading Stocks/README_EN.md +++ b/solution/2200-2299/2291.Maximum Profit From Trading Stocks/README_EN.md @@ -1,4 +1,4 @@ -# [2291. Maximum Profit From Trading Stocks](https://leetcode.com/problems/maximum-profit-from-trading-stocks) +# [2291. Maximum Profit From Trading Stocks 🔒](https://leetcode.com/problems/maximum-profit-from-trading-stocks) [中文文档](/solution/2200-2299/2291.Maximum%20Profit%20From%20Trading%20Stocks/README.md) diff --git a/solution/2200-2299/2292.Products With Three or More Orders in Two Consecutive Years/README.md b/solution/2200-2299/2292.Products With Three or More Orders in Two Consecutive Years/README.md index bead1fad69111..4d229e6ae0e6f 100644 --- a/solution/2200-2299/2292.Products With Three or More Orders in Two Consecutive Years/README.md +++ b/solution/2200-2299/2292.Products With Three or More Orders in Two Consecutive Years/README.md @@ -1,4 +1,4 @@ -# [2292. 连续两年有 3 个及以上订单的产品](https://leetcode.cn/problems/products-with-three-or-more-orders-in-two-consecutive-years) +# [2292. 连续两年有 3 个及以上订单的产品 🔒](https://leetcode.cn/problems/products-with-three-or-more-orders-in-two-consecutive-years) [English Version](/solution/2200-2299/2292.Products%20With%20Three%20or%20More%20Orders%20in%20Two%20Consecutive%20Years/README_EN.md) diff --git a/solution/2200-2299/2292.Products With Three or More Orders in Two Consecutive Years/README_EN.md b/solution/2200-2299/2292.Products With Three or More Orders in Two Consecutive Years/README_EN.md index e3a44b3175a57..91a3adddf0a9b 100644 --- a/solution/2200-2299/2292.Products With Three or More Orders in Two Consecutive Years/README_EN.md +++ b/solution/2200-2299/2292.Products With Three or More Orders in Two Consecutive Years/README_EN.md @@ -1,4 +1,4 @@ -# [2292. Products With Three or More Orders in Two Consecutive Years](https://leetcode.com/problems/products-with-three-or-more-orders-in-two-consecutive-years) +# [2292. Products With Three or More Orders in Two Consecutive Years 🔒](https://leetcode.com/problems/products-with-three-or-more-orders-in-two-consecutive-years) [中文文档](/solution/2200-2299/2292.Products%20With%20Three%20or%20More%20Orders%20in%20Two%20Consecutive%20Years/README.md) diff --git a/solution/2200-2299/2297.Jump Game VIII/README.md b/solution/2200-2299/2297.Jump Game VIII/README.md index 1e465e8988d32..bfb8fe3dc7ffa 100644 --- a/solution/2200-2299/2297.Jump Game VIII/README.md +++ b/solution/2200-2299/2297.Jump Game VIII/README.md @@ -1,4 +1,4 @@ -# [2297. 跳跃游戏 VIII](https://leetcode.cn/problems/jump-game-viii) +# [2297. 跳跃游戏 VIII 🔒](https://leetcode.cn/problems/jump-game-viii) [English Version](/solution/2200-2299/2297.Jump%20Game%20VIII/README_EN.md) diff --git a/solution/2200-2299/2297.Jump Game VIII/README_EN.md b/solution/2200-2299/2297.Jump Game VIII/README_EN.md index 50ba9cbb032ae..0bed83c1f4952 100644 --- a/solution/2200-2299/2297.Jump Game VIII/README_EN.md +++ b/solution/2200-2299/2297.Jump Game VIII/README_EN.md @@ -1,4 +1,4 @@ -# [2297. Jump Game VIII](https://leetcode.com/problems/jump-game-viii) +# [2297. Jump Game VIII 🔒](https://leetcode.com/problems/jump-game-viii) [中文文档](/solution/2200-2299/2297.Jump%20Game%20VIII/README.md) diff --git a/solution/2200-2299/2298.Tasks Count in the Weekend/README.md b/solution/2200-2299/2298.Tasks Count in the Weekend/README.md index cd963653e3257..d41cd4a00598c 100644 --- a/solution/2200-2299/2298.Tasks Count in the Weekend/README.md +++ b/solution/2200-2299/2298.Tasks Count in the Weekend/README.md @@ -1,4 +1,4 @@ -# [2298. 周末任务计数](https://leetcode.cn/problems/tasks-count-in-the-weekend) +# [2298. 周末任务计数 🔒](https://leetcode.cn/problems/tasks-count-in-the-weekend) [English Version](/solution/2200-2299/2298.Tasks%20Count%20in%20the%20Weekend/README_EN.md) diff --git a/solution/2200-2299/2298.Tasks Count in the Weekend/README_EN.md b/solution/2200-2299/2298.Tasks Count in the Weekend/README_EN.md index a941549372c82..0637288f6c5be 100644 --- a/solution/2200-2299/2298.Tasks Count in the Weekend/README_EN.md +++ b/solution/2200-2299/2298.Tasks Count in the Weekend/README_EN.md @@ -1,4 +1,4 @@ -# [2298. Tasks Count in the Weekend](https://leetcode.com/problems/tasks-count-in-the-weekend) +# [2298. Tasks Count in the Weekend 🔒](https://leetcode.com/problems/tasks-count-in-the-weekend) [中文文档](/solution/2200-2299/2298.Tasks%20Count%20in%20the%20Weekend/README.md) diff --git a/solution/2300-2399/2307.Check for Contradictions in Equations/README.md b/solution/2300-2399/2307.Check for Contradictions in Equations/README.md index b6966b7e28a99..de849e91fb65d 100644 --- a/solution/2300-2399/2307.Check for Contradictions in Equations/README.md +++ b/solution/2300-2399/2307.Check for Contradictions in Equations/README.md @@ -1,4 +1,4 @@ -# [2307. 检查方程中的矛盾之处](https://leetcode.cn/problems/check-for-contradictions-in-equations) +# [2307. 检查方程中的矛盾之处 🔒](https://leetcode.cn/problems/check-for-contradictions-in-equations) [English Version](/solution/2300-2399/2307.Check%20for%20Contradictions%20in%20Equations/README_EN.md) diff --git a/solution/2300-2399/2307.Check for Contradictions in Equations/README_EN.md b/solution/2300-2399/2307.Check for Contradictions in Equations/README_EN.md index 06988937a2b5a..ba40e0542b2d1 100644 --- a/solution/2300-2399/2307.Check for Contradictions in Equations/README_EN.md +++ b/solution/2300-2399/2307.Check for Contradictions in Equations/README_EN.md @@ -1,4 +1,4 @@ -# [2307. Check for Contradictions in Equations](https://leetcode.com/problems/check-for-contradictions-in-equations) +# [2307. Check for Contradictions in Equations 🔒](https://leetcode.com/problems/check-for-contradictions-in-equations) [中文文档](/solution/2300-2399/2307.Check%20for%20Contradictions%20in%20Equations/README.md) diff --git a/solution/2300-2399/2308.Arrange Table by Gender/README.md b/solution/2300-2399/2308.Arrange Table by Gender/README.md index 00b8d870cdbd7..6ae573cadd4ed 100644 --- a/solution/2300-2399/2308.Arrange Table by Gender/README.md +++ b/solution/2300-2399/2308.Arrange Table by Gender/README.md @@ -1,4 +1,4 @@ -# [2308. 按性别排列表格](https://leetcode.cn/problems/arrange-table-by-gender) +# [2308. 按性别排列表格 🔒](https://leetcode.cn/problems/arrange-table-by-gender) [English Version](/solution/2300-2399/2308.Arrange%20Table%20by%20Gender/README_EN.md) diff --git a/solution/2300-2399/2308.Arrange Table by Gender/README_EN.md b/solution/2300-2399/2308.Arrange Table by Gender/README_EN.md index 09e56019fcc11..4d2619f463b8d 100644 --- a/solution/2300-2399/2308.Arrange Table by Gender/README_EN.md +++ b/solution/2300-2399/2308.Arrange Table by Gender/README_EN.md @@ -1,4 +1,4 @@ -# [2308. Arrange Table by Gender](https://leetcode.com/problems/arrange-table-by-gender) +# [2308. Arrange Table by Gender 🔒](https://leetcode.com/problems/arrange-table-by-gender) [中文文档](/solution/2300-2399/2308.Arrange%20Table%20by%20Gender/README.md) diff --git a/solution/2300-2399/2313.Minimum Flips in Binary Tree to Get Result/README.md b/solution/2300-2399/2313.Minimum Flips in Binary Tree to Get Result/README.md index feaae3dabd184..a4081b4e97bc1 100644 --- a/solution/2300-2399/2313.Minimum Flips in Binary Tree to Get Result/README.md +++ b/solution/2300-2399/2313.Minimum Flips in Binary Tree to Get Result/README.md @@ -1,4 +1,4 @@ -# [2313. 二叉树中得到结果所需的最少翻转次数](https://leetcode.cn/problems/minimum-flips-in-binary-tree-to-get-result) +# [2313. 二叉树中得到结果所需的最少翻转次数 🔒](https://leetcode.cn/problems/minimum-flips-in-binary-tree-to-get-result) [English Version](/solution/2300-2399/2313.Minimum%20Flips%20in%20Binary%20Tree%20to%20Get%20Result/README_EN.md) diff --git a/solution/2300-2399/2313.Minimum Flips in Binary Tree to Get Result/README_EN.md b/solution/2300-2399/2313.Minimum Flips in Binary Tree to Get Result/README_EN.md index c83c8b2d309e0..81504ac6c9e52 100644 --- a/solution/2300-2399/2313.Minimum Flips in Binary Tree to Get Result/README_EN.md +++ b/solution/2300-2399/2313.Minimum Flips in Binary Tree to Get Result/README_EN.md @@ -1,4 +1,4 @@ -# [2313. Minimum Flips in Binary Tree to Get Result](https://leetcode.com/problems/minimum-flips-in-binary-tree-to-get-result) +# [2313. Minimum Flips in Binary Tree to Get Result 🔒](https://leetcode.com/problems/minimum-flips-in-binary-tree-to-get-result) [中文文档](/solution/2300-2399/2313.Minimum%20Flips%20in%20Binary%20Tree%20to%20Get%20Result/README.md) diff --git a/solution/2300-2399/2314.The First Day of the Maximum Recorded Degree in Each City/README.md b/solution/2300-2399/2314.The First Day of the Maximum Recorded Degree in Each City/README.md index 9c6dc0a08e0a6..94d9c8716e201 100644 --- a/solution/2300-2399/2314.The First Day of the Maximum Recorded Degree in Each City/README.md +++ b/solution/2300-2399/2314.The First Day of the Maximum Recorded Degree in Each City/README.md @@ -1,4 +1,4 @@ -# [2314. 每个城市最高气温的第一天](https://leetcode.cn/problems/the-first-day-of-the-maximum-recorded-degree-in-each-city) +# [2314. 每个城市最高气温的第一天 🔒](https://leetcode.cn/problems/the-first-day-of-the-maximum-recorded-degree-in-each-city) [English Version](/solution/2300-2399/2314.The%20First%20Day%20of%20the%20Maximum%20Recorded%20Degree%20in%20Each%20City/README_EN.md) diff --git a/solution/2300-2399/2314.The First Day of the Maximum Recorded Degree in Each City/README_EN.md b/solution/2300-2399/2314.The First Day of the Maximum Recorded Degree in Each City/README_EN.md index 8d5f1663a609a..741bc623d04fe 100644 --- a/solution/2300-2399/2314.The First Day of the Maximum Recorded Degree in Each City/README_EN.md +++ b/solution/2300-2399/2314.The First Day of the Maximum Recorded Degree in Each City/README_EN.md @@ -1,4 +1,4 @@ -# [2314. The First Day of the Maximum Recorded Degree in Each City](https://leetcode.com/problems/the-first-day-of-the-maximum-recorded-degree-in-each-city) +# [2314. The First Day of the Maximum Recorded Degree in Each City 🔒](https://leetcode.com/problems/the-first-day-of-the-maximum-recorded-degree-in-each-city) [中文文档](/solution/2300-2399/2314.The%20First%20Day%20of%20the%20Maximum%20Recorded%20Degree%20in%20Each%20City/README.md) diff --git a/solution/2300-2399/2323.Find Minimum Time to Finish All Jobs II/README.md b/solution/2300-2399/2323.Find Minimum Time to Finish All Jobs II/README.md index 45dfb91757421..91d0f275c2cec 100644 --- a/solution/2300-2399/2323.Find Minimum Time to Finish All Jobs II/README.md +++ b/solution/2300-2399/2323.Find Minimum Time to Finish All Jobs II/README.md @@ -1,4 +1,4 @@ -# [2323. 完成所有工作的最短时间 II](https://leetcode.cn/problems/find-minimum-time-to-finish-all-jobs-ii) +# [2323. 完成所有工作的最短时间 II 🔒](https://leetcode.cn/problems/find-minimum-time-to-finish-all-jobs-ii) [English Version](/solution/2300-2399/2323.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs%20II/README_EN.md) diff --git a/solution/2300-2399/2323.Find Minimum Time to Finish All Jobs II/README_EN.md b/solution/2300-2399/2323.Find Minimum Time to Finish All Jobs II/README_EN.md index a3163135bc0a1..95d94082d51d8 100644 --- a/solution/2300-2399/2323.Find Minimum Time to Finish All Jobs II/README_EN.md +++ b/solution/2300-2399/2323.Find Minimum Time to Finish All Jobs II/README_EN.md @@ -1,4 +1,4 @@ -# [2323. Find Minimum Time to Finish All Jobs II](https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs-ii) +# [2323. Find Minimum Time to Finish All Jobs II 🔒](https://leetcode.com/problems/find-minimum-time-to-finish-all-jobs-ii) [中文文档](/solution/2300-2399/2323.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs%20II/README.md) diff --git a/solution/2300-2399/2324.Product Sales Analysis IV/README.md b/solution/2300-2399/2324.Product Sales Analysis IV/README.md index c7179305b468e..399ceffc6435a 100644 --- a/solution/2300-2399/2324.Product Sales Analysis IV/README.md +++ b/solution/2300-2399/2324.Product Sales Analysis IV/README.md @@ -1,4 +1,4 @@ -# [2324. 产品销售分析 IV](https://leetcode.cn/problems/product-sales-analysis-iv) +# [2324. 产品销售分析 IV 🔒](https://leetcode.cn/problems/product-sales-analysis-iv) [English Version](/solution/2300-2399/2324.Product%20Sales%20Analysis%20IV/README_EN.md) diff --git a/solution/2300-2399/2324.Product Sales Analysis IV/README_EN.md b/solution/2300-2399/2324.Product Sales Analysis IV/README_EN.md index 800571a1e55ec..9968f07fbb226 100644 --- a/solution/2300-2399/2324.Product Sales Analysis IV/README_EN.md +++ b/solution/2300-2399/2324.Product Sales Analysis IV/README_EN.md @@ -1,4 +1,4 @@ -# [2324. Product Sales Analysis IV](https://leetcode.com/problems/product-sales-analysis-iv) +# [2324. Product Sales Analysis IV 🔒](https://leetcode.com/problems/product-sales-analysis-iv) [中文文档](/solution/2300-2399/2324.Product%20Sales%20Analysis%20IV/README.md) diff --git a/solution/2300-2399/2329.Product Sales Analysis V/README.md b/solution/2300-2399/2329.Product Sales Analysis V/README.md index 8381fe9fc0be3..e4d6b70ca5e40 100644 --- a/solution/2300-2399/2329.Product Sales Analysis V/README.md +++ b/solution/2300-2399/2329.Product Sales Analysis V/README.md @@ -1,4 +1,4 @@ -# [2329. 产品销售分析 Ⅴ](https://leetcode.cn/problems/product-sales-analysis-v) +# [2329. 产品销售分析 Ⅴ 🔒](https://leetcode.cn/problems/product-sales-analysis-v) [English Version](/solution/2300-2399/2329.Product%20Sales%20Analysis%20V/README_EN.md) diff --git a/solution/2300-2399/2329.Product Sales Analysis V/README_EN.md b/solution/2300-2399/2329.Product Sales Analysis V/README_EN.md index 4d5d661d373e0..de21650851cdf 100644 --- a/solution/2300-2399/2329.Product Sales Analysis V/README_EN.md +++ b/solution/2300-2399/2329.Product Sales Analysis V/README_EN.md @@ -1,4 +1,4 @@ -# [2329. Product Sales Analysis V](https://leetcode.com/problems/product-sales-analysis-v) +# [2329. Product Sales Analysis V 🔒](https://leetcode.com/problems/product-sales-analysis-v) [中文文档](/solution/2300-2399/2329.Product%20Sales%20Analysis%20V/README.md) diff --git a/solution/2300-2399/2330.Valid Palindrome IV/README.md b/solution/2300-2399/2330.Valid Palindrome IV/README.md index fa606a76f9ed8..5103a07b9f3f5 100644 --- a/solution/2300-2399/2330.Valid Palindrome IV/README.md +++ b/solution/2300-2399/2330.Valid Palindrome IV/README.md @@ -1,4 +1,4 @@ -# [2330. 验证回文串 IV](https://leetcode.cn/problems/valid-palindrome-iv) +# [2330. 验证回文串 IV 🔒](https://leetcode.cn/problems/valid-palindrome-iv) [English Version](/solution/2300-2399/2330.Valid%20Palindrome%20IV/README_EN.md) diff --git a/solution/2300-2399/2330.Valid Palindrome IV/README_EN.md b/solution/2300-2399/2330.Valid Palindrome IV/README_EN.md index 0d4b59a2deca2..66e5802abea85 100644 --- a/solution/2300-2399/2330.Valid Palindrome IV/README_EN.md +++ b/solution/2300-2399/2330.Valid Palindrome IV/README_EN.md @@ -1,4 +1,4 @@ -# [2330. Valid Palindrome IV](https://leetcode.com/problems/valid-palindrome-iv) +# [2330. Valid Palindrome IV 🔒](https://leetcode.com/problems/valid-palindrome-iv) [中文文档](/solution/2300-2399/2330.Valid%20Palindrome%20IV/README.md) diff --git a/solution/2300-2399/2339.All the Matches of the League/README.md b/solution/2300-2399/2339.All the Matches of the League/README.md index 7705360d2d076..9a6d075894d97 100644 --- a/solution/2300-2399/2339.All the Matches of the League/README.md +++ b/solution/2300-2399/2339.All the Matches of the League/README.md @@ -1,4 +1,4 @@ -# [2339. 联赛的所有比赛](https://leetcode.cn/problems/all-the-matches-of-the-league) +# [2339. 联赛的所有比赛 🔒](https://leetcode.cn/problems/all-the-matches-of-the-league) [English Version](/solution/2300-2399/2339.All%20the%20Matches%20of%20the%20League/README_EN.md) diff --git a/solution/2300-2399/2339.All the Matches of the League/README_EN.md b/solution/2300-2399/2339.All the Matches of the League/README_EN.md index 10336e9ad817a..645c742b18b38 100644 --- a/solution/2300-2399/2339.All the Matches of the League/README_EN.md +++ b/solution/2300-2399/2339.All the Matches of the League/README_EN.md @@ -1,4 +1,4 @@ -# [2339. All the Matches of the League](https://leetcode.com/problems/all-the-matches-of-the-league) +# [2339. All the Matches of the League 🔒](https://leetcode.com/problems/all-the-matches-of-the-league) [中文文档](/solution/2300-2399/2339.All%20the%20Matches%20of%20the%20League/README.md) diff --git a/solution/2300-2399/2340.Minimum Adjacent Swaps to Make a Valid Array/README.md b/solution/2300-2399/2340.Minimum Adjacent Swaps to Make a Valid Array/README.md index fe26406a323bc..50e1061ed641c 100644 --- a/solution/2300-2399/2340.Minimum Adjacent Swaps to Make a Valid Array/README.md +++ b/solution/2300-2399/2340.Minimum Adjacent Swaps to Make a Valid Array/README.md @@ -1,4 +1,4 @@ -# [2340. 生成有效数组的最少交换次数](https://leetcode.cn/problems/minimum-adjacent-swaps-to-make-a-valid-array) +# [2340. 生成有效数组的最少交换次数 🔒](https://leetcode.cn/problems/minimum-adjacent-swaps-to-make-a-valid-array) [English Version](/solution/2300-2399/2340.Minimum%20Adjacent%20Swaps%20to%20Make%20a%20Valid%20Array/README_EN.md) diff --git a/solution/2300-2399/2340.Minimum Adjacent Swaps to Make a Valid Array/README_EN.md b/solution/2300-2399/2340.Minimum Adjacent Swaps to Make a Valid Array/README_EN.md index 6051c67ffa674..c7cafe6b6538c 100644 --- a/solution/2300-2399/2340.Minimum Adjacent Swaps to Make a Valid Array/README_EN.md +++ b/solution/2300-2399/2340.Minimum Adjacent Swaps to Make a Valid Array/README_EN.md @@ -1,4 +1,4 @@ -# [2340. Minimum Adjacent Swaps to Make a Valid Array](https://leetcode.com/problems/minimum-adjacent-swaps-to-make-a-valid-array) +# [2340. Minimum Adjacent Swaps to Make a Valid Array 🔒](https://leetcode.com/problems/minimum-adjacent-swaps-to-make-a-valid-array) [中文文档](/solution/2300-2399/2340.Minimum%20Adjacent%20Swaps%20to%20Make%20a%20Valid%20Array/README.md) diff --git a/solution/2300-2399/2345.Finding the Number of Visible Mountains/README.md b/solution/2300-2399/2345.Finding the Number of Visible Mountains/README.md index a53257e2b1cf9..b2770f714c483 100644 --- a/solution/2300-2399/2345.Finding the Number of Visible Mountains/README.md +++ b/solution/2300-2399/2345.Finding the Number of Visible Mountains/README.md @@ -1,4 +1,4 @@ -# [2345. 寻找可见山的数量](https://leetcode.cn/problems/finding-the-number-of-visible-mountains) +# [2345. 寻找可见山的数量 🔒](https://leetcode.cn/problems/finding-the-number-of-visible-mountains) [English Version](/solution/2300-2399/2345.Finding%20the%20Number%20of%20Visible%20Mountains/README_EN.md) diff --git a/solution/2300-2399/2345.Finding the Number of Visible Mountains/README_EN.md b/solution/2300-2399/2345.Finding the Number of Visible Mountains/README_EN.md index 51355eaba5f82..085becd77cf6b 100644 --- a/solution/2300-2399/2345.Finding the Number of Visible Mountains/README_EN.md +++ b/solution/2300-2399/2345.Finding the Number of Visible Mountains/README_EN.md @@ -1,4 +1,4 @@ -# [2345. Finding the Number of Visible Mountains](https://leetcode.com/problems/finding-the-number-of-visible-mountains) +# [2345. Finding the Number of Visible Mountains 🔒](https://leetcode.com/problems/finding-the-number-of-visible-mountains) [中文文档](/solution/2300-2399/2345.Finding%20the%20Number%20of%20Visible%20Mountains/README.md) diff --git a/solution/2300-2399/2346.Compute the Rank as a Percentage/README.md b/solution/2300-2399/2346.Compute the Rank as a Percentage/README.md index c32f37746dd34..ce10210b01135 100644 --- a/solution/2300-2399/2346.Compute the Rank as a Percentage/README.md +++ b/solution/2300-2399/2346.Compute the Rank as a Percentage/README.md @@ -1,4 +1,4 @@ -# [2346. 以百分比计算排名](https://leetcode.cn/problems/compute-the-rank-as-a-percentage) +# [2346. 以百分比计算排名 🔒](https://leetcode.cn/problems/compute-the-rank-as-a-percentage) [English Version](/solution/2300-2399/2346.Compute%20the%20Rank%20as%20a%20Percentage/README_EN.md) diff --git a/solution/2300-2399/2346.Compute the Rank as a Percentage/README_EN.md b/solution/2300-2399/2346.Compute the Rank as a Percentage/README_EN.md index dfdc8875aa198..4e71b84bac73b 100644 --- a/solution/2300-2399/2346.Compute the Rank as a Percentage/README_EN.md +++ b/solution/2300-2399/2346.Compute the Rank as a Percentage/README_EN.md @@ -1,4 +1,4 @@ -# [2346. Compute the Rank as a Percentage](https://leetcode.com/problems/compute-the-rank-as-a-percentage) +# [2346. Compute the Rank as a Percentage 🔒](https://leetcode.com/problems/compute-the-rank-as-a-percentage) [中文文档](/solution/2300-2399/2346.Compute%20the%20Rank%20as%20a%20Percentage/README.md) diff --git a/solution/2300-2399/2355.Maximum Number of Books You Can Take/README.md b/solution/2300-2399/2355.Maximum Number of Books You Can Take/README.md index 3f1a739d27d5a..f985fd8b9fc16 100644 --- a/solution/2300-2399/2355.Maximum Number of Books You Can Take/README.md +++ b/solution/2300-2399/2355.Maximum Number of Books You Can Take/README.md @@ -1,4 +1,4 @@ -# [2355. 你能拿走的最大图书数量](https://leetcode.cn/problems/maximum-number-of-books-you-can-take) +# [2355. 你能拿走的最大图书数量 🔒](https://leetcode.cn/problems/maximum-number-of-books-you-can-take) [English Version](/solution/2300-2399/2355.Maximum%20Number%20of%20Books%20You%20Can%20Take/README_EN.md) diff --git a/solution/2300-2399/2355.Maximum Number of Books You Can Take/README_EN.md b/solution/2300-2399/2355.Maximum Number of Books You Can Take/README_EN.md index 966e8f9c3f33b..df78149006c93 100644 --- a/solution/2300-2399/2355.Maximum Number of Books You Can Take/README_EN.md +++ b/solution/2300-2399/2355.Maximum Number of Books You Can Take/README_EN.md @@ -1,4 +1,4 @@ -# [2355. Maximum Number of Books You Can Take](https://leetcode.com/problems/maximum-number-of-books-you-can-take) +# [2355. Maximum Number of Books You Can Take 🔒](https://leetcode.com/problems/maximum-number-of-books-you-can-take) [中文文档](/solution/2300-2399/2355.Maximum%20Number%20of%20Books%20You%20Can%20Take/README.md) diff --git a/solution/2300-2399/2361.Minimum Costs Using the Train Line/README.md b/solution/2300-2399/2361.Minimum Costs Using the Train Line/README.md index 383ca228550f3..811da871a0da0 100644 --- a/solution/2300-2399/2361.Minimum Costs Using the Train Line/README.md +++ b/solution/2300-2399/2361.Minimum Costs Using the Train Line/README.md @@ -1,4 +1,4 @@ -# [2361. 乘坐火车路线的最少费用](https://leetcode.cn/problems/minimum-costs-using-the-train-line) +# [2361. 乘坐火车路线的最少费用 🔒](https://leetcode.cn/problems/minimum-costs-using-the-train-line) [English Version](/solution/2300-2399/2361.Minimum%20Costs%20Using%20the%20Train%20Line/README_EN.md) diff --git a/solution/2300-2399/2361.Minimum Costs Using the Train Line/README_EN.md b/solution/2300-2399/2361.Minimum Costs Using the Train Line/README_EN.md index 851a0eec1a472..55847e461ac91 100644 --- a/solution/2300-2399/2361.Minimum Costs Using the Train Line/README_EN.md +++ b/solution/2300-2399/2361.Minimum Costs Using the Train Line/README_EN.md @@ -1,4 +1,4 @@ -# [2361. Minimum Costs Using the Train Line](https://leetcode.com/problems/minimum-costs-using-the-train-line) +# [2361. Minimum Costs Using the Train Line 🔒](https://leetcode.com/problems/minimum-costs-using-the-train-line) [中文文档](/solution/2300-2399/2361.Minimum%20Costs%20Using%20the%20Train%20Line/README.md) diff --git a/solution/2300-2399/2362.Generate the Invoice/README.md b/solution/2300-2399/2362.Generate the Invoice/README.md index 4109f7b3c3739..8ad33e7f74152 100644 --- a/solution/2300-2399/2362.Generate the Invoice/README.md +++ b/solution/2300-2399/2362.Generate the Invoice/README.md @@ -1,4 +1,4 @@ -# [2362. 生成发票](https://leetcode.cn/problems/generate-the-invoice) +# [2362. 生成发票 🔒](https://leetcode.cn/problems/generate-the-invoice) [English Version](/solution/2300-2399/2362.Generate%20the%20Invoice/README_EN.md) diff --git a/solution/2300-2399/2362.Generate the Invoice/README_EN.md b/solution/2300-2399/2362.Generate the Invoice/README_EN.md index dac53afcfa7d5..60e20fbdd6d8a 100644 --- a/solution/2300-2399/2362.Generate the Invoice/README_EN.md +++ b/solution/2300-2399/2362.Generate the Invoice/README_EN.md @@ -1,4 +1,4 @@ -# [2362. Generate the Invoice](https://leetcode.com/problems/generate-the-invoice) +# [2362. Generate the Invoice 🔒](https://leetcode.com/problems/generate-the-invoice) [中文文档](/solution/2300-2399/2362.Generate%20the%20Invoice/README.md) diff --git a/solution/2300-2399/2371.Minimize Maximum Value in a Grid/README.md b/solution/2300-2399/2371.Minimize Maximum Value in a Grid/README.md index 6b0faa5bfe0f0..dbd9b51d7a679 100644 --- a/solution/2300-2399/2371.Minimize Maximum Value in a Grid/README.md +++ b/solution/2300-2399/2371.Minimize Maximum Value in a Grid/README.md @@ -1,4 +1,4 @@ -# [2371. 最小化网格中的最大值](https://leetcode.cn/problems/minimize-maximum-value-in-a-grid) +# [2371. 最小化网格中的最大值 🔒](https://leetcode.cn/problems/minimize-maximum-value-in-a-grid) [English Version](/solution/2300-2399/2371.Minimize%20Maximum%20Value%20in%20a%20Grid/README_EN.md) diff --git a/solution/2300-2399/2371.Minimize Maximum Value in a Grid/README_EN.md b/solution/2300-2399/2371.Minimize Maximum Value in a Grid/README_EN.md index 41bcd14857877..1e3b9115f043c 100644 --- a/solution/2300-2399/2371.Minimize Maximum Value in a Grid/README_EN.md +++ b/solution/2300-2399/2371.Minimize Maximum Value in a Grid/README_EN.md @@ -1,4 +1,4 @@ -# [2371. Minimize Maximum Value in a Grid](https://leetcode.com/problems/minimize-maximum-value-in-a-grid) +# [2371. Minimize Maximum Value in a Grid 🔒](https://leetcode.com/problems/minimize-maximum-value-in-a-grid) [中文文档](/solution/2300-2399/2371.Minimize%20Maximum%20Value%20in%20a%20Grid/README.md) diff --git a/solution/2300-2399/2372.Calculate the Influence of Each Salesperson/README.md b/solution/2300-2399/2372.Calculate the Influence of Each Salesperson/README.md index aa3e995dcb506..fd41fa7ec7262 100644 --- a/solution/2300-2399/2372.Calculate the Influence of Each Salesperson/README.md +++ b/solution/2300-2399/2372.Calculate the Influence of Each Salesperson/README.md @@ -1,4 +1,4 @@ -# [2372. 计算每个销售人员的影响力](https://leetcode.cn/problems/calculate-the-influence-of-each-salesperson) +# [2372. 计算每个销售人员的影响力 🔒](https://leetcode.cn/problems/calculate-the-influence-of-each-salesperson) [English Version](/solution/2300-2399/2372.Calculate%20the%20Influence%20of%20Each%20Salesperson/README_EN.md) diff --git a/solution/2300-2399/2372.Calculate the Influence of Each Salesperson/README_EN.md b/solution/2300-2399/2372.Calculate the Influence of Each Salesperson/README_EN.md index 2a19eba274e6e..b15e3a812f2a2 100644 --- a/solution/2300-2399/2372.Calculate the Influence of Each Salesperson/README_EN.md +++ b/solution/2300-2399/2372.Calculate the Influence of Each Salesperson/README_EN.md @@ -1,4 +1,4 @@ -# [2372. Calculate the Influence of Each Salesperson](https://leetcode.com/problems/calculate-the-influence-of-each-salesperson) +# [2372. Calculate the Influence of Each Salesperson 🔒](https://leetcode.com/problems/calculate-the-influence-of-each-salesperson) [中文文档](/solution/2300-2399/2372.Calculate%20the%20Influence%20of%20Each%20Salesperson/README.md) diff --git a/solution/2300-2399/2377.Sort the Olympic Table/README.md b/solution/2300-2399/2377.Sort the Olympic Table/README.md index 2c1777d957caf..80ebd9dc95b27 100644 --- a/solution/2300-2399/2377.Sort the Olympic Table/README.md +++ b/solution/2300-2399/2377.Sort the Olympic Table/README.md @@ -1,4 +1,4 @@ -# [2377. 整理奥运表](https://leetcode.cn/problems/sort-the-olympic-table) +# [2377. 整理奥运表 🔒](https://leetcode.cn/problems/sort-the-olympic-table) [English Version](/solution/2300-2399/2377.Sort%20the%20Olympic%20Table/README_EN.md) diff --git a/solution/2300-2399/2377.Sort the Olympic Table/README_EN.md b/solution/2300-2399/2377.Sort the Olympic Table/README_EN.md index 0845ce516e7d5..3c15e4f1a5866 100644 --- a/solution/2300-2399/2377.Sort the Olympic Table/README_EN.md +++ b/solution/2300-2399/2377.Sort the Olympic Table/README_EN.md @@ -1,4 +1,4 @@ -# [2377. Sort the Olympic Table](https://leetcode.com/problems/sort-the-olympic-table) +# [2377. Sort the Olympic Table 🔒](https://leetcode.com/problems/sort-the-olympic-table) [中文文档](/solution/2300-2399/2377.Sort%20the%20Olympic%20Table/README.md) diff --git a/solution/2300-2399/2378.Choose Edges to Maximize Score in a Tree/README.md b/solution/2300-2399/2378.Choose Edges to Maximize Score in a Tree/README.md index 5f87026bd5573..c40bd84062983 100644 --- a/solution/2300-2399/2378.Choose Edges to Maximize Score in a Tree/README.md +++ b/solution/2300-2399/2378.Choose Edges to Maximize Score in a Tree/README.md @@ -1,4 +1,4 @@ -# [2378. 选择边来最大化树的得分](https://leetcode.cn/problems/choose-edges-to-maximize-score-in-a-tree) +# [2378. 选择边来最大化树的得分 🔒](https://leetcode.cn/problems/choose-edges-to-maximize-score-in-a-tree) [English Version](/solution/2300-2399/2378.Choose%20Edges%20to%20Maximize%20Score%20in%20a%20Tree/README_EN.md) diff --git a/solution/2300-2399/2378.Choose Edges to Maximize Score in a Tree/README_EN.md b/solution/2300-2399/2378.Choose Edges to Maximize Score in a Tree/README_EN.md index 354c90e3bdd6b..7ee4659149c89 100644 --- a/solution/2300-2399/2378.Choose Edges to Maximize Score in a Tree/README_EN.md +++ b/solution/2300-2399/2378.Choose Edges to Maximize Score in a Tree/README_EN.md @@ -1,4 +1,4 @@ -# [2378. Choose Edges to Maximize Score in a Tree](https://leetcode.com/problems/choose-edges-to-maximize-score-in-a-tree) +# [2378. Choose Edges to Maximize Score in a Tree 🔒](https://leetcode.com/problems/choose-edges-to-maximize-score-in-a-tree) [中文文档](/solution/2300-2399/2378.Choose%20Edges%20to%20Maximize%20Score%20in%20a%20Tree/README.md) diff --git a/solution/2300-2399/2387.Median of a Row Wise Sorted Matrix/README.md b/solution/2300-2399/2387.Median of a Row Wise Sorted Matrix/README.md index 0b221d7ce5cf7..e102a0a36a57e 100644 --- a/solution/2300-2399/2387.Median of a Row Wise Sorted Matrix/README.md +++ b/solution/2300-2399/2387.Median of a Row Wise Sorted Matrix/README.md @@ -1,4 +1,4 @@ -# [2387. 行排序矩阵的中位数](https://leetcode.cn/problems/median-of-a-row-wise-sorted-matrix) +# [2387. 行排序矩阵的中位数 🔒](https://leetcode.cn/problems/median-of-a-row-wise-sorted-matrix) [English Version](/solution/2300-2399/2387.Median%20of%20a%20Row%20Wise%20Sorted%20Matrix/README_EN.md) diff --git a/solution/2300-2399/2387.Median of a Row Wise Sorted Matrix/README_EN.md b/solution/2300-2399/2387.Median of a Row Wise Sorted Matrix/README_EN.md index 17a7811694d8f..ae2d466173cf6 100644 --- a/solution/2300-2399/2387.Median of a Row Wise Sorted Matrix/README_EN.md +++ b/solution/2300-2399/2387.Median of a Row Wise Sorted Matrix/README_EN.md @@ -1,4 +1,4 @@ -# [2387. Median of a Row Wise Sorted Matrix](https://leetcode.com/problems/median-of-a-row-wise-sorted-matrix) +# [2387. Median of a Row Wise Sorted Matrix 🔒](https://leetcode.com/problems/median-of-a-row-wise-sorted-matrix) [中文文档](/solution/2300-2399/2387.Median%20of%20a%20Row%20Wise%20Sorted%20Matrix/README.md) diff --git a/solution/2300-2399/2388.Change Null Values in a Table to the Previous Value/README.md b/solution/2300-2399/2388.Change Null Values in a Table to the Previous Value/README.md index 4a9cda10ca564..d295a4f749819 100644 --- a/solution/2300-2399/2388.Change Null Values in a Table to the Previous Value/README.md +++ b/solution/2300-2399/2388.Change Null Values in a Table to the Previous Value/README.md @@ -1,4 +1,4 @@ -# [2388. 将表中的空值更改为前一个值](https://leetcode.cn/problems/change-null-values-in-a-table-to-the-previous-value) +# [2388. 将表中的空值更改为前一个值 🔒](https://leetcode.cn/problems/change-null-values-in-a-table-to-the-previous-value) [English Version](/solution/2300-2399/2388.Change%20Null%20Values%20in%20a%20Table%20to%20the%20Previous%20Value/README_EN.md) diff --git a/solution/2300-2399/2388.Change Null Values in a Table to the Previous Value/README_EN.md b/solution/2300-2399/2388.Change Null Values in a Table to the Previous Value/README_EN.md index 40bc6dc58166f..8d185c884484d 100644 --- a/solution/2300-2399/2388.Change Null Values in a Table to the Previous Value/README_EN.md +++ b/solution/2300-2399/2388.Change Null Values in a Table to the Previous Value/README_EN.md @@ -1,4 +1,4 @@ -# [2388. Change Null Values in a Table to the Previous Value](https://leetcode.com/problems/change-null-values-in-a-table-to-the-previous-value) +# [2388. Change Null Values in a Table to the Previous Value 🔒](https://leetcode.com/problems/change-null-values-in-a-table-to-the-previous-value) [中文文档](/solution/2300-2399/2388.Change%20Null%20Values%20in%20a%20Table%20to%20the%20Previous%20Value/README.md) diff --git a/solution/2300-2399/2393.Count Strictly Increasing Subarrays/README.md b/solution/2300-2399/2393.Count Strictly Increasing Subarrays/README.md index 264f77e979840..9d530e444cfbc 100644 --- a/solution/2300-2399/2393.Count Strictly Increasing Subarrays/README.md +++ b/solution/2300-2399/2393.Count Strictly Increasing Subarrays/README.md @@ -1,4 +1,4 @@ -# [2393. 严格递增的子数组个数](https://leetcode.cn/problems/count-strictly-increasing-subarrays) +# [2393. 严格递增的子数组个数 🔒](https://leetcode.cn/problems/count-strictly-increasing-subarrays) [English Version](/solution/2300-2399/2393.Count%20Strictly%20Increasing%20Subarrays/README_EN.md) diff --git a/solution/2300-2399/2393.Count Strictly Increasing Subarrays/README_EN.md b/solution/2300-2399/2393.Count Strictly Increasing Subarrays/README_EN.md index 1373bb5c1cffe..e27203fcdb9c2 100644 --- a/solution/2300-2399/2393.Count Strictly Increasing Subarrays/README_EN.md +++ b/solution/2300-2399/2393.Count Strictly Increasing Subarrays/README_EN.md @@ -1,4 +1,4 @@ -# [2393. Count Strictly Increasing Subarrays](https://leetcode.com/problems/count-strictly-increasing-subarrays) +# [2393. Count Strictly Increasing Subarrays 🔒](https://leetcode.com/problems/count-strictly-increasing-subarrays) [中文文档](/solution/2300-2399/2393.Count%20Strictly%20Increasing%20Subarrays/README.md) diff --git a/solution/2300-2399/2394.Employees With Deductions/README.md b/solution/2300-2399/2394.Employees With Deductions/README.md index e8543b4f5522b..96bf551fd23f3 100644 --- a/solution/2300-2399/2394.Employees With Deductions/README.md +++ b/solution/2300-2399/2394.Employees With Deductions/README.md @@ -1,4 +1,4 @@ -# [2394. 开除员工](https://leetcode.cn/problems/employees-with-deductions) +# [2394. 开除员工 🔒](https://leetcode.cn/problems/employees-with-deductions) [English Version](/solution/2300-2399/2394.Employees%20With%20Deductions/README_EN.md) diff --git a/solution/2300-2399/2394.Employees With Deductions/README_EN.md b/solution/2300-2399/2394.Employees With Deductions/README_EN.md index 2ff9889e78371..595c2cc8b26c5 100644 --- a/solution/2300-2399/2394.Employees With Deductions/README_EN.md +++ b/solution/2300-2399/2394.Employees With Deductions/README_EN.md @@ -1,4 +1,4 @@ -# [2394. Employees With Deductions](https://leetcode.com/problems/employees-with-deductions) +# [2394. Employees With Deductions 🔒](https://leetcode.com/problems/employees-with-deductions) [中文文档](/solution/2300-2399/2394.Employees%20With%20Deductions/README.md) diff --git a/solution/2400-2499/2403.Minimum Time to Kill All Monsters/README.md b/solution/2400-2499/2403.Minimum Time to Kill All Monsters/README.md index 2c37ac18b0edb..9a72937192705 100644 --- a/solution/2400-2499/2403.Minimum Time to Kill All Monsters/README.md +++ b/solution/2400-2499/2403.Minimum Time to Kill All Monsters/README.md @@ -1,4 +1,4 @@ -# [2403. 杀死所有怪物的最短时间](https://leetcode.cn/problems/minimum-time-to-kill-all-monsters) +# [2403. 杀死所有怪物的最短时间 🔒](https://leetcode.cn/problems/minimum-time-to-kill-all-monsters) [English Version](/solution/2400-2499/2403.Minimum%20Time%20to%20Kill%20All%20Monsters/README_EN.md) diff --git a/solution/2400-2499/2403.Minimum Time to Kill All Monsters/README_EN.md b/solution/2400-2499/2403.Minimum Time to Kill All Monsters/README_EN.md index f07ebafee8af9..ee2d547018bcc 100644 --- a/solution/2400-2499/2403.Minimum Time to Kill All Monsters/README_EN.md +++ b/solution/2400-2499/2403.Minimum Time to Kill All Monsters/README_EN.md @@ -1,4 +1,4 @@ -# [2403. Minimum Time to Kill All Monsters](https://leetcode.com/problems/minimum-time-to-kill-all-monsters) +# [2403. Minimum Time to Kill All Monsters 🔒](https://leetcode.com/problems/minimum-time-to-kill-all-monsters) [中文文档](/solution/2400-2499/2403.Minimum%20Time%20to%20Kill%20All%20Monsters/README.md) diff --git a/solution/2400-2499/2408.Design SQL/README.md b/solution/2400-2499/2408.Design SQL/README.md index 962c1bf2e6b4c..2f4b7a468d91a 100644 --- a/solution/2400-2499/2408.Design SQL/README.md +++ b/solution/2400-2499/2408.Design SQL/README.md @@ -1,4 +1,4 @@ -# [2408. 设计 SQL](https://leetcode.cn/problems/design-sql) +# [2408. 设计 SQL 🔒](https://leetcode.cn/problems/design-sql) [English Version](/solution/2400-2499/2408.Design%20SQL/README_EN.md) diff --git a/solution/2400-2499/2408.Design SQL/README_EN.md b/solution/2400-2499/2408.Design SQL/README_EN.md index e56119246c78c..61352bbea322f 100644 --- a/solution/2400-2499/2408.Design SQL/README_EN.md +++ b/solution/2400-2499/2408.Design SQL/README_EN.md @@ -1,4 +1,4 @@ -# [2408. Design SQL](https://leetcode.com/problems/design-sql) +# [2408. Design SQL 🔒](https://leetcode.com/problems/design-sql) [中文文档](/solution/2400-2499/2408.Design%20SQL/README.md) diff --git a/solution/2400-2499/2417.Closest Fair Integer/README.md b/solution/2400-2499/2417.Closest Fair Integer/README.md index 4865f6191d2b2..41d9ba6be3412 100644 --- a/solution/2400-2499/2417.Closest Fair Integer/README.md +++ b/solution/2400-2499/2417.Closest Fair Integer/README.md @@ -1,4 +1,4 @@ -# [2417. 最近的公平整数](https://leetcode.cn/problems/closest-fair-integer) +# [2417. 最近的公平整数 🔒](https://leetcode.cn/problems/closest-fair-integer) [English Version](/solution/2400-2499/2417.Closest%20Fair%20Integer/README_EN.md) diff --git a/solution/2400-2499/2417.Closest Fair Integer/README_EN.md b/solution/2400-2499/2417.Closest Fair Integer/README_EN.md index 2bf75daa9bc2e..895fa27f16d8b 100644 --- a/solution/2400-2499/2417.Closest Fair Integer/README_EN.md +++ b/solution/2400-2499/2417.Closest Fair Integer/README_EN.md @@ -1,4 +1,4 @@ -# [2417. Closest Fair Integer](https://leetcode.com/problems/closest-fair-integer) +# [2417. Closest Fair Integer 🔒](https://leetcode.com/problems/closest-fair-integer) [中文文档](/solution/2400-2499/2417.Closest%20Fair%20Integer/README.md) diff --git a/solution/2400-2499/2422.Merge Operations to Turn Array Into a Palindrome/README.md b/solution/2400-2499/2422.Merge Operations to Turn Array Into a Palindrome/README.md index 4707d73f85a71..a3f0cc721383d 100644 --- a/solution/2400-2499/2422.Merge Operations to Turn Array Into a Palindrome/README.md +++ b/solution/2400-2499/2422.Merge Operations to Turn Array Into a Palindrome/README.md @@ -1,4 +1,4 @@ -# [2422. 使用合并操作将数组转换为回文序列](https://leetcode.cn/problems/merge-operations-to-turn-array-into-a-palindrome) +# [2422. 使用合并操作将数组转换为回文序列 🔒](https://leetcode.cn/problems/merge-operations-to-turn-array-into-a-palindrome) [English Version](/solution/2400-2499/2422.Merge%20Operations%20to%20Turn%20Array%20Into%20a%20Palindrome/README_EN.md) diff --git a/solution/2400-2499/2422.Merge Operations to Turn Array Into a Palindrome/README_EN.md b/solution/2400-2499/2422.Merge Operations to Turn Array Into a Palindrome/README_EN.md index e462d61f05a7a..dd4f7d606ff61 100644 --- a/solution/2400-2499/2422.Merge Operations to Turn Array Into a Palindrome/README_EN.md +++ b/solution/2400-2499/2422.Merge Operations to Turn Array Into a Palindrome/README_EN.md @@ -1,4 +1,4 @@ -# [2422. Merge Operations to Turn Array Into a Palindrome](https://leetcode.com/problems/merge-operations-to-turn-array-into-a-palindrome) +# [2422. Merge Operations to Turn Array Into a Palindrome 🔒](https://leetcode.com/problems/merge-operations-to-turn-array-into-a-palindrome) [中文文档](/solution/2400-2499/2422.Merge%20Operations%20to%20Turn%20Array%20Into%20a%20Palindrome/README.md) diff --git a/solution/2400-2499/2431.Maximize Total Tastiness of Purchased Fruits/README.md b/solution/2400-2499/2431.Maximize Total Tastiness of Purchased Fruits/README.md index 378d9c4cb81ce..5cdfb39fa7f3b 100644 --- a/solution/2400-2499/2431.Maximize Total Tastiness of Purchased Fruits/README.md +++ b/solution/2400-2499/2431.Maximize Total Tastiness of Purchased Fruits/README.md @@ -1,4 +1,4 @@ -# [2431. 最大限度地提高购买水果的口味](https://leetcode.cn/problems/maximize-total-tastiness-of-purchased-fruits) +# [2431. 最大限度地提高购买水果的口味 🔒](https://leetcode.cn/problems/maximize-total-tastiness-of-purchased-fruits) [English Version](/solution/2400-2499/2431.Maximize%20Total%20Tastiness%20of%20Purchased%20Fruits/README_EN.md) diff --git a/solution/2400-2499/2431.Maximize Total Tastiness of Purchased Fruits/README_EN.md b/solution/2400-2499/2431.Maximize Total Tastiness of Purchased Fruits/README_EN.md index aae5daf1b66bf..981c1fee07267 100644 --- a/solution/2400-2499/2431.Maximize Total Tastiness of Purchased Fruits/README_EN.md +++ b/solution/2400-2499/2431.Maximize Total Tastiness of Purchased Fruits/README_EN.md @@ -1,4 +1,4 @@ -# [2431. Maximize Total Tastiness of Purchased Fruits](https://leetcode.com/problems/maximize-total-tastiness-of-purchased-fruits) +# [2431. Maximize Total Tastiness of Purchased Fruits 🔒](https://leetcode.com/problems/maximize-total-tastiness-of-purchased-fruits) [中文文档](/solution/2400-2499/2431.Maximize%20Total%20Tastiness%20of%20Purchased%20Fruits/README.md) diff --git a/solution/2400-2499/2436.Minimum Split Into Subarrays With GCD Greater Than One/README.md b/solution/2400-2499/2436.Minimum Split Into Subarrays With GCD Greater Than One/README.md index 035761cb928cf..11a2b40c05773 100644 --- a/solution/2400-2499/2436.Minimum Split Into Subarrays With GCD Greater Than One/README.md +++ b/solution/2400-2499/2436.Minimum Split Into Subarrays With GCD Greater Than One/README.md @@ -1,4 +1,4 @@ -# [2436. 使子数组最大公约数大于一的最小分割数](https://leetcode.cn/problems/minimum-split-into-subarrays-with-gcd-greater-than-one) +# [2436. 使子数组最大公约数大于一的最小分割数 🔒](https://leetcode.cn/problems/minimum-split-into-subarrays-with-gcd-greater-than-one) [English Version](/solution/2400-2499/2436.Minimum%20Split%20Into%20Subarrays%20With%20GCD%20Greater%20Than%20One/README_EN.md) diff --git a/solution/2400-2499/2436.Minimum Split Into Subarrays With GCD Greater Than One/README_EN.md b/solution/2400-2499/2436.Minimum Split Into Subarrays With GCD Greater Than One/README_EN.md index d5fec09879621..42bf1af034cc4 100644 --- a/solution/2400-2499/2436.Minimum Split Into Subarrays With GCD Greater Than One/README_EN.md +++ b/solution/2400-2499/2436.Minimum Split Into Subarrays With GCD Greater Than One/README_EN.md @@ -1,4 +1,4 @@ -# [2436. Minimum Split Into Subarrays With GCD Greater Than One](https://leetcode.com/problems/minimum-split-into-subarrays-with-gcd-greater-than-one) +# [2436. Minimum Split Into Subarrays With GCD Greater Than One 🔒](https://leetcode.com/problems/minimum-split-into-subarrays-with-gcd-greater-than-one) [中文文档](/solution/2400-2499/2436.Minimum%20Split%20Into%20Subarrays%20With%20GCD%20Greater%20Than%20One/README.md) diff --git a/solution/2400-2499/2445.Number of Nodes With Value One/README.md b/solution/2400-2499/2445.Number of Nodes With Value One/README.md index 5b88f755e9deb..fc72bd0215d7d 100644 --- a/solution/2400-2499/2445.Number of Nodes With Value One/README.md +++ b/solution/2400-2499/2445.Number of Nodes With Value One/README.md @@ -1,4 +1,4 @@ -# [2445. 值为 1 的节点数](https://leetcode.cn/problems/number-of-nodes-with-value-one) +# [2445. 值为 1 的节点数 🔒](https://leetcode.cn/problems/number-of-nodes-with-value-one) [English Version](/solution/2400-2499/2445.Number%20of%20Nodes%20With%20Value%20One/README_EN.md) diff --git a/solution/2400-2499/2445.Number of Nodes With Value One/README_EN.md b/solution/2400-2499/2445.Number of Nodes With Value One/README_EN.md index f48a9fa3cc1f8..9ef4369bd2710 100644 --- a/solution/2400-2499/2445.Number of Nodes With Value One/README_EN.md +++ b/solution/2400-2499/2445.Number of Nodes With Value One/README_EN.md @@ -1,4 +1,4 @@ -# [2445. Number of Nodes With Value One](https://leetcode.com/problems/number-of-nodes-with-value-one) +# [2445. Number of Nodes With Value One 🔒](https://leetcode.com/problems/number-of-nodes-with-value-one) [中文文档](/solution/2400-2499/2445.Number%20of%20Nodes%20With%20Value%20One/README.md) diff --git a/solution/2400-2499/2450.Number of Distinct Binary Strings After Applying Operations/README.md b/solution/2400-2499/2450.Number of Distinct Binary Strings After Applying Operations/README.md index e5e8eb781707e..c6104a6111fa9 100644 --- a/solution/2400-2499/2450.Number of Distinct Binary Strings After Applying Operations/README.md +++ b/solution/2400-2499/2450.Number of Distinct Binary Strings After Applying Operations/README.md @@ -1,4 +1,4 @@ -# [2450. 应用操作后不同二进制字符串的数量](https://leetcode.cn/problems/number-of-distinct-binary-strings-after-applying-operations) +# [2450. 应用操作后不同二进制字符串的数量 🔒](https://leetcode.cn/problems/number-of-distinct-binary-strings-after-applying-operations) [English Version](/solution/2400-2499/2450.Number%20of%20Distinct%20Binary%20Strings%20After%20Applying%20Operations/README_EN.md) diff --git a/solution/2400-2499/2450.Number of Distinct Binary Strings After Applying Operations/README_EN.md b/solution/2400-2499/2450.Number of Distinct Binary Strings After Applying Operations/README_EN.md index 2d39530916b0e..a8a97b8b7289e 100644 --- a/solution/2400-2499/2450.Number of Distinct Binary Strings After Applying Operations/README_EN.md +++ b/solution/2400-2499/2450.Number of Distinct Binary Strings After Applying Operations/README_EN.md @@ -1,4 +1,4 @@ -# [2450. Number of Distinct Binary Strings After Applying Operations](https://leetcode.com/problems/number-of-distinct-binary-strings-after-applying-operations) +# [2450. Number of Distinct Binary Strings After Applying Operations 🔒](https://leetcode.com/problems/number-of-distinct-binary-strings-after-applying-operations) [中文文档](/solution/2400-2499/2450.Number%20of%20Distinct%20Binary%20Strings%20After%20Applying%20Operations/README.md) diff --git a/solution/2400-2499/2459.Sort Array by Moving Items to Empty Space/README.md b/solution/2400-2499/2459.Sort Array by Moving Items to Empty Space/README.md index 7551434e239d4..a2ad8887fa768 100644 --- a/solution/2400-2499/2459.Sort Array by Moving Items to Empty Space/README.md +++ b/solution/2400-2499/2459.Sort Array by Moving Items to Empty Space/README.md @@ -1,4 +1,4 @@ -# [2459. 通过移动项目到空白区域来排序数组](https://leetcode.cn/problems/sort-array-by-moving-items-to-empty-space) +# [2459. 通过移动项目到空白区域来排序数组 🔒](https://leetcode.cn/problems/sort-array-by-moving-items-to-empty-space) [English Version](/solution/2400-2499/2459.Sort%20Array%20by%20Moving%20Items%20to%20Empty%20Space/README_EN.md) diff --git a/solution/2400-2499/2459.Sort Array by Moving Items to Empty Space/README_EN.md b/solution/2400-2499/2459.Sort Array by Moving Items to Empty Space/README_EN.md index f4e2734081a7a..4dc9d77082b79 100644 --- a/solution/2400-2499/2459.Sort Array by Moving Items to Empty Space/README_EN.md +++ b/solution/2400-2499/2459.Sort Array by Moving Items to Empty Space/README_EN.md @@ -1,4 +1,4 @@ -# [2459. Sort Array by Moving Items to Empty Space](https://leetcode.com/problems/sort-array-by-moving-items-to-empty-space) +# [2459. Sort Array by Moving Items to Empty Space 🔒](https://leetcode.com/problems/sort-array-by-moving-items-to-empty-space) [中文文档](/solution/2400-2499/2459.Sort%20Array%20by%20Moving%20Items%20to%20Empty%20Space/README.md) diff --git a/solution/2400-2499/2464.Minimum Subarrays in a Valid Split/README.md b/solution/2400-2499/2464.Minimum Subarrays in a Valid Split/README.md index f1aab23ba392c..9818716d7ce31 100644 --- a/solution/2400-2499/2464.Minimum Subarrays in a Valid Split/README.md +++ b/solution/2400-2499/2464.Minimum Subarrays in a Valid Split/README.md @@ -1,4 +1,4 @@ -# [2464. 有效分割中的最少子数组数目](https://leetcode.cn/problems/minimum-subarrays-in-a-valid-split) +# [2464. 有效分割中的最少子数组数目 🔒](https://leetcode.cn/problems/minimum-subarrays-in-a-valid-split) [English Version](/solution/2400-2499/2464.Minimum%20Subarrays%20in%20a%20Valid%20Split/README_EN.md) diff --git a/solution/2400-2499/2464.Minimum Subarrays in a Valid Split/README_EN.md b/solution/2400-2499/2464.Minimum Subarrays in a Valid Split/README_EN.md index 6f450b03ba1e6..c396a21384d3b 100644 --- a/solution/2400-2499/2464.Minimum Subarrays in a Valid Split/README_EN.md +++ b/solution/2400-2499/2464.Minimum Subarrays in a Valid Split/README_EN.md @@ -1,4 +1,4 @@ -# [2464. Minimum Subarrays in a Valid Split](https://leetcode.com/problems/minimum-subarrays-in-a-valid-split) +# [2464. Minimum Subarrays in a Valid Split 🔒](https://leetcode.com/problems/minimum-subarrays-in-a-valid-split) [中文文档](/solution/2400-2499/2464.Minimum%20Subarrays%20in%20a%20Valid%20Split/README.md) diff --git a/solution/2400-2499/2473.Minimum Cost to Buy Apples/README.md b/solution/2400-2499/2473.Minimum Cost to Buy Apples/README.md index 87cf775cdb94d..7423b2edb6b14 100644 --- a/solution/2400-2499/2473.Minimum Cost to Buy Apples/README.md +++ b/solution/2400-2499/2473.Minimum Cost to Buy Apples/README.md @@ -1,4 +1,4 @@ -# [2473. 购买苹果的最低成本](https://leetcode.cn/problems/minimum-cost-to-buy-apples) +# [2473. 购买苹果的最低成本 🔒](https://leetcode.cn/problems/minimum-cost-to-buy-apples) [English Version](/solution/2400-2499/2473.Minimum%20Cost%20to%20Buy%20Apples/README_EN.md) diff --git a/solution/2400-2499/2473.Minimum Cost to Buy Apples/README_EN.md b/solution/2400-2499/2473.Minimum Cost to Buy Apples/README_EN.md index 9ee3f3a51181d..628f8a86b3d0c 100644 --- a/solution/2400-2499/2473.Minimum Cost to Buy Apples/README_EN.md +++ b/solution/2400-2499/2473.Minimum Cost to Buy Apples/README_EN.md @@ -1,4 +1,4 @@ -# [2473. Minimum Cost to Buy Apples](https://leetcode.com/problems/minimum-cost-to-buy-apples) +# [2473. Minimum Cost to Buy Apples 🔒](https://leetcode.com/problems/minimum-cost-to-buy-apples) [中文文档](/solution/2400-2499/2473.Minimum%20Cost%20to%20Buy%20Apples/README.md) diff --git a/solution/2400-2499/2474.Customers With Strictly Increasing Purchases/README.md b/solution/2400-2499/2474.Customers With Strictly Increasing Purchases/README.md index ba971d49c6491..e4cf8b64019df 100644 --- a/solution/2400-2499/2474.Customers With Strictly Increasing Purchases/README.md +++ b/solution/2400-2499/2474.Customers With Strictly Increasing Purchases/README.md @@ -1,4 +1,4 @@ -# [2474. 购买量严格增加的客户](https://leetcode.cn/problems/customers-with-strictly-increasing-purchases) +# [2474. 购买量严格增加的客户 🔒](https://leetcode.cn/problems/customers-with-strictly-increasing-purchases) [English Version](/solution/2400-2499/2474.Customers%20With%20Strictly%20Increasing%20Purchases/README_EN.md) diff --git a/solution/2400-2499/2474.Customers With Strictly Increasing Purchases/README_EN.md b/solution/2400-2499/2474.Customers With Strictly Increasing Purchases/README_EN.md index 7448d7844ac5b..bb5152c5fb8c2 100644 --- a/solution/2400-2499/2474.Customers With Strictly Increasing Purchases/README_EN.md +++ b/solution/2400-2499/2474.Customers With Strictly Increasing Purchases/README_EN.md @@ -1,4 +1,4 @@ -# [2474. Customers With Strictly Increasing Purchases](https://leetcode.com/problems/customers-with-strictly-increasing-purchases) +# [2474. Customers With Strictly Increasing Purchases 🔒](https://leetcode.com/problems/customers-with-strictly-increasing-purchases) [中文文档](/solution/2400-2499/2474.Customers%20With%20Strictly%20Increasing%20Purchases/README.md) diff --git a/solution/2400-2499/2479.Maximum XOR of Two Non-Overlapping Subtrees/README.md b/solution/2400-2499/2479.Maximum XOR of Two Non-Overlapping Subtrees/README.md index abe453dd2f0d0..dfb687b000e26 100644 --- a/solution/2400-2499/2479.Maximum XOR of Two Non-Overlapping Subtrees/README.md +++ b/solution/2400-2499/2479.Maximum XOR of Two Non-Overlapping Subtrees/README.md @@ -1,4 +1,4 @@ -# [2479. 两个不重叠子树的最大异或值](https://leetcode.cn/problems/maximum-xor-of-two-non-overlapping-subtrees) +# [2479. 两个不重叠子树的最大异或值 🔒](https://leetcode.cn/problems/maximum-xor-of-two-non-overlapping-subtrees) [English Version](/solution/2400-2499/2479.Maximum%20XOR%20of%20Two%20Non-Overlapping%20Subtrees/README_EN.md) diff --git a/solution/2400-2499/2479.Maximum XOR of Two Non-Overlapping Subtrees/README_EN.md b/solution/2400-2499/2479.Maximum XOR of Two Non-Overlapping Subtrees/README_EN.md index e256d34dad658..4972e7f2f6d20 100644 --- a/solution/2400-2499/2479.Maximum XOR of Two Non-Overlapping Subtrees/README_EN.md +++ b/solution/2400-2499/2479.Maximum XOR of Two Non-Overlapping Subtrees/README_EN.md @@ -1,4 +1,4 @@ -# [2479. Maximum XOR of Two Non-Overlapping Subtrees](https://leetcode.com/problems/maximum-xor-of-two-non-overlapping-subtrees) +# [2479. Maximum XOR of Two Non-Overlapping Subtrees 🔒](https://leetcode.com/problems/maximum-xor-of-two-non-overlapping-subtrees) [中文文档](/solution/2400-2499/2479.Maximum%20XOR%20of%20Two%20Non-Overlapping%20Subtrees/README.md) diff --git a/solution/2400-2499/2480.Form a Chemical Bond/README.md b/solution/2400-2499/2480.Form a Chemical Bond/README.md index 601b9e91fc0ce..f82b11fafddc6 100644 --- a/solution/2400-2499/2480.Form a Chemical Bond/README.md +++ b/solution/2400-2499/2480.Form a Chemical Bond/README.md @@ -1,4 +1,4 @@ -# [2480. 形成化学键](https://leetcode.cn/problems/form-a-chemical-bond) +# [2480. 形成化学键 🔒](https://leetcode.cn/problems/form-a-chemical-bond) [English Version](/solution/2400-2499/2480.Form%20a%20Chemical%20Bond/README_EN.md) diff --git a/solution/2400-2499/2480.Form a Chemical Bond/README_EN.md b/solution/2400-2499/2480.Form a Chemical Bond/README_EN.md index ea57cb6383bea..b2df93de551f9 100644 --- a/solution/2400-2499/2480.Form a Chemical Bond/README_EN.md +++ b/solution/2400-2499/2480.Form a Chemical Bond/README_EN.md @@ -1,4 +1,4 @@ -# [2480. Form a Chemical Bond](https://leetcode.com/problems/form-a-chemical-bond) +# [2480. Form a Chemical Bond 🔒](https://leetcode.com/problems/form-a-chemical-bond) [中文文档](/solution/2400-2499/2480.Form%20a%20Chemical%20Bond/README.md) diff --git a/solution/2400-2499/2489.Number of Substrings With Fixed Ratio/README.md b/solution/2400-2499/2489.Number of Substrings With Fixed Ratio/README.md index 633185a337e29..4a0508a9a93f5 100644 --- a/solution/2400-2499/2489.Number of Substrings With Fixed Ratio/README.md +++ b/solution/2400-2499/2489.Number of Substrings With Fixed Ratio/README.md @@ -1,4 +1,4 @@ -# [2489. 固定比率的子字符串数](https://leetcode.cn/problems/number-of-substrings-with-fixed-ratio) +# [2489. 固定比率的子字符串数 🔒](https://leetcode.cn/problems/number-of-substrings-with-fixed-ratio) [English Version](/solution/2400-2499/2489.Number%20of%20Substrings%20With%20Fixed%20Ratio/README_EN.md) diff --git a/solution/2400-2499/2489.Number of Substrings With Fixed Ratio/README_EN.md b/solution/2400-2499/2489.Number of Substrings With Fixed Ratio/README_EN.md index 6b1389075d95c..31b903eb6d0bb 100644 --- a/solution/2400-2499/2489.Number of Substrings With Fixed Ratio/README_EN.md +++ b/solution/2400-2499/2489.Number of Substrings With Fixed Ratio/README_EN.md @@ -1,4 +1,4 @@ -# [2489. Number of Substrings With Fixed Ratio](https://leetcode.com/problems/number-of-substrings-with-fixed-ratio) +# [2489. Number of Substrings With Fixed Ratio 🔒](https://leetcode.com/problems/number-of-substrings-with-fixed-ratio) [中文文档](/solution/2400-2499/2489.Number%20of%20Substrings%20With%20Fixed%20Ratio/README.md) diff --git a/solution/2400-2499/2494.Merge Overlapping Events in the Same Hall/README.md b/solution/2400-2499/2494.Merge Overlapping Events in the Same Hall/README.md index aca5d6fbddde6..96396eec3049b 100644 --- a/solution/2400-2499/2494.Merge Overlapping Events in the Same Hall/README.md +++ b/solution/2400-2499/2494.Merge Overlapping Events in the Same Hall/README.md @@ -1,4 +1,4 @@ -# [2494. 合并在同一个大厅重叠的活动](https://leetcode.cn/problems/merge-overlapping-events-in-the-same-hall) +# [2494. 合并在同一个大厅重叠的活动 🔒](https://leetcode.cn/problems/merge-overlapping-events-in-the-same-hall) [English Version](/solution/2400-2499/2494.Merge%20Overlapping%20Events%20in%20the%20Same%20Hall/README_EN.md) diff --git a/solution/2400-2499/2494.Merge Overlapping Events in the Same Hall/README_EN.md b/solution/2400-2499/2494.Merge Overlapping Events in the Same Hall/README_EN.md index 8c13d08846caf..199dd0941f633 100644 --- a/solution/2400-2499/2494.Merge Overlapping Events in the Same Hall/README_EN.md +++ b/solution/2400-2499/2494.Merge Overlapping Events in the Same Hall/README_EN.md @@ -1,4 +1,4 @@ -# [2494. Merge Overlapping Events in the Same Hall](https://leetcode.com/problems/merge-overlapping-events-in-the-same-hall) +# [2494. Merge Overlapping Events in the Same Hall 🔒](https://leetcode.com/problems/merge-overlapping-events-in-the-same-hall) [中文文档](/solution/2400-2499/2494.Merge%20Overlapping%20Events%20in%20the%20Same%20Hall/README.md) diff --git a/solution/2400-2499/2495.Number of Subarrays Having Even Product/README.md b/solution/2400-2499/2495.Number of Subarrays Having Even Product/README.md index 86cd72dd72d39..4deb92612e705 100644 --- a/solution/2400-2499/2495.Number of Subarrays Having Even Product/README.md +++ b/solution/2400-2499/2495.Number of Subarrays Having Even Product/README.md @@ -1,4 +1,4 @@ -# [2495. 乘积为偶数的子数组数](https://leetcode.cn/problems/number-of-subarrays-having-even-product) +# [2495. 乘积为偶数的子数组数 🔒](https://leetcode.cn/problems/number-of-subarrays-having-even-product) [English Version](/solution/2400-2499/2495.Number%20of%20Subarrays%20Having%20Even%20Product/README_EN.md) diff --git a/solution/2400-2499/2495.Number of Subarrays Having Even Product/README_EN.md b/solution/2400-2499/2495.Number of Subarrays Having Even Product/README_EN.md index ff25d0147eace..14244202341f9 100644 --- a/solution/2400-2499/2495.Number of Subarrays Having Even Product/README_EN.md +++ b/solution/2400-2499/2495.Number of Subarrays Having Even Product/README_EN.md @@ -1,4 +1,4 @@ -# [2495. Number of Subarrays Having Even Product](https://leetcode.com/problems/number-of-subarrays-having-even-product) +# [2495. Number of Subarrays Having Even Product 🔒](https://leetcode.com/problems/number-of-subarrays-having-even-product) [中文文档](/solution/2400-2499/2495.Number%20of%20Subarrays%20Having%20Even%20Product/README.md) diff --git a/solution/2500-2599/2504.Concatenate the Name and the Profession/README.md b/solution/2500-2599/2504.Concatenate the Name and the Profession/README.md index aa2a0c9c1a79e..f695fbfb764af 100644 --- a/solution/2500-2599/2504.Concatenate the Name and the Profession/README.md +++ b/solution/2500-2599/2504.Concatenate the Name and the Profession/README.md @@ -1,4 +1,4 @@ -# [2504. 把名字和职业联系起来](https://leetcode.cn/problems/concatenate-the-name-and-the-profession) +# [2504. 把名字和职业联系起来 🔒](https://leetcode.cn/problems/concatenate-the-name-and-the-profession) [English Version](/solution/2500-2599/2504.Concatenate%20the%20Name%20and%20the%20Profession/README_EN.md) diff --git a/solution/2500-2599/2504.Concatenate the Name and the Profession/README_EN.md b/solution/2500-2599/2504.Concatenate the Name and the Profession/README_EN.md index 086fd34be3dfb..783f0868be557 100644 --- a/solution/2500-2599/2504.Concatenate the Name and the Profession/README_EN.md +++ b/solution/2500-2599/2504.Concatenate the Name and the Profession/README_EN.md @@ -1,4 +1,4 @@ -# [2504. Concatenate the Name and the Profession](https://leetcode.com/problems/concatenate-the-name-and-the-profession) +# [2504. Concatenate the Name and the Profession 🔒](https://leetcode.com/problems/concatenate-the-name-and-the-profession) [中文文档](/solution/2500-2599/2504.Concatenate%20the%20Name%20and%20the%20Profession/README.md) diff --git a/solution/2500-2599/2505.Bitwise OR of All Subsequence Sums/README.md b/solution/2500-2599/2505.Bitwise OR of All Subsequence Sums/README.md index 39931413ca69e..81ca15bc6f5bb 100644 --- a/solution/2500-2599/2505.Bitwise OR of All Subsequence Sums/README.md +++ b/solution/2500-2599/2505.Bitwise OR of All Subsequence Sums/README.md @@ -1,4 +1,4 @@ -# [2505. 所有子序列和的按位或](https://leetcode.cn/problems/bitwise-or-of-all-subsequence-sums) +# [2505. 所有子序列和的按位或 🔒](https://leetcode.cn/problems/bitwise-or-of-all-subsequence-sums) [English Version](/solution/2500-2599/2505.Bitwise%20OR%20of%20All%20Subsequence%20Sums/README_EN.md) diff --git a/solution/2500-2599/2505.Bitwise OR of All Subsequence Sums/README_EN.md b/solution/2500-2599/2505.Bitwise OR of All Subsequence Sums/README_EN.md index ee8a70ae0fe3a..7a133572a072a 100644 --- a/solution/2500-2599/2505.Bitwise OR of All Subsequence Sums/README_EN.md +++ b/solution/2500-2599/2505.Bitwise OR of All Subsequence Sums/README_EN.md @@ -1,4 +1,4 @@ -# [2505. Bitwise OR of All Subsequence Sums](https://leetcode.com/problems/bitwise-or-of-all-subsequence-sums) +# [2505. Bitwise OR of All Subsequence Sums 🔒](https://leetcode.com/problems/bitwise-or-of-all-subsequence-sums) [中文文档](/solution/2500-2599/2505.Bitwise%20OR%20of%20All%20Subsequence%20Sums/README.md) diff --git a/solution/2500-2599/2510.Check if There is a Path With Equal Number of 0's And 1's/README.md b/solution/2500-2599/2510.Check if There is a Path With Equal Number of 0's And 1's/README.md index 0234a462f0144..013ef2f12a193 100644 --- a/solution/2500-2599/2510.Check if There is a Path With Equal Number of 0's And 1's/README.md +++ b/solution/2500-2599/2510.Check if There is a Path With Equal Number of 0's And 1's/README.md @@ -1,4 +1,4 @@ -# [2510. 检查是否有路径经过相同数量的 0 和 1](https://leetcode.cn/problems/check-if-there-is-a-path-with-equal-number-of-0s-and-1s) +# [2510. 检查是否有路径经过相同数量的 0 和 1 🔒](https://leetcode.cn/problems/check-if-there-is-a-path-with-equal-number-of-0s-and-1s) [English Version](/solution/2500-2599/2510.Check%20if%20There%20is%20a%20Path%20With%20Equal%20Number%20of%200%27s%20And%201%27s/README_EN.md) diff --git a/solution/2500-2599/2510.Check if There is a Path With Equal Number of 0's And 1's/README_EN.md b/solution/2500-2599/2510.Check if There is a Path With Equal Number of 0's And 1's/README_EN.md index 067336a745f34..2a67210714cd6 100644 --- a/solution/2500-2599/2510.Check if There is a Path With Equal Number of 0's And 1's/README_EN.md +++ b/solution/2500-2599/2510.Check if There is a Path With Equal Number of 0's And 1's/README_EN.md @@ -1,4 +1,4 @@ -# [2510. Check if There is a Path With Equal Number of 0's And 1's](https://leetcode.com/problems/check-if-there-is-a-path-with-equal-number-of-0s-and-1s) +# [2510. Check if There is a Path With Equal Number of 0's And 1's 🔒](https://leetcode.com/problems/check-if-there-is-a-path-with-equal-number-of-0s-and-1s) [中文文档](/solution/2500-2599/2510.Check%20if%20There%20is%20a%20Path%20With%20Equal%20Number%20of%200%27s%20And%201%27s/README.md) diff --git a/solution/2500-2599/2519.Count the Number of K-Big Indices/README.md b/solution/2500-2599/2519.Count the Number of K-Big Indices/README.md index 7eceb4ea7c73f..49ded95a5d7b3 100644 --- a/solution/2500-2599/2519.Count the Number of K-Big Indices/README.md +++ b/solution/2500-2599/2519.Count the Number of K-Big Indices/README.md @@ -1,4 +1,4 @@ -# [2519. 统计 K-Big 索引的数量](https://leetcode.cn/problems/count-the-number-of-k-big-indices) +# [2519. 统计 K-Big 索引的数量 🔒](https://leetcode.cn/problems/count-the-number-of-k-big-indices) [English Version](/solution/2500-2599/2519.Count%20the%20Number%20of%20K-Big%20Indices/README_EN.md) diff --git a/solution/2500-2599/2519.Count the Number of K-Big Indices/README_EN.md b/solution/2500-2599/2519.Count the Number of K-Big Indices/README_EN.md index d41f80041bd7b..b7064f779fbbd 100644 --- a/solution/2500-2599/2519.Count the Number of K-Big Indices/README_EN.md +++ b/solution/2500-2599/2519.Count the Number of K-Big Indices/README_EN.md @@ -1,4 +1,4 @@ -# [2519. Count the Number of K-Big Indices](https://leetcode.com/problems/count-the-number-of-k-big-indices) +# [2519. Count the Number of K-Big Indices 🔒](https://leetcode.com/problems/count-the-number-of-k-big-indices) [中文文档](/solution/2500-2599/2519.Count%20the%20Number%20of%20K-Big%20Indices/README.md) diff --git a/solution/2500-2599/2524.Maximum Frequency Score of a Subarray/README.md b/solution/2500-2599/2524.Maximum Frequency Score of a Subarray/README.md index ac7fa0c0acdc5..778e20931de5e 100644 --- a/solution/2500-2599/2524.Maximum Frequency Score of a Subarray/README.md +++ b/solution/2500-2599/2524.Maximum Frequency Score of a Subarray/README.md @@ -1,4 +1,4 @@ -# [2524. 子数组的最大频率分数](https://leetcode.cn/problems/maximum-frequency-score-of-a-subarray) +# [2524. 子数组的最大频率分数 🔒](https://leetcode.cn/problems/maximum-frequency-score-of-a-subarray) [English Version](/solution/2500-2599/2524.Maximum%20Frequency%20Score%20of%20a%20Subarray/README_EN.md) diff --git a/solution/2500-2599/2524.Maximum Frequency Score of a Subarray/README_EN.md b/solution/2500-2599/2524.Maximum Frequency Score of a Subarray/README_EN.md index a3d944b125e5d..d34e74fd2aa5e 100644 --- a/solution/2500-2599/2524.Maximum Frequency Score of a Subarray/README_EN.md +++ b/solution/2500-2599/2524.Maximum Frequency Score of a Subarray/README_EN.md @@ -1,4 +1,4 @@ -# [2524. Maximum Frequency Score of a Subarray](https://leetcode.com/problems/maximum-frequency-score-of-a-subarray) +# [2524. Maximum Frequency Score of a Subarray 🔒](https://leetcode.com/problems/maximum-frequency-score-of-a-subarray) [中文文档](/solution/2500-2599/2524.Maximum%20Frequency%20Score%20of%20a%20Subarray/README.md) diff --git a/solution/2500-2599/2533.Number of Good Binary Strings/README.md b/solution/2500-2599/2533.Number of Good Binary Strings/README.md index 770b4abb36679..85ab007e42f87 100644 --- a/solution/2500-2599/2533.Number of Good Binary Strings/README.md +++ b/solution/2500-2599/2533.Number of Good Binary Strings/README.md @@ -1,4 +1,4 @@ -# [2533. 好二进制字符串的数量](https://leetcode.cn/problems/number-of-good-binary-strings) +# [2533. 好二进制字符串的数量 🔒](https://leetcode.cn/problems/number-of-good-binary-strings) [English Version](/solution/2500-2599/2533.Number%20of%20Good%20Binary%20Strings/README_EN.md) diff --git a/solution/2500-2599/2533.Number of Good Binary Strings/README_EN.md b/solution/2500-2599/2533.Number of Good Binary Strings/README_EN.md index cb98564eb968e..203998a7401b5 100644 --- a/solution/2500-2599/2533.Number of Good Binary Strings/README_EN.md +++ b/solution/2500-2599/2533.Number of Good Binary Strings/README_EN.md @@ -1,4 +1,4 @@ -# [2533. Number of Good Binary Strings](https://leetcode.com/problems/number-of-good-binary-strings) +# [2533. Number of Good Binary Strings 🔒](https://leetcode.com/problems/number-of-good-binary-strings) [中文文档](/solution/2500-2599/2533.Number%20of%20Good%20Binary%20Strings/README.md) diff --git a/solution/2500-2599/2534.Time Taken to Cross the Door/README.md b/solution/2500-2599/2534.Time Taken to Cross the Door/README.md index 9abc79bf0106d..5d4a9b3e386e5 100644 --- a/solution/2500-2599/2534.Time Taken to Cross the Door/README.md +++ b/solution/2500-2599/2534.Time Taken to Cross the Door/README.md @@ -1,4 +1,4 @@ -# [2534. 通过门的时间](https://leetcode.cn/problems/time-taken-to-cross-the-door) +# [2534. 通过门的时间 🔒](https://leetcode.cn/problems/time-taken-to-cross-the-door) [English Version](/solution/2500-2599/2534.Time%20Taken%20to%20Cross%20the%20Door/README_EN.md) diff --git a/solution/2500-2599/2534.Time Taken to Cross the Door/README_EN.md b/solution/2500-2599/2534.Time Taken to Cross the Door/README_EN.md index 536191b4b4b0a..17b79775cec53 100644 --- a/solution/2500-2599/2534.Time Taken to Cross the Door/README_EN.md +++ b/solution/2500-2599/2534.Time Taken to Cross the Door/README_EN.md @@ -1,4 +1,4 @@ -# [2534. Time Taken to Cross the Door](https://leetcode.com/problems/time-taken-to-cross-the-door) +# [2534. Time Taken to Cross the Door 🔒](https://leetcode.com/problems/time-taken-to-cross-the-door) [中文文档](/solution/2500-2599/2534.Time%20Taken%20to%20Cross%20the%20Door/README.md) diff --git a/solution/2500-2599/2539.Count the Number of Good Subsequences/README.md b/solution/2500-2599/2539.Count the Number of Good Subsequences/README.md index ce18c7dc293fc..7418fe60c393b 100644 --- a/solution/2500-2599/2539.Count the Number of Good Subsequences/README.md +++ b/solution/2500-2599/2539.Count the Number of Good Subsequences/README.md @@ -1,4 +1,4 @@ -# [2539. 好子序列的个数](https://leetcode.cn/problems/count-the-number-of-good-subsequences) +# [2539. 好子序列的个数 🔒](https://leetcode.cn/problems/count-the-number-of-good-subsequences) [English Version](/solution/2500-2599/2539.Count%20the%20Number%20of%20Good%20Subsequences/README_EN.md) diff --git a/solution/2500-2599/2539.Count the Number of Good Subsequences/README_EN.md b/solution/2500-2599/2539.Count the Number of Good Subsequences/README_EN.md index 6b3f3bf3cf072..1caad9870cd75 100644 --- a/solution/2500-2599/2539.Count the Number of Good Subsequences/README_EN.md +++ b/solution/2500-2599/2539.Count the Number of Good Subsequences/README_EN.md @@ -1,4 +1,4 @@ -# [2539. Count the Number of Good Subsequences](https://leetcode.com/problems/count-the-number-of-good-subsequences) +# [2539. Count the Number of Good Subsequences 🔒](https://leetcode.com/problems/count-the-number-of-good-subsequences) [中文文档](/solution/2500-2599/2539.Count%20the%20Number%20of%20Good%20Subsequences/README.md) diff --git a/solution/2500-2599/2548.Maximum Price to Fill a Bag/README.md b/solution/2500-2599/2548.Maximum Price to Fill a Bag/README.md index c0cca9abb367c..125a30b4dad61 100644 --- a/solution/2500-2599/2548.Maximum Price to Fill a Bag/README.md +++ b/solution/2500-2599/2548.Maximum Price to Fill a Bag/README.md @@ -1,4 +1,4 @@ -# [2548. 填满背包的最大价格](https://leetcode.cn/problems/maximum-price-to-fill-a-bag) +# [2548. 填满背包的最大价格 🔒](https://leetcode.cn/problems/maximum-price-to-fill-a-bag) [English Version](/solution/2500-2599/2548.Maximum%20Price%20to%20Fill%20a%20Bag/README_EN.md) diff --git a/solution/2500-2599/2548.Maximum Price to Fill a Bag/README_EN.md b/solution/2500-2599/2548.Maximum Price to Fill a Bag/README_EN.md index b4e809570f0c2..db84932833d81 100644 --- a/solution/2500-2599/2548.Maximum Price to Fill a Bag/README_EN.md +++ b/solution/2500-2599/2548.Maximum Price to Fill a Bag/README_EN.md @@ -1,4 +1,4 @@ -# [2548. Maximum Price to Fill a Bag](https://leetcode.com/problems/maximum-price-to-fill-a-bag) +# [2548. Maximum Price to Fill a Bag 🔒](https://leetcode.com/problems/maximum-price-to-fill-a-bag) [中文文档](/solution/2500-2599/2548.Maximum%20Price%20to%20Fill%20a%20Bag/README.md) diff --git a/solution/2500-2599/2557.Maximum Number of Integers to Choose From a Range II/README.md b/solution/2500-2599/2557.Maximum Number of Integers to Choose From a Range II/README.md index 94216dab38e3c..612644b505017 100644 --- a/solution/2500-2599/2557.Maximum Number of Integers to Choose From a Range II/README.md +++ b/solution/2500-2599/2557.Maximum Number of Integers to Choose From a Range II/README.md @@ -1,4 +1,4 @@ -# [2557. 从一个范围内选择最多整数 II](https://leetcode.cn/problems/maximum-number-of-integers-to-choose-from-a-range-ii) +# [2557. 从一个范围内选择最多整数 II 🔒](https://leetcode.cn/problems/maximum-number-of-integers-to-choose-from-a-range-ii) [English Version](/solution/2500-2599/2557.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20II/README_EN.md) diff --git a/solution/2500-2599/2557.Maximum Number of Integers to Choose From a Range II/README_EN.md b/solution/2500-2599/2557.Maximum Number of Integers to Choose From a Range II/README_EN.md index 8be2aecea6e7e..cd6f69bfe9ace 100644 --- a/solution/2500-2599/2557.Maximum Number of Integers to Choose From a Range II/README_EN.md +++ b/solution/2500-2599/2557.Maximum Number of Integers to Choose From a Range II/README_EN.md @@ -1,4 +1,4 @@ -# [2557. Maximum Number of Integers to Choose From a Range II](https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-ii) +# [2557. Maximum Number of Integers to Choose From a Range II 🔒](https://leetcode.com/problems/maximum-number-of-integers-to-choose-from-a-range-ii) [中文文档](/solution/2500-2599/2557.Maximum%20Number%20of%20Integers%20to%20Choose%20From%20a%20Range%20II/README.md) diff --git a/solution/2500-2599/2590.Design a Todo List/README.md b/solution/2500-2599/2590.Design a Todo List/README.md index 7eb747ad17ee0..b24dc53f5b3ad 100644 --- a/solution/2500-2599/2590.Design a Todo List/README.md +++ b/solution/2500-2599/2590.Design a Todo List/README.md @@ -1,4 +1,4 @@ -# [2590. 设计一个待办事项清单](https://leetcode.cn/problems/design-a-todo-list) +# [2590. 设计一个待办事项清单 🔒](https://leetcode.cn/problems/design-a-todo-list) [English Version](/solution/2500-2599/2590.Design%20a%20Todo%20List/README_EN.md) diff --git a/solution/2500-2599/2590.Design a Todo List/README_EN.md b/solution/2500-2599/2590.Design a Todo List/README_EN.md index 88caf819e782d..1b6b8800ac9e6 100644 --- a/solution/2500-2599/2590.Design a Todo List/README_EN.md +++ b/solution/2500-2599/2590.Design a Todo List/README_EN.md @@ -1,4 +1,4 @@ -# [2590. Design a Todo List](https://leetcode.com/problems/design-a-todo-list) +# [2590. Design a Todo List 🔒](https://leetcode.com/problems/design-a-todo-list) [中文文档](/solution/2500-2599/2590.Design%20a%20Todo%20List/README.md) diff --git a/solution/2500-2599/2599.Make the Prefix Sum Non-negative/README.md b/solution/2500-2599/2599.Make the Prefix Sum Non-negative/README.md index f9d83c761a820..3b82aff7d390c 100644 --- a/solution/2500-2599/2599.Make the Prefix Sum Non-negative/README.md +++ b/solution/2500-2599/2599.Make the Prefix Sum Non-negative/README.md @@ -1,4 +1,4 @@ -# [2599. 使前缀和数组非负](https://leetcode.cn/problems/make-the-prefix-sum-non-negative) +# [2599. 使前缀和数组非负 🔒](https://leetcode.cn/problems/make-the-prefix-sum-non-negative) [English Version](/solution/2500-2599/2599.Make%20the%20Prefix%20Sum%20Non-negative/README_EN.md) diff --git a/solution/2500-2599/2599.Make the Prefix Sum Non-negative/README_EN.md b/solution/2500-2599/2599.Make the Prefix Sum Non-negative/README_EN.md index f32f3ed161daf..338599b2c9391 100644 --- a/solution/2500-2599/2599.Make the Prefix Sum Non-negative/README_EN.md +++ b/solution/2500-2599/2599.Make the Prefix Sum Non-negative/README_EN.md @@ -1,4 +1,4 @@ -# [2599. Make the Prefix Sum Non-negative](https://leetcode.com/problems/make-the-prefix-sum-non-negative) +# [2599. Make the Prefix Sum Non-negative 🔒](https://leetcode.com/problems/make-the-prefix-sum-non-negative) [中文文档](/solution/2500-2599/2599.Make%20the%20Prefix%20Sum%20Non-negative/README.md) diff --git a/solution/2600-2699/2604.Minimum Time to Eat All Grains/README.md b/solution/2600-2699/2604.Minimum Time to Eat All Grains/README.md index 634429bedd3b1..6ebc5b306a1fe 100644 --- a/solution/2600-2699/2604.Minimum Time to Eat All Grains/README.md +++ b/solution/2600-2699/2604.Minimum Time to Eat All Grains/README.md @@ -1,4 +1,4 @@ -# [2604. 吃掉所有谷子的最短时间](https://leetcode.cn/problems/minimum-time-to-eat-all-grains) +# [2604. 吃掉所有谷子的最短时间 🔒](https://leetcode.cn/problems/minimum-time-to-eat-all-grains) [English Version](/solution/2600-2699/2604.Minimum%20Time%20to%20Eat%20All%20Grains/README_EN.md) diff --git a/solution/2600-2699/2604.Minimum Time to Eat All Grains/README_EN.md b/solution/2600-2699/2604.Minimum Time to Eat All Grains/README_EN.md index 5c3061117e0c0..1de3f3b3c950a 100644 --- a/solution/2600-2699/2604.Minimum Time to Eat All Grains/README_EN.md +++ b/solution/2600-2699/2604.Minimum Time to Eat All Grains/README_EN.md @@ -1,4 +1,4 @@ -# [2604. Minimum Time to Eat All Grains](https://leetcode.com/problems/minimum-time-to-eat-all-grains) +# [2604. Minimum Time to Eat All Grains 🔒](https://leetcode.com/problems/minimum-time-to-eat-all-grains) [中文文档](/solution/2600-2699/2604.Minimum%20Time%20to%20Eat%20All%20Grains/README.md) diff --git a/solution/2600-2699/2613.Beautiful Pairs/README.md b/solution/2600-2699/2613.Beautiful Pairs/README.md index 73279fe7c7b93..64b090614e2ce 100644 --- a/solution/2600-2699/2613.Beautiful Pairs/README.md +++ b/solution/2600-2699/2613.Beautiful Pairs/README.md @@ -1,4 +1,4 @@ -# [2613. 美数对](https://leetcode.cn/problems/beautiful-pairs) +# [2613. 美数对 🔒](https://leetcode.cn/problems/beautiful-pairs) [English Version](/solution/2600-2699/2613.Beautiful%20Pairs/README_EN.md) diff --git a/solution/2600-2699/2613.Beautiful Pairs/README_EN.md b/solution/2600-2699/2613.Beautiful Pairs/README_EN.md index 336898c2f8c97..f4657665341c6 100644 --- a/solution/2600-2699/2613.Beautiful Pairs/README_EN.md +++ b/solution/2600-2699/2613.Beautiful Pairs/README_EN.md @@ -1,4 +1,4 @@ -# [2613. Beautiful Pairs](https://leetcode.com/problems/beautiful-pairs) +# [2613. Beautiful Pairs 🔒](https://leetcode.com/problems/beautiful-pairs) [中文文档](/solution/2600-2699/2613.Beautiful%20Pairs/README.md) diff --git a/solution/2600-2699/2628.JSON Deep Equal/README.md b/solution/2600-2699/2628.JSON Deep Equal/README.md index f929fecd813b2..13d617f79527a 100644 --- a/solution/2600-2699/2628.JSON Deep Equal/README.md +++ b/solution/2600-2699/2628.JSON Deep Equal/README.md @@ -1,4 +1,4 @@ -# [2628. 完全相等的 JSON 字符串](https://leetcode.cn/problems/json-deep-equal) +# [2628. 完全相等的 JSON 字符串 🔒](https://leetcode.cn/problems/json-deep-equal) [English Version](/solution/2600-2699/2628.JSON%20Deep%20Equal/README_EN.md) diff --git a/solution/2600-2699/2628.JSON Deep Equal/README_EN.md b/solution/2600-2699/2628.JSON Deep Equal/README_EN.md index b0a7fa5195ece..46b3c726d1b74 100644 --- a/solution/2600-2699/2628.JSON Deep Equal/README_EN.md +++ b/solution/2600-2699/2628.JSON Deep Equal/README_EN.md @@ -1,4 +1,4 @@ -# [2628. JSON Deep Equal](https://leetcode.com/problems/json-deep-equal) +# [2628. JSON Deep Equal 🔒](https://leetcode.com/problems/json-deep-equal) [中文文档](/solution/2600-2699/2628.JSON%20Deep%20Equal/README.md) diff --git a/solution/2600-2699/2632.Curry/README.md b/solution/2600-2699/2632.Curry/README.md index 27db503d0ad5a..82a8c4e0bb4bb 100644 --- a/solution/2600-2699/2632.Curry/README.md +++ b/solution/2600-2699/2632.Curry/README.md @@ -1,4 +1,4 @@ -# [2632. 柯里化](https://leetcode.cn/problems/curry) +# [2632. 柯里化 🔒](https://leetcode.cn/problems/curry) [English Version](/solution/2600-2699/2632.Curry/README_EN.md) diff --git a/solution/2600-2699/2632.Curry/README_EN.md b/solution/2600-2699/2632.Curry/README_EN.md index 6011e45c0af0f..bd600bdf704eb 100644 --- a/solution/2600-2699/2632.Curry/README_EN.md +++ b/solution/2600-2699/2632.Curry/README_EN.md @@ -1,6 +1,6 @@ -# [2632. Curry](https://leetcode.com/problems/curry) +# [2632. Curry 🔒](https://leetcode.com/problems/curry) -[中文文档](/solution/2600-2699/2632.Curry/README.md) +[中文文档](/solution/2600-2699/2632.Curry 🔒/README.md) diff --git a/solution/2600-2699/2633.Convert Object to JSON String/README.md b/solution/2600-2699/2633.Convert Object to JSON String/README.md index 410199c26d59a..2abcc6c9b1d8f 100644 --- a/solution/2600-2699/2633.Convert Object to JSON String/README.md +++ b/solution/2600-2699/2633.Convert Object to JSON String/README.md @@ -1,4 +1,4 @@ -# [2633. 将对象转换为 JSON 字符串](https://leetcode.cn/problems/convert-object-to-json-string) +# [2633. 将对象转换为 JSON 字符串 🔒](https://leetcode.cn/problems/convert-object-to-json-string) [English Version](/solution/2600-2699/2633.Convert%20Object%20to%20JSON%20String/README_EN.md) diff --git a/solution/2600-2699/2633.Convert Object to JSON String/README_EN.md b/solution/2600-2699/2633.Convert Object to JSON String/README_EN.md index fefb6f3773d40..713992eb07bf7 100644 --- a/solution/2600-2699/2633.Convert Object to JSON String/README_EN.md +++ b/solution/2600-2699/2633.Convert Object to JSON String/README_EN.md @@ -1,4 +1,4 @@ -# [2633. Convert Object to JSON String](https://leetcode.com/problems/convert-object-to-json-string) +# [2633. Convert Object to JSON String 🔒](https://leetcode.com/problems/convert-object-to-json-string) [中文文档](/solution/2600-2699/2633.Convert%20Object%20to%20JSON%20String/README.md) diff --git a/solution/2600-2699/2636.Promise Pool/README.md b/solution/2600-2699/2636.Promise Pool/README.md index 880ddf4d007b1..80d40572a620d 100644 --- a/solution/2600-2699/2636.Promise Pool/README.md +++ b/solution/2600-2699/2636.Promise Pool/README.md @@ -1,4 +1,4 @@ -# [2636. Promise 对象池](https://leetcode.cn/problems/promise-pool) +# [2636. Promise 对象池 🔒](https://leetcode.cn/problems/promise-pool) [English Version](/solution/2600-2699/2636.Promise%20Pool/README_EN.md) diff --git a/solution/2600-2699/2636.Promise Pool/README_EN.md b/solution/2600-2699/2636.Promise Pool/README_EN.md index 6191da1e6ff0d..58b080505ed4b 100644 --- a/solution/2600-2699/2636.Promise Pool/README_EN.md +++ b/solution/2600-2699/2636.Promise Pool/README_EN.md @@ -1,4 +1,4 @@ -# [2636. Promise Pool](https://leetcode.com/problems/promise-pool) +# [2636. Promise Pool 🔒](https://leetcode.com/problems/promise-pool) [中文文档](/solution/2600-2699/2636.Promise%20Pool/README.md) diff --git a/solution/2600-2699/2638.Count the Number of K-Free Subsets/README.md b/solution/2600-2699/2638.Count the Number of K-Free Subsets/README.md index a48602a0deec5..159a1d2d05e85 100644 --- a/solution/2600-2699/2638.Count the Number of K-Free Subsets/README.md +++ b/solution/2600-2699/2638.Count the Number of K-Free Subsets/README.md @@ -1,4 +1,4 @@ -# [2638. 统计 K-Free 子集的总数](https://leetcode.cn/problems/count-the-number-of-k-free-subsets) +# [2638. 统计 K-Free 子集的总数 🔒](https://leetcode.cn/problems/count-the-number-of-k-free-subsets) [English Version](/solution/2600-2699/2638.Count%20the%20Number%20of%20K-Free%20Subsets/README_EN.md) diff --git a/solution/2600-2699/2638.Count the Number of K-Free Subsets/README_EN.md b/solution/2600-2699/2638.Count the Number of K-Free Subsets/README_EN.md index 25be25c3e353a..3cdd5e591c167 100644 --- a/solution/2600-2699/2638.Count the Number of K-Free Subsets/README_EN.md +++ b/solution/2600-2699/2638.Count the Number of K-Free Subsets/README_EN.md @@ -1,4 +1,4 @@ -# [2638. Count the Number of K-Free Subsets](https://leetcode.com/problems/count-the-number-of-k-free-subsets) +# [2638. Count the Number of K-Free Subsets 🔒](https://leetcode.com/problems/count-the-number-of-k-free-subsets) [中文文档](/solution/2600-2699/2638.Count%20the%20Number%20of%20K-Free%20Subsets/README.md) diff --git a/solution/2600-2699/2647.Color the Triangle Red/README.md b/solution/2600-2699/2647.Color the Triangle Red/README.md index 00f13e0df156c..fc7ce584adb9a 100644 --- a/solution/2600-2699/2647.Color the Triangle Red/README.md +++ b/solution/2600-2699/2647.Color the Triangle Red/README.md @@ -1,4 +1,4 @@ -# [2647. 把三角形染成红色](https://leetcode.cn/problems/color-the-triangle-red) +# [2647. 把三角形染成红色 🔒](https://leetcode.cn/problems/color-the-triangle-red) [English Version](/solution/2600-2699/2647.Color%20the%20Triangle%20Red/README_EN.md) diff --git a/solution/2600-2699/2647.Color the Triangle Red/README_EN.md b/solution/2600-2699/2647.Color the Triangle Red/README_EN.md index 2eecd69a451f2..10d3bd8a24149 100644 --- a/solution/2600-2699/2647.Color the Triangle Red/README_EN.md +++ b/solution/2600-2699/2647.Color the Triangle Red/README_EN.md @@ -1,4 +1,4 @@ -# [2647. Color the Triangle Red](https://leetcode.com/problems/color-the-triangle-red) +# [2647. Color the Triangle Red 🔒](https://leetcode.com/problems/color-the-triangle-red) [中文文档](/solution/2600-2699/2647.Color%20the%20Triangle%20Red/README.md) diff --git a/solution/2600-2699/2655.Find Maximal Uncovered Ranges/README.md b/solution/2600-2699/2655.Find Maximal Uncovered Ranges/README.md index 2565373e41d39..f57c604a507dd 100644 --- a/solution/2600-2699/2655.Find Maximal Uncovered Ranges/README.md +++ b/solution/2600-2699/2655.Find Maximal Uncovered Ranges/README.md @@ -1,4 +1,4 @@ -# [2655. 寻找最大长度的未覆盖区间](https://leetcode.cn/problems/find-maximal-uncovered-ranges) +# [2655. 寻找最大长度的未覆盖区间 🔒](https://leetcode.cn/problems/find-maximal-uncovered-ranges) [English Version](/solution/2600-2699/2655.Find%20Maximal%20Uncovered%20Ranges/README_EN.md) diff --git a/solution/2600-2699/2655.Find Maximal Uncovered Ranges/README_EN.md b/solution/2600-2699/2655.Find Maximal Uncovered Ranges/README_EN.md index dfc347cce10b8..e3cddef46ca8c 100644 --- a/solution/2600-2699/2655.Find Maximal Uncovered Ranges/README_EN.md +++ b/solution/2600-2699/2655.Find Maximal Uncovered Ranges/README_EN.md @@ -1,4 +1,4 @@ -# [2655. Find Maximal Uncovered Ranges](https://leetcode.com/problems/find-maximal-uncovered-ranges) +# [2655. Find Maximal Uncovered Ranges 🔒](https://leetcode.com/problems/find-maximal-uncovered-ranges) [中文文档](/solution/2600-2699/2655.Find%20Maximal%20Uncovered%20Ranges/README.md) diff --git "a/solution/2600-2699/2664.The Knight\342\200\231s Tour/README.md" "b/solution/2600-2699/2664.The Knight\342\200\231s Tour/README.md" index c06782ed9b83e..a201726b83a93 100644 --- "a/solution/2600-2699/2664.The Knight\342\200\231s Tour/README.md" +++ "b/solution/2600-2699/2664.The Knight\342\200\231s Tour/README.md" @@ -1,4 +1,4 @@ -# [2664. 巡逻的骑士](https://leetcode.cn/problems/the-knights-tour) +# [2664. 巡逻的骑士 🔒](https://leetcode.cn/problems/the-knights-tour) [English Version](/solution/2600-2699/2664.The%20Knight%E2%80%99s%20Tour/README_EN.md) diff --git "a/solution/2600-2699/2664.The Knight\342\200\231s Tour/README_EN.md" "b/solution/2600-2699/2664.The Knight\342\200\231s Tour/README_EN.md" index 9ac704ee09436..76d9cc41bcefe 100644 --- "a/solution/2600-2699/2664.The Knight\342\200\231s Tour/README_EN.md" +++ "b/solution/2600-2699/2664.The Knight\342\200\231s Tour/README_EN.md" @@ -1,4 +1,4 @@ -# [2664. The Knight’s Tour](https://leetcode.com/problems/the-knights-tour) +# [2664. The Knight’s Tour 🔒](https://leetcode.com/problems/the-knights-tour) [中文文档](/solution/2600-2699/2664.The%20Knight%E2%80%99s%20Tour/README.md) diff --git a/solution/2600-2699/2668.Find Latest Salaries/README.md b/solution/2600-2699/2668.Find Latest Salaries/README.md index cdc8c226fe38e..2956c01eadd63 100644 --- a/solution/2600-2699/2668.Find Latest Salaries/README.md +++ b/solution/2600-2699/2668.Find Latest Salaries/README.md @@ -1,4 +1,4 @@ -# [2668. 查询员工当前薪水](https://leetcode.cn/problems/find-latest-salaries) +# [2668. 查询员工当前薪水 🔒](https://leetcode.cn/problems/find-latest-salaries) [English Version](/solution/2600-2699/2668.Find%20Latest%20Salaries/README_EN.md) diff --git a/solution/2600-2699/2668.Find Latest Salaries/README_EN.md b/solution/2600-2699/2668.Find Latest Salaries/README_EN.md index b6ba85cdb891f..7424eec79e502 100644 --- a/solution/2600-2699/2668.Find Latest Salaries/README_EN.md +++ b/solution/2600-2699/2668.Find Latest Salaries/README_EN.md @@ -1,4 +1,4 @@ -# [2668. Find Latest Salaries](https://leetcode.com/problems/find-latest-salaries) +# [2668. Find Latest Salaries 🔒](https://leetcode.com/problems/find-latest-salaries) [中文文档](/solution/2600-2699/2668.Find%20Latest%20Salaries/README.md) diff --git a/solution/2600-2699/2669.Count Artist Occurrences On Spotify Ranking List/README.md b/solution/2600-2699/2669.Count Artist Occurrences On Spotify Ranking List/README.md index ee0933c72d3f5..fdc39f2ec3377 100644 --- a/solution/2600-2699/2669.Count Artist Occurrences On Spotify Ranking List/README.md +++ b/solution/2600-2699/2669.Count Artist Occurrences On Spotify Ranking List/README.md @@ -1,4 +1,4 @@ -# [2669. 统计 Spotify 排行榜上艺术家出现次数](https://leetcode.cn/problems/count-artist-occurrences-on-spotify-ranking-list) +# [2669. 统计 Spotify 排行榜上艺术家出现次数 🔒](https://leetcode.cn/problems/count-artist-occurrences-on-spotify-ranking-list) [English Version](/solution/2600-2699/2669.Count%20Artist%20Occurrences%20On%20Spotify%20Ranking%20List/README_EN.md) diff --git a/solution/2600-2699/2669.Count Artist Occurrences On Spotify Ranking List/README_EN.md b/solution/2600-2699/2669.Count Artist Occurrences On Spotify Ranking List/README_EN.md index 1e486704ba192..7e55f10ea4744 100644 --- a/solution/2600-2699/2669.Count Artist Occurrences On Spotify Ranking List/README_EN.md +++ b/solution/2600-2699/2669.Count Artist Occurrences On Spotify Ranking List/README_EN.md @@ -1,4 +1,4 @@ -# [2669. Count Artist Occurrences On Spotify Ranking List](https://leetcode.com/problems/count-artist-occurrences-on-spotify-ranking-list) +# [2669. Count Artist Occurrences On Spotify Ranking List 🔒](https://leetcode.com/problems/count-artist-occurrences-on-spotify-ranking-list) [中文文档](/solution/2600-2699/2669.Count%20Artist%20Occurrences%20On%20Spotify%20Ranking%20List/README.md) diff --git a/solution/2600-2699/2674.Split a Circular Linked List/README.md b/solution/2600-2699/2674.Split a Circular Linked List/README.md index df9ae5a38e8fa..9e05db6790df8 100644 --- a/solution/2600-2699/2674.Split a Circular Linked List/README.md +++ b/solution/2600-2699/2674.Split a Circular Linked List/README.md @@ -1,4 +1,4 @@ -# [2674. 拆分循环链表](https://leetcode.cn/problems/split-a-circular-linked-list) +# [2674. 拆分循环链表 🔒](https://leetcode.cn/problems/split-a-circular-linked-list) [English Version](/solution/2600-2699/2674.Split%20a%20Circular%20Linked%20List/README_EN.md) diff --git a/solution/2600-2699/2674.Split a Circular Linked List/README_EN.md b/solution/2600-2699/2674.Split a Circular Linked List/README_EN.md index 750ffcccd3eab..920a3b6c67b6e 100644 --- a/solution/2600-2699/2674.Split a Circular Linked List/README_EN.md +++ b/solution/2600-2699/2674.Split a Circular Linked List/README_EN.md @@ -1,4 +1,4 @@ -# [2674. Split a Circular Linked List](https://leetcode.com/problems/split-a-circular-linked-list) +# [2674. Split a Circular Linked List 🔒](https://leetcode.com/problems/split-a-circular-linked-list) [中文文档](/solution/2600-2699/2674.Split%20a%20Circular%20Linked%20List/README.md) diff --git a/solution/2600-2699/2675.Array of Objects to Matrix/README.md b/solution/2600-2699/2675.Array of Objects to Matrix/README.md index b60633aad6a35..45c4766eebad3 100644 --- a/solution/2600-2699/2675.Array of Objects to Matrix/README.md +++ b/solution/2600-2699/2675.Array of Objects to Matrix/README.md @@ -1,4 +1,4 @@ -# [2675. 将对象数组转换为矩阵](https://leetcode.cn/problems/array-of-objects-to-matrix) +# [2675. 将对象数组转换为矩阵 🔒](https://leetcode.cn/problems/array-of-objects-to-matrix) [English Version](/solution/2600-2699/2675.Array%20of%20Objects%20to%20Matrix/README_EN.md) diff --git a/solution/2600-2699/2675.Array of Objects to Matrix/README_EN.md b/solution/2600-2699/2675.Array of Objects to Matrix/README_EN.md index 5216d4e9ba2a2..199cf51c2f9f0 100644 --- a/solution/2600-2699/2675.Array of Objects to Matrix/README_EN.md +++ b/solution/2600-2699/2675.Array of Objects to Matrix/README_EN.md @@ -1,4 +1,4 @@ -# [2675. Array of Objects to Matrix](https://leetcode.com/problems/array-of-objects-to-matrix) +# [2675. Array of Objects to Matrix 🔒](https://leetcode.com/problems/array-of-objects-to-matrix) [中文文档](/solution/2600-2699/2675.Array%20of%20Objects%20to%20Matrix/README.md) diff --git a/solution/2600-2699/2676.Throttle/README.md b/solution/2600-2699/2676.Throttle/README.md index 4ff0d54713f2d..3375bf5b3e37a 100644 --- a/solution/2600-2699/2676.Throttle/README.md +++ b/solution/2600-2699/2676.Throttle/README.md @@ -1,6 +1,6 @@ -# [2676. 节流](https://leetcode.cn/problems/throttle) +# [2676. 节流 🔒](https://leetcode.cn/problems/throttle) -[English Version](/solution/2600-2699/2676.节流/README_EN.md) +[English Version](/solution/2600-2699/2676.节流🔒/README_EN.md) diff --git a/solution/2600-2699/2676.Throttle/README_EN.md b/solution/2600-2699/2676.Throttle/README_EN.md index 3b0523c53adf9..2089932864de2 100644 --- a/solution/2600-2699/2676.Throttle/README_EN.md +++ b/solution/2600-2699/2676.Throttle/README_EN.md @@ -1,6 +1,6 @@ -# [2676. Throttle](https://leetcode.com/problems/throttle) +# [2676. Throttle 🔒](https://leetcode.com/problems/throttle) -[中文文档](/solution/2600-2699/2676.Throttle/README.md) +[中文文档](/solution/2600-2699/2676.Throttle 🔒/README.md) diff --git a/solution/2600-2699/2686.Immediate Food Delivery III/README.md b/solution/2600-2699/2686.Immediate Food Delivery III/README.md index 2cae8743d7233..de280879925fd 100644 --- a/solution/2600-2699/2686.Immediate Food Delivery III/README.md +++ b/solution/2600-2699/2686.Immediate Food Delivery III/README.md @@ -1,4 +1,4 @@ -# [2686. 即时食物配送 III](https://leetcode.cn/problems/immediate-food-delivery-iii) +# [2686. 即时食物配送 III 🔒](https://leetcode.cn/problems/immediate-food-delivery-iii) [English Version](/solution/2600-2699/2686.Immediate%20Food%20Delivery%20III/README_EN.md) diff --git a/solution/2600-2699/2686.Immediate Food Delivery III/README_EN.md b/solution/2600-2699/2686.Immediate Food Delivery III/README_EN.md index daafb1371a089..80155a18245b1 100644 --- a/solution/2600-2699/2686.Immediate Food Delivery III/README_EN.md +++ b/solution/2600-2699/2686.Immediate Food Delivery III/README_EN.md @@ -1,4 +1,4 @@ -# [2686. Immediate Food Delivery III](https://leetcode.com/problems/immediate-food-delivery-iii) +# [2686. Immediate Food Delivery III 🔒](https://leetcode.com/problems/immediate-food-delivery-iii) [中文文档](/solution/2600-2699/2686.Immediate%20Food%20Delivery%20III/README.md) diff --git a/solution/2600-2699/2687.Bikes Last Time Used/README.md b/solution/2600-2699/2687.Bikes Last Time Used/README.md index e2ddae2c5aafa..60161a2ea1050 100644 --- a/solution/2600-2699/2687.Bikes Last Time Used/README.md +++ b/solution/2600-2699/2687.Bikes Last Time Used/README.md @@ -1,4 +1,4 @@ -# [2687. 自行车的最后使用时间](https://leetcode.cn/problems/bikes-last-time-used) +# [2687. 自行车的最后使用时间 🔒](https://leetcode.cn/problems/bikes-last-time-used) [English Version](/solution/2600-2699/2687.Bikes%20Last%20Time%20Used/README_EN.md) diff --git a/solution/2600-2699/2687.Bikes Last Time Used/README_EN.md b/solution/2600-2699/2687.Bikes Last Time Used/README_EN.md index c443f22f93472..26fb2a842c962 100644 --- a/solution/2600-2699/2687.Bikes Last Time Used/README_EN.md +++ b/solution/2600-2699/2687.Bikes Last Time Used/README_EN.md @@ -1,4 +1,4 @@ -# [2687. Bikes Last Time Used](https://leetcode.com/problems/bikes-last-time-used) +# [2687. Bikes Last Time Used 🔒](https://leetcode.com/problems/bikes-last-time-used) [中文文档](/solution/2600-2699/2687.Bikes%20Last%20Time%20Used/README.md) diff --git a/solution/2600-2699/2688.Find Active Users/README.md b/solution/2600-2699/2688.Find Active Users/README.md index cc9ba170af5e4..fa2ece4982c7f 100644 --- a/solution/2600-2699/2688.Find Active Users/README.md +++ b/solution/2600-2699/2688.Find Active Users/README.md @@ -1,4 +1,4 @@ -# [2688. 查找活跃用户](https://leetcode.cn/problems/find-active-users) +# [2688. 查找活跃用户 🔒](https://leetcode.cn/problems/find-active-users) [English Version](/solution/2600-2699/2688.Find%20Active%20Users/README_EN.md) diff --git a/solution/2600-2699/2688.Find Active Users/README_EN.md b/solution/2600-2699/2688.Find Active Users/README_EN.md index b5641acd16fd7..7d98829e8f4d3 100644 --- a/solution/2600-2699/2688.Find Active Users/README_EN.md +++ b/solution/2600-2699/2688.Find Active Users/README_EN.md @@ -1,4 +1,4 @@ -# [2688. Find Active Users](https://leetcode.com/problems/find-active-users) +# [2688. Find Active Users 🔒](https://leetcode.com/problems/find-active-users) [中文文档](/solution/2600-2699/2688.Find%20Active%20Users/README.md) diff --git a/solution/2600-2699/2689.Extract Kth Character From The Rope Tree/README.md b/solution/2600-2699/2689.Extract Kth Character From The Rope Tree/README.md index 90e8b849b045e..bf0e8dcf2c749 100644 --- a/solution/2600-2699/2689.Extract Kth Character From The Rope Tree/README.md +++ b/solution/2600-2699/2689.Extract Kth Character From The Rope Tree/README.md @@ -1,4 +1,4 @@ -# [2689. 从 Rope 树中提取第 K 个字符](https://leetcode.cn/problems/extract-kth-character-from-the-rope-tree) +# [2689. 从 Rope 树中提取第 K 个字符 🔒](https://leetcode.cn/problems/extract-kth-character-from-the-rope-tree) [English Version](/solution/2600-2699/2689.Extract%20Kth%20Character%20From%20The%20Rope%20Tree/README_EN.md) diff --git a/solution/2600-2699/2689.Extract Kth Character From The Rope Tree/README_EN.md b/solution/2600-2699/2689.Extract Kth Character From The Rope Tree/README_EN.md index 8fb09a47de739..e9cc8e4a93218 100644 --- a/solution/2600-2699/2689.Extract Kth Character From The Rope Tree/README_EN.md +++ b/solution/2600-2699/2689.Extract Kth Character From The Rope Tree/README_EN.md @@ -1,4 +1,4 @@ -# [2689. Extract Kth Character From The Rope Tree](https://leetcode.com/problems/extract-kth-character-from-the-rope-tree) +# [2689. Extract Kth Character From The Rope Tree 🔒](https://leetcode.com/problems/extract-kth-character-from-the-rope-tree) [中文文档](/solution/2600-2699/2689.Extract%20Kth%20Character%20From%20The%20Rope%20Tree/README.md) diff --git a/solution/2600-2699/2690.Infinite Method Object/README.md b/solution/2600-2699/2690.Infinite Method Object/README.md index 281dd27611f5e..30fd9c8c3d71e 100644 --- a/solution/2600-2699/2690.Infinite Method Object/README.md +++ b/solution/2600-2699/2690.Infinite Method Object/README.md @@ -1,4 +1,4 @@ -# [2690. 无穷方法对象](https://leetcode.cn/problems/infinite-method-object) +# [2690. 无穷方法对象 🔒](https://leetcode.cn/problems/infinite-method-object) [English Version](/solution/2600-2699/2690.Infinite%20Method%20Object/README_EN.md) diff --git a/solution/2600-2699/2690.Infinite Method Object/README_EN.md b/solution/2600-2699/2690.Infinite Method Object/README_EN.md index 4e9199f9e1f72..9d0fc24707dd7 100644 --- a/solution/2600-2699/2690.Infinite Method Object/README_EN.md +++ b/solution/2600-2699/2690.Infinite Method Object/README_EN.md @@ -1,4 +1,4 @@ -# [2690. Infinite Method Object](https://leetcode.com/problems/infinite-method-object) +# [2690. Infinite Method Object 🔒](https://leetcode.com/problems/infinite-method-object) [中文文档](/solution/2600-2699/2690.Infinite%20Method%20Object/README.md) diff --git a/solution/2600-2699/2691.Immutability Helper/README.md b/solution/2600-2699/2691.Immutability Helper/README.md index a15cb314032c2..6fea2089c9c7f 100644 --- a/solution/2600-2699/2691.Immutability Helper/README.md +++ b/solution/2600-2699/2691.Immutability Helper/README.md @@ -1,4 +1,4 @@ -# [2691. 不可变辅助工具](https://leetcode.cn/problems/immutability-helper) +# [2691. 不可变辅助工具 🔒](https://leetcode.cn/problems/immutability-helper) [English Version](/solution/2600-2699/2691.Immutability%20Helper/README_EN.md) diff --git a/solution/2600-2699/2691.Immutability Helper/README_EN.md b/solution/2600-2699/2691.Immutability Helper/README_EN.md index d9c80cc506bdb..d7b5b0846e397 100644 --- a/solution/2600-2699/2691.Immutability Helper/README_EN.md +++ b/solution/2600-2699/2691.Immutability Helper/README_EN.md @@ -1,4 +1,4 @@ -# [2691. Immutability Helper](https://leetcode.com/problems/immutability-helper) +# [2691. Immutability Helper 🔒](https://leetcode.com/problems/immutability-helper) [中文文档](/solution/2600-2699/2691.Immutability%20Helper/README.md) diff --git a/solution/2600-2699/2692.Make Object Immutable/README.md b/solution/2600-2699/2692.Make Object Immutable/README.md index 4de277246cab3..cd0b37c909dc1 100644 --- a/solution/2600-2699/2692.Make Object Immutable/README.md +++ b/solution/2600-2699/2692.Make Object Immutable/README.md @@ -1,4 +1,4 @@ -# [2692. 使对象不可变](https://leetcode.cn/problems/make-object-immutable) +# [2692. 使对象不可变 🔒](https://leetcode.cn/problems/make-object-immutable) [English Version](/solution/2600-2699/2692.Make%20Object%20Immutable/README_EN.md) diff --git a/solution/2600-2699/2692.Make Object Immutable/README_EN.md b/solution/2600-2699/2692.Make Object Immutable/README_EN.md index 10e957658f0f1..515733ca00c1b 100644 --- a/solution/2600-2699/2692.Make Object Immutable/README_EN.md +++ b/solution/2600-2699/2692.Make Object Immutable/README_EN.md @@ -1,4 +1,4 @@ -# [2692. Make Object Immutable](https://leetcode.com/problems/make-object-immutable) +# [2692. Make Object Immutable 🔒](https://leetcode.com/problems/make-object-immutable) [中文文档](/solution/2600-2699/2692.Make%20Object%20Immutable/README.md) diff --git a/solution/2700-2799/2700.Differences Between Two Objects/README.md b/solution/2700-2799/2700.Differences Between Two Objects/README.md index 0463126637d24..9da7db2757a59 100644 --- a/solution/2700-2799/2700.Differences Between Two Objects/README.md +++ b/solution/2700-2799/2700.Differences Between Two Objects/README.md @@ -1,4 +1,4 @@ -# [2700. 两个对象之间的差异](https://leetcode.cn/problems/differences-between-two-objects) +# [2700. 两个对象之间的差异 🔒](https://leetcode.cn/problems/differences-between-two-objects) [English Version](/solution/2700-2799/2700.Differences%20Between%20Two%20Objects/README_EN.md) diff --git a/solution/2700-2799/2700.Differences Between Two Objects/README_EN.md b/solution/2700-2799/2700.Differences Between Two Objects/README_EN.md index d677ef4e6c76b..750dc90960221 100644 --- a/solution/2700-2799/2700.Differences Between Two Objects/README_EN.md +++ b/solution/2700-2799/2700.Differences Between Two Objects/README_EN.md @@ -1,4 +1,4 @@ -# [2700. Differences Between Two Objects](https://leetcode.com/problems/differences-between-two-objects) +# [2700. Differences Between Two Objects 🔒](https://leetcode.com/problems/differences-between-two-objects) [中文文档](/solution/2700-2799/2700.Differences%20Between%20Two%20Objects/README.md) diff --git a/solution/2700-2799/2701.Consecutive Transactions with Increasing Amounts/README.md b/solution/2700-2799/2701.Consecutive Transactions with Increasing Amounts/README.md index 4e1128087da31..d49456b4797d5 100644 --- a/solution/2700-2799/2701.Consecutive Transactions with Increasing Amounts/README.md +++ b/solution/2700-2799/2701.Consecutive Transactions with Increasing Amounts/README.md @@ -1,4 +1,4 @@ -# [2701. 连续递增交易](https://leetcode.cn/problems/consecutive-transactions-with-increasing-amounts) +# [2701. 连续递增交易 🔒](https://leetcode.cn/problems/consecutive-transactions-with-increasing-amounts) [English Version](/solution/2700-2799/2701.Consecutive%20Transactions%20with%20Increasing%20Amounts/README_EN.md) diff --git a/solution/2700-2799/2701.Consecutive Transactions with Increasing Amounts/README_EN.md b/solution/2700-2799/2701.Consecutive Transactions with Increasing Amounts/README_EN.md index 5bef30989bda1..ea450cfb3940b 100644 --- a/solution/2700-2799/2701.Consecutive Transactions with Increasing Amounts/README_EN.md +++ b/solution/2700-2799/2701.Consecutive Transactions with Increasing Amounts/README_EN.md @@ -1,4 +1,4 @@ -# [2701. Consecutive Transactions with Increasing Amounts](https://leetcode.com/problems/consecutive-transactions-with-increasing-amounts) +# [2701. Consecutive Transactions with Increasing Amounts 🔒](https://leetcode.com/problems/consecutive-transactions-with-increasing-amounts) [中文文档](/solution/2700-2799/2701.Consecutive%20Transactions%20with%20Increasing%20Amounts/README.md) diff --git a/solution/2700-2799/2702.Minimum Operations to Make Numbers Non-positive/README.md b/solution/2700-2799/2702.Minimum Operations to Make Numbers Non-positive/README.md index e80213d52090c..ba2f141df9162 100644 --- a/solution/2700-2799/2702.Minimum Operations to Make Numbers Non-positive/README.md +++ b/solution/2700-2799/2702.Minimum Operations to Make Numbers Non-positive/README.md @@ -1,4 +1,4 @@ -# [2702. 使数字变为非正数的最小操作次数](https://leetcode.cn/problems/minimum-operations-to-make-numbers-non-positive) +# [2702. 使数字变为非正数的最小操作次数 🔒](https://leetcode.cn/problems/minimum-operations-to-make-numbers-non-positive) [English Version](/solution/2700-2799/2702.Minimum%20Operations%20to%20Make%20Numbers%20Non-positive/README_EN.md) diff --git a/solution/2700-2799/2702.Minimum Operations to Make Numbers Non-positive/README_EN.md b/solution/2700-2799/2702.Minimum Operations to Make Numbers Non-positive/README_EN.md index 55e9ed6b4a635..83e5002c307ae 100644 --- a/solution/2700-2799/2702.Minimum Operations to Make Numbers Non-positive/README_EN.md +++ b/solution/2700-2799/2702.Minimum Operations to Make Numbers Non-positive/README_EN.md @@ -1,4 +1,4 @@ -# [2702. Minimum Operations to Make Numbers Non-positive](https://leetcode.com/problems/minimum-operations-to-make-numbers-non-positive) +# [2702. Minimum Operations to Make Numbers Non-positive 🔒](https://leetcode.com/problems/minimum-operations-to-make-numbers-non-positive) [中文文档](/solution/2700-2799/2702.Minimum%20Operations%20to%20Make%20Numbers%20Non-positive/README.md) diff --git a/solution/2700-2799/2714.Find Shortest Path with K Hops/README.md b/solution/2700-2799/2714.Find Shortest Path with K Hops/README.md index 7ad2090293e1e..f4b74959f9f71 100644 --- a/solution/2700-2799/2714.Find Shortest Path with K Hops/README.md +++ b/solution/2700-2799/2714.Find Shortest Path with K Hops/README.md @@ -1,4 +1,4 @@ -# [2714. 找到最短路径的 K 次跨越](https://leetcode.cn/problems/find-shortest-path-with-k-hops) +# [2714. 找到最短路径的 K 次跨越 🔒](https://leetcode.cn/problems/find-shortest-path-with-k-hops) [English Version](/solution/2700-2799/2714.Find%20Shortest%20Path%20with%20K%20Hops/README_EN.md) diff --git a/solution/2700-2799/2714.Find Shortest Path with K Hops/README_EN.md b/solution/2700-2799/2714.Find Shortest Path with K Hops/README_EN.md index b1917cc7a30da..30025fbb50c84 100644 --- a/solution/2700-2799/2714.Find Shortest Path with K Hops/README_EN.md +++ b/solution/2700-2799/2714.Find Shortest Path with K Hops/README_EN.md @@ -1,4 +1,4 @@ -# [2714. Find Shortest Path with K Hops](https://leetcode.com/problems/find-shortest-path-with-k-hops) +# [2714. Find Shortest Path with K Hops 🔒](https://leetcode.com/problems/find-shortest-path-with-k-hops) [中文文档](/solution/2700-2799/2714.Find%20Shortest%20Path%20with%20K%20Hops/README.md) diff --git a/solution/2700-2799/2720.Popularity Percentage/README.md b/solution/2700-2799/2720.Popularity Percentage/README.md index 951389613f502..f29f16471a38d 100644 --- a/solution/2700-2799/2720.Popularity Percentage/README.md +++ b/solution/2700-2799/2720.Popularity Percentage/README.md @@ -1,4 +1,4 @@ -# [2720. 受欢迎度百分比](https://leetcode.cn/problems/popularity-percentage) +# [2720. 受欢迎度百分比 🔒](https://leetcode.cn/problems/popularity-percentage) [English Version](/solution/2700-2799/2720.Popularity%20Percentage/README_EN.md) diff --git a/solution/2700-2799/2720.Popularity Percentage/README_EN.md b/solution/2700-2799/2720.Popularity Percentage/README_EN.md index 639c27023cae3..deaa559e04943 100644 --- a/solution/2700-2799/2720.Popularity Percentage/README_EN.md +++ b/solution/2700-2799/2720.Popularity Percentage/README_EN.md @@ -1,4 +1,4 @@ -# [2720. Popularity Percentage](https://leetcode.com/problems/popularity-percentage) +# [2720. Popularity Percentage 🔒](https://leetcode.com/problems/popularity-percentage) [中文文档](/solution/2700-2799/2720.Popularity%20Percentage/README.md) diff --git a/solution/2700-2799/2728.Count Houses in a Circular Street/README.md b/solution/2700-2799/2728.Count Houses in a Circular Street/README.md index c91513de034ff..b0db8967a9827 100644 --- a/solution/2700-2799/2728.Count Houses in a Circular Street/README.md +++ b/solution/2700-2799/2728.Count Houses in a Circular Street/README.md @@ -1,4 +1,4 @@ -# [2728. 计算一个环形街道上的房屋数量](https://leetcode.cn/problems/count-houses-in-a-circular-street) +# [2728. 计算一个环形街道上的房屋数量 🔒](https://leetcode.cn/problems/count-houses-in-a-circular-street) [English Version](/solution/2700-2799/2728.Count%20Houses%20in%20a%20Circular%20Street/README_EN.md) @@ -63,7 +63,7 @@ 相似题目： -- [2753. 计算一个环形街道上的房屋数量 II](https://github.com/doocs/leetcode/blob/main/solution/2700-2799/2753.Count%20Houses%20in%20a%20Circular%20Street%20II/README.md) +- [2753. 计算一个环形街道上的房屋数量 🔒 II](https://github.com/doocs/leetcode/blob/main/solution/2700-2799/2753.Count%20Houses%20in%20a%20Circular%20Street%20II/README.md) diff --git a/solution/2700-2799/2728.Count Houses in a Circular Street/README_EN.md b/solution/2700-2799/2728.Count Houses in a Circular Street/README_EN.md index 305dcd8d9a2da..9aa36de98d051 100644 --- a/solution/2700-2799/2728.Count Houses in a Circular Street/README_EN.md +++ b/solution/2700-2799/2728.Count Houses in a Circular Street/README_EN.md @@ -1,4 +1,4 @@ -# [2728. Count Houses in a Circular Street](https://leetcode.com/problems/count-houses-in-a-circular-street) +# [2728. Count Houses in a Circular Street 🔒](https://leetcode.com/problems/count-houses-in-a-circular-street) [中文文档](/solution/2700-2799/2728.Count%20Houses%20in%20a%20Circular%20Street/README.md) diff --git a/solution/2700-2799/2737.Find the Closest Marked Node/README.md b/solution/2700-2799/2737.Find the Closest Marked Node/README.md index cf00b3f20546e..b41575fb29775 100644 --- a/solution/2700-2799/2737.Find the Closest Marked Node/README.md +++ b/solution/2700-2799/2737.Find the Closest Marked Node/README.md @@ -1,4 +1,4 @@ -# [2737. 找到最近的标记节点](https://leetcode.cn/problems/find-the-closest-marked-node) +# [2737. 找到最近的标记节点 🔒](https://leetcode.cn/problems/find-the-closest-marked-node) [English Version](/solution/2700-2799/2737.Find%20the%20Closest%20Marked%20Node/README_EN.md) diff --git a/solution/2700-2799/2737.Find the Closest Marked Node/README_EN.md b/solution/2700-2799/2737.Find the Closest Marked Node/README_EN.md index ef793996f61c4..dadb74c51271a 100644 --- a/solution/2700-2799/2737.Find the Closest Marked Node/README_EN.md +++ b/solution/2700-2799/2737.Find the Closest Marked Node/README_EN.md @@ -1,4 +1,4 @@ -# [2737. Find the Closest Marked Node](https://leetcode.com/problems/find-the-closest-marked-node) +# [2737. Find the Closest Marked Node 🔒](https://leetcode.com/problems/find-the-closest-marked-node) [中文文档](/solution/2700-2799/2737.Find%20the%20Closest%20Marked%20Node/README.md) diff --git a/solution/2700-2799/2738.Count Occurrences in Text/README.md b/solution/2700-2799/2738.Count Occurrences in Text/README.md index 03bb27a88a01a..9371eb05660ba 100644 --- a/solution/2700-2799/2738.Count Occurrences in Text/README.md +++ b/solution/2700-2799/2738.Count Occurrences in Text/README.md @@ -1,4 +1,4 @@ -# [2738. 统计文本中单词的出现次数](https://leetcode.cn/problems/count-occurrences-in-text) +# [2738. 统计文本中单词的出现次数 🔒](https://leetcode.cn/problems/count-occurrences-in-text) [English Version](/solution/2700-2799/2738.Count%20Occurrences%20in%20Text/README_EN.md) diff --git a/solution/2700-2799/2738.Count Occurrences in Text/README_EN.md b/solution/2700-2799/2738.Count Occurrences in Text/README_EN.md index a1d49251095ff..9bcb05243f6b4 100644 --- a/solution/2700-2799/2738.Count Occurrences in Text/README_EN.md +++ b/solution/2700-2799/2738.Count Occurrences in Text/README_EN.md @@ -1,4 +1,4 @@ -# [2738. Count Occurrences in Text](https://leetcode.com/problems/count-occurrences-in-text) +# [2738. Count Occurrences in Text 🔒](https://leetcode.com/problems/count-occurrences-in-text) [中文文档](/solution/2700-2799/2738.Count%20Occurrences%20in%20Text/README.md) diff --git a/solution/2700-2799/2743.Count Substrings Without Repeating Character/README.md b/solution/2700-2799/2743.Count Substrings Without Repeating Character/README.md index 82ae1534e8684..7730b828ef2e9 100644 --- a/solution/2700-2799/2743.Count Substrings Without Repeating Character/README.md +++ b/solution/2700-2799/2743.Count Substrings Without Repeating Character/README.md @@ -1,4 +1,4 @@ -# [2743. 计算没有重复字符的子字符串数量](https://leetcode.cn/problems/count-substrings-without-repeating-character) +# [2743. 计算没有重复字符的子字符串数量 🔒](https://leetcode.cn/problems/count-substrings-without-repeating-character) [English Version](/solution/2700-2799/2743.Count%20Substrings%20Without%20Repeating%20Character/README_EN.md) diff --git a/solution/2700-2799/2743.Count Substrings Without Repeating Character/README_EN.md b/solution/2700-2799/2743.Count Substrings Without Repeating Character/README_EN.md index 9566c9d550a9f..655afa794d764 100644 --- a/solution/2700-2799/2743.Count Substrings Without Repeating Character/README_EN.md +++ b/solution/2700-2799/2743.Count Substrings Without Repeating Character/README_EN.md @@ -1,4 +1,4 @@ -# [2743. Count Substrings Without Repeating Character](https://leetcode.com/problems/count-substrings-without-repeating-character) +# [2743. Count Substrings Without Repeating Character 🔒](https://leetcode.com/problems/count-substrings-without-repeating-character) [中文文档](/solution/2700-2799/2743.Count%20Substrings%20Without%20Repeating%20Character/README.md) diff --git a/solution/2700-2799/2752.Customers with Maximum Number of Transactions on Consecutive Days/README.md b/solution/2700-2799/2752.Customers with Maximum Number of Transactions on Consecutive Days/README.md index df34723e5e575..2745ecef34c0f 100644 --- a/solution/2700-2799/2752.Customers with Maximum Number of Transactions on Consecutive Days/README.md +++ b/solution/2700-2799/2752.Customers with Maximum Number of Transactions on Consecutive Days/README.md @@ -1,4 +1,4 @@ -# [2752. 在连续天数上进行了最多交易次数的顾客](https://leetcode.cn/problems/customers-with-maximum-number-of-transactions-on-consecutive-days) +# [2752. 在连续天数上进行了最多交易次数的顾客 🔒](https://leetcode.cn/problems/customers-with-maximum-number-of-transactions-on-consecutive-days) [English Version](/solution/2700-2799/2752.Customers%20with%20Maximum%20Number%20of%20Transactions%20on%20Consecutive%20Days/README_EN.md) diff --git a/solution/2700-2799/2752.Customers with Maximum Number of Transactions on Consecutive Days/README_EN.md b/solution/2700-2799/2752.Customers with Maximum Number of Transactions on Consecutive Days/README_EN.md index 2dc9af6524dba..f1ab683b6c58c 100644 --- a/solution/2700-2799/2752.Customers with Maximum Number of Transactions on Consecutive Days/README_EN.md +++ b/solution/2700-2799/2752.Customers with Maximum Number of Transactions on Consecutive Days/README_EN.md @@ -1,4 +1,4 @@ -# [2752. Customers with Maximum Number of Transactions on Consecutive Days](https://leetcode.com/problems/customers-with-maximum-number-of-transactions-on-consecutive-days) +# [2752. Customers with Maximum Number of Transactions on Consecutive Days 🔒](https://leetcode.com/problems/customers-with-maximum-number-of-transactions-on-consecutive-days) [中文文档](/solution/2700-2799/2752.Customers%20with%20Maximum%20Number%20of%20Transactions%20on%20Consecutive%20Days/README.md) diff --git a/solution/2700-2799/2753.Count Houses in a Circular Street II/README.md b/solution/2700-2799/2753.Count Houses in a Circular Street II/README.md index 35df3ea878589..dc9e996534768 100644 --- a/solution/2700-2799/2753.Count Houses in a Circular Street II/README.md +++ b/solution/2700-2799/2753.Count Houses in a Circular Street II/README.md @@ -1,4 +1,4 @@ -# [2753. 计算一个环形街道上的房屋数量 II](https://leetcode.cn/problems/count-houses-in-a-circular-street-ii) +# [2753. 计算一个环形街道上的房屋数量 II 🔒](https://leetcode.cn/problems/count-houses-in-a-circular-street-ii) [English Version](/solution/2700-2799/2753.Count%20Houses%20in%20a%20Circular%20Street%20II/README_EN.md) diff --git a/solution/2700-2799/2753.Count Houses in a Circular Street II/README_EN.md b/solution/2700-2799/2753.Count Houses in a Circular Street II/README_EN.md index 279b7fb08e6f4..7e74d50431b59 100644 --- a/solution/2700-2799/2753.Count Houses in a Circular Street II/README_EN.md +++ b/solution/2700-2799/2753.Count Houses in a Circular Street II/README_EN.md @@ -1,4 +1,4 @@ -# [2753. Count Houses in a Circular Street II](https://leetcode.com/problems/count-houses-in-a-circular-street-ii) +# [2753. Count Houses in a Circular Street II 🔒](https://leetcode.com/problems/count-houses-in-a-circular-street-ii) [中文文档](/solution/2700-2799/2753.Count%20Houses%20in%20a%20Circular%20Street%20II/README.md) diff --git a/solution/2700-2799/2754.Bind Function to Context/README.md b/solution/2700-2799/2754.Bind Function to Context/README.md index bd4b5d40d9c95..78792e825f99d 100644 --- a/solution/2700-2799/2754.Bind Function to Context/README.md +++ b/solution/2700-2799/2754.Bind Function to Context/README.md @@ -1,4 +1,4 @@ -# [2754. 将函数绑定到上下文](https://leetcode.cn/problems/bind-function-to-context) +# [2754. 将函数绑定到上下文 🔒](https://leetcode.cn/problems/bind-function-to-context) [English Version](/solution/2700-2799/2754.Bind%20Function%20to%20Context/README_EN.md) diff --git a/solution/2700-2799/2754.Bind Function to Context/README_EN.md b/solution/2700-2799/2754.Bind Function to Context/README_EN.md index c64a550d1e5df..263b6ec842684 100644 --- a/solution/2700-2799/2754.Bind Function to Context/README_EN.md +++ b/solution/2700-2799/2754.Bind Function to Context/README_EN.md @@ -1,4 +1,4 @@ -# [2754. Bind Function to Context](https://leetcode.com/problems/bind-function-to-context) +# [2754. Bind Function to Context 🔒](https://leetcode.com/problems/bind-function-to-context) [中文文档](/solution/2700-2799/2754.Bind%20Function%20to%20Context/README.md) diff --git a/solution/2700-2799/2755.Deep Merge of Two Objects/README.md b/solution/2700-2799/2755.Deep Merge of Two Objects/README.md index 3c8dc59fd6768..0e7c8a6306236 100644 --- a/solution/2700-2799/2755.Deep Merge of Two Objects/README.md +++ b/solution/2700-2799/2755.Deep Merge of Two Objects/README.md @@ -1,4 +1,4 @@ -# [2755. 深度合并两个对象](https://leetcode.cn/problems/deep-merge-of-two-objects) +# [2755. 深度合并两个对象 🔒](https://leetcode.cn/problems/deep-merge-of-two-objects) [English Version](/solution/2700-2799/2755.Deep%20Merge%20of%20Two%20Objects/README_EN.md) diff --git a/solution/2700-2799/2755.Deep Merge of Two Objects/README_EN.md b/solution/2700-2799/2755.Deep Merge of Two Objects/README_EN.md index 7e6efded47f8f..f158b012bce3b 100644 --- a/solution/2700-2799/2755.Deep Merge of Two Objects/README_EN.md +++ b/solution/2700-2799/2755.Deep Merge of Two Objects/README_EN.md @@ -1,4 +1,4 @@ -# [2755. Deep Merge of Two Objects](https://leetcode.com/problems/deep-merge-of-two-objects) +# [2755. Deep Merge of Two Objects 🔒](https://leetcode.com/problems/deep-merge-of-two-objects) [中文文档](/solution/2700-2799/2755.Deep%20Merge%20of%20Two%20Objects/README.md) diff --git a/solution/2700-2799/2756.Query Batching/README.md b/solution/2700-2799/2756.Query Batching/README.md index 2368eeaf48baf..3ce8bd28086f6 100644 --- a/solution/2700-2799/2756.Query Batching/README.md +++ b/solution/2700-2799/2756.Query Batching/README.md @@ -1,4 +1,4 @@ -# [2756. 批处理查询](https://leetcode.cn/problems/query-batching) +# [2756. 批处理查询 🔒](https://leetcode.cn/problems/query-batching) [English Version](/solution/2700-2799/2756.Query%20Batching/README_EN.md) diff --git a/solution/2700-2799/2756.Query Batching/README_EN.md b/solution/2700-2799/2756.Query Batching/README_EN.md index 8229a02f9e906..efe7a99d23264 100644 --- a/solution/2700-2799/2756.Query Batching/README_EN.md +++ b/solution/2700-2799/2756.Query Batching/README_EN.md @@ -1,4 +1,4 @@ -# [2756. Query Batching](https://leetcode.com/problems/query-batching) +# [2756. Query Batching 🔒](https://leetcode.com/problems/query-batching) [中文文档](/solution/2700-2799/2756.Query%20Batching/README.md) diff --git a/solution/2700-2799/2757.Generate Circular Array Values/README.md b/solution/2700-2799/2757.Generate Circular Array Values/README.md index b377b511041dc..6d4f663e881ab 100644 --- a/solution/2700-2799/2757.Generate Circular Array Values/README.md +++ b/solution/2700-2799/2757.Generate Circular Array Values/README.md @@ -1,4 +1,4 @@ -# [2757. 生成循环数组的值](https://leetcode.cn/problems/generate-circular-array-values) +# [2757. 生成循环数组的值 🔒](https://leetcode.cn/problems/generate-circular-array-values) [English Version](/solution/2700-2799/2757.Generate%20Circular%20Array%20Values/README_EN.md) diff --git a/solution/2700-2799/2757.Generate Circular Array Values/README_EN.md b/solution/2700-2799/2757.Generate Circular Array Values/README_EN.md index 3b8c7bb417988..c2561665fad8b 100644 --- a/solution/2700-2799/2757.Generate Circular Array Values/README_EN.md +++ b/solution/2700-2799/2757.Generate Circular Array Values/README_EN.md @@ -1,4 +1,4 @@ -# [2757. Generate Circular Array Values](https://leetcode.com/problems/generate-circular-array-values) +# [2757. Generate Circular Array Values 🔒](https://leetcode.com/problems/generate-circular-array-values) [中文文档](/solution/2700-2799/2757.Generate%20Circular%20Array%20Values/README.md) diff --git a/solution/2700-2799/2758.Next Day/README.md b/solution/2700-2799/2758.Next Day/README.md index c3082e2240f21..2174f918d0b39 100644 --- a/solution/2700-2799/2758.Next Day/README.md +++ b/solution/2700-2799/2758.Next Day/README.md @@ -1,4 +1,4 @@ -# [2758. 下一天](https://leetcode.cn/problems/next-day) +# [2758. 下一天 🔒](https://leetcode.cn/problems/next-day) [English Version](/solution/2700-2799/2758.Next%20Day/README_EN.md) diff --git a/solution/2700-2799/2758.Next Day/README_EN.md b/solution/2700-2799/2758.Next Day/README_EN.md index 205577ef1fbcf..25cd6d4924adf 100644 --- a/solution/2700-2799/2758.Next Day/README_EN.md +++ b/solution/2700-2799/2758.Next Day/README_EN.md @@ -1,4 +1,4 @@ -# [2758. Next Day](https://leetcode.com/problems/next-day) +# [2758. Next Day 🔒](https://leetcode.com/problems/next-day) [中文文档](/solution/2700-2799/2758.Next%20Day/README.md) diff --git a/solution/2700-2799/2759.Convert JSON String to Object/README.md b/solution/2700-2799/2759.Convert JSON String to Object/README.md index ab17c81402fdb..50558b067d467 100644 --- a/solution/2700-2799/2759.Convert JSON String to Object/README.md +++ b/solution/2700-2799/2759.Convert JSON String to Object/README.md @@ -1,4 +1,4 @@ -# [2759. 将 JSON 字符串转换为对象](https://leetcode.cn/problems/convert-json-string-to-object) +# [2759. 将 JSON 字符串转换为对象 🔒](https://leetcode.cn/problems/convert-json-string-to-object) [English Version](/solution/2700-2799/2759.Convert%20JSON%20String%20to%20Object/README_EN.md) diff --git a/solution/2700-2799/2759.Convert JSON String to Object/README_EN.md b/solution/2700-2799/2759.Convert JSON String to Object/README_EN.md index 0891a347460fc..693ef93967955 100644 --- a/solution/2700-2799/2759.Convert JSON String to Object/README_EN.md +++ b/solution/2700-2799/2759.Convert JSON String to Object/README_EN.md @@ -1,4 +1,4 @@ -# [2759. Convert JSON String to Object](https://leetcode.com/problems/convert-json-string-to-object) +# [2759. Convert JSON String to Object 🔒](https://leetcode.com/problems/convert-json-string-to-object) [中文文档](/solution/2700-2799/2759.Convert%20JSON%20String%20to%20Object/README.md) diff --git "a/solution/2700-2799/2764.Is Array a Preorder of Some \342\200\214Binary Tree/README.md" "b/solution/2700-2799/2764.Is Array a Preorder of Some \342\200\214Binary Tree/README.md" index 16b0c28e27119..2c2a4ea18f00c 100644 --- "a/solution/2700-2799/2764.Is Array a Preorder of Some \342\200\214Binary Tree/README.md" +++ "b/solution/2700-2799/2764.Is Array a Preorder of Some \342\200\214Binary Tree/README.md" @@ -1,4 +1,4 @@ -# [2764. 数组是否表示某二叉树的前序遍历](https://leetcode.cn/problems/is-array-a-preorder-of-some-binary-tree) +# [2764. 数组是否表示某二叉树的前序遍历 🔒](https://leetcode.cn/problems/is-array-a-preorder-of-some-binary-tree) [English Version](/solution/2700-2799/2764.Is%20Array%20a%20Preorder%20of%20Some%20%E2%80%8CBinary%20Tree/README_EN.md) diff --git "a/solution/2700-2799/2764.Is Array a Preorder of Some \342\200\214Binary Tree/README_EN.md" "b/solution/2700-2799/2764.Is Array a Preorder of Some \342\200\214Binary Tree/README_EN.md" index bafc1ee474ec1..9b2964ca17564 100644 --- "a/solution/2700-2799/2764.Is Array a Preorder of Some \342\200\214Binary Tree/README_EN.md" +++ "b/solution/2700-2799/2764.Is Array a Preorder of Some \342\200\214Binary Tree/README_EN.md" @@ -1,4 +1,4 @@ -# [2764. Is Array a Preorder of Some ‌Binary Tree](https://leetcode.com/problems/is-array-a-preorder-of-some-binary-tree) +# [2764. Is Array a Preorder of Some ‌Binary Tree 🔒](https://leetcode.com/problems/is-array-a-preorder-of-some-binary-tree) [中文文档](/solution/2700-2799/2764.Is%20Array%20a%20Preorder%20of%20Some%20%E2%80%8CBinary%20Tree/README.md) diff --git a/solution/2700-2799/2773.Height of Special Binary Tree/README.md b/solution/2700-2799/2773.Height of Special Binary Tree/README.md index 10a28fb7c3f47..bb8005134f964 100644 --- a/solution/2700-2799/2773.Height of Special Binary Tree/README.md +++ b/solution/2700-2799/2773.Height of Special Binary Tree/README.md @@ -1,4 +1,4 @@ -# [2773. 特殊二叉树的高度](https://leetcode.cn/problems/height-of-special-binary-tree) +# [2773. 特殊二叉树的高度 🔒](https://leetcode.cn/problems/height-of-special-binary-tree) [English Version](/solution/2700-2799/2773.Height%20of%20Special%20Binary%20Tree/README_EN.md) diff --git a/solution/2700-2799/2773.Height of Special Binary Tree/README_EN.md b/solution/2700-2799/2773.Height of Special Binary Tree/README_EN.md index 4f07235be4831..277b81156ee47 100644 --- a/solution/2700-2799/2773.Height of Special Binary Tree/README_EN.md +++ b/solution/2700-2799/2773.Height of Special Binary Tree/README_EN.md @@ -1,4 +1,4 @@ -# [2773. Height of Special Binary Tree](https://leetcode.com/problems/height-of-special-binary-tree) +# [2773. Height of Special Binary Tree 🔒](https://leetcode.com/problems/height-of-special-binary-tree) [中文文档](/solution/2700-2799/2773.Height%20of%20Special%20Binary%20Tree/README.md) diff --git a/solution/2700-2799/2774.Array Upper Bound/README.md b/solution/2700-2799/2774.Array Upper Bound/README.md index a7c82891e747a..8587ac320a16f 100644 --- a/solution/2700-2799/2774.Array Upper Bound/README.md +++ b/solution/2700-2799/2774.Array Upper Bound/README.md @@ -1,4 +1,4 @@ -# [2774. 数组的上界](https://leetcode.cn/problems/array-upper-bound) +# [2774. 数组的上界 🔒](https://leetcode.cn/problems/array-upper-bound) [English Version](/solution/2700-2799/2774.Array%20Upper%20Bound/README_EN.md) diff --git a/solution/2700-2799/2774.Array Upper Bound/README_EN.md b/solution/2700-2799/2774.Array Upper Bound/README_EN.md index 4c86fd210d958..b2e767c239108 100644 --- a/solution/2700-2799/2774.Array Upper Bound/README_EN.md +++ b/solution/2700-2799/2774.Array Upper Bound/README_EN.md @@ -1,4 +1,4 @@ -# [2774. Array Upper Bound](https://leetcode.com/problems/array-upper-bound) +# [2774. Array Upper Bound 🔒](https://leetcode.com/problems/array-upper-bound) [中文文档](/solution/2700-2799/2774.Array%20Upper%20Bound/README.md) diff --git a/solution/2700-2799/2775.Undefined to Null/README.md b/solution/2700-2799/2775.Undefined to Null/README.md index abbde659cea69..c80bd5d9cd49e 100644 --- a/solution/2700-2799/2775.Undefined to Null/README.md +++ b/solution/2700-2799/2775.Undefined to Null/README.md @@ -1,4 +1,4 @@ -# [2775. 将 undefined 转为 null](https://leetcode.cn/problems/undefined-to-null) +# [2775. 将 undefined 转为 null 🔒](https://leetcode.cn/problems/undefined-to-null) [English Version](/solution/2700-2799/2775.Undefined%20to%20Null/README_EN.md) diff --git a/solution/2700-2799/2775.Undefined to Null/README_EN.md b/solution/2700-2799/2775.Undefined to Null/README_EN.md index e924a58559587..d2472f82ee0b4 100644 --- a/solution/2700-2799/2775.Undefined to Null/README_EN.md +++ b/solution/2700-2799/2775.Undefined to Null/README_EN.md @@ -1,4 +1,4 @@ -# [2775. Undefined to Null](https://leetcode.com/problems/undefined-to-null) +# [2775. Undefined to Null 🔒](https://leetcode.com/problems/undefined-to-null) [中文文档](/solution/2700-2799/2775.Undefined%20to%20Null/README.md) diff --git a/solution/2700-2799/2776.Convert Callback Based Function to Promise Based Function/README.md b/solution/2700-2799/2776.Convert Callback Based Function to Promise Based Function/README.md index 6e309e581f3d8..dc2cd6966c7a4 100644 --- a/solution/2700-2799/2776.Convert Callback Based Function to Promise Based Function/README.md +++ b/solution/2700-2799/2776.Convert Callback Based Function to Promise Based Function/README.md @@ -1,4 +1,4 @@ -# [2776. 转换回调函数为 Promise 函数](https://leetcode.cn/problems/convert-callback-based-function-to-promise-based-function) +# [2776. 转换回调函数为 Promise 函数 🔒](https://leetcode.cn/problems/convert-callback-based-function-to-promise-based-function) [English Version](/solution/2700-2799/2776.Convert%20Callback%20Based%20Function%20to%20Promise%20Based%20Function/README_EN.md) diff --git a/solution/2700-2799/2776.Convert Callback Based Function to Promise Based Function/README_EN.md b/solution/2700-2799/2776.Convert Callback Based Function to Promise Based Function/README_EN.md index 82f64f850cf9f..db620d75ac5c0 100644 --- a/solution/2700-2799/2776.Convert Callback Based Function to Promise Based Function/README_EN.md +++ b/solution/2700-2799/2776.Convert Callback Based Function to Promise Based Function/README_EN.md @@ -1,4 +1,4 @@ -# [2776. Convert Callback Based Function to Promise Based Function](https://leetcode.com/problems/convert-callback-based-function-to-promise-based-function) +# [2776. Convert Callback Based Function to Promise Based Function 🔒](https://leetcode.com/problems/convert-callback-based-function-to-promise-based-function) [中文文档](/solution/2700-2799/2776.Convert%20Callback%20Based%20Function%20to%20Promise%20Based%20Function/README.md) diff --git a/solution/2700-2799/2777.Date Range Generator/README.md b/solution/2700-2799/2777.Date Range Generator/README.md index 814600f5c92d4..a938566f5e595 100644 --- a/solution/2700-2799/2777.Date Range Generator/README.md +++ b/solution/2700-2799/2777.Date Range Generator/README.md @@ -1,4 +1,4 @@ -# [2777. 日期范围生成器](https://leetcode.cn/problems/date-range-generator) +# [2777. 日期范围生成器 🔒](https://leetcode.cn/problems/date-range-generator) [English Version](/solution/2700-2799/2777.Date%20Range%20Generator/README_EN.md) diff --git a/solution/2700-2799/2777.Date Range Generator/README_EN.md b/solution/2700-2799/2777.Date Range Generator/README_EN.md index 59a6a31dd0485..658634874d835 100644 --- a/solution/2700-2799/2777.Date Range Generator/README_EN.md +++ b/solution/2700-2799/2777.Date Range Generator/README_EN.md @@ -1,4 +1,4 @@ -# [2777. Date Range Generator](https://leetcode.com/problems/date-range-generator) +# [2777. Date Range Generator 🔒](https://leetcode.com/problems/date-range-generator) [中文文档](/solution/2700-2799/2777.Date%20Range%20Generator/README.md) diff --git a/solution/2700-2799/2782.Number of Unique Categories/README.md b/solution/2700-2799/2782.Number of Unique Categories/README.md index 4a23300b7ba35..f3e8897661b43 100644 --- a/solution/2700-2799/2782.Number of Unique Categories/README.md +++ b/solution/2700-2799/2782.Number of Unique Categories/README.md @@ -1,4 +1,4 @@ -# [2782. 唯一类别的数量](https://leetcode.cn/problems/number-of-unique-categories) +# [2782. 唯一类别的数量 🔒](https://leetcode.cn/problems/number-of-unique-categories) [English Version](/solution/2700-2799/2782.Number%20of%20Unique%20Categories/README_EN.md) diff --git a/solution/2700-2799/2782.Number of Unique Categories/README_EN.md b/solution/2700-2799/2782.Number of Unique Categories/README_EN.md index 7ff95be17ddc8..63a912b97cebe 100644 --- a/solution/2700-2799/2782.Number of Unique Categories/README_EN.md +++ b/solution/2700-2799/2782.Number of Unique Categories/README_EN.md @@ -1,4 +1,4 @@ -# [2782. Number of Unique Categories](https://leetcode.com/problems/number-of-unique-categories) +# [2782. Number of Unique Categories 🔒](https://leetcode.com/problems/number-of-unique-categories) [中文文档](/solution/2700-2799/2782.Number%20of%20Unique%20Categories/README.md) diff --git a/solution/2700-2799/2783.Flight Occupancy and Waitlist Analysis/README.md b/solution/2700-2799/2783.Flight Occupancy and Waitlist Analysis/README.md index aa635fb31004c..a09170f7d528f 100644 --- a/solution/2700-2799/2783.Flight Occupancy and Waitlist Analysis/README.md +++ b/solution/2700-2799/2783.Flight Occupancy and Waitlist Analysis/README.md @@ -1,4 +1,4 @@ -# [2783. 航班入座率和等待名单分析](https://leetcode.cn/problems/flight-occupancy-and-waitlist-analysis) +# [2783. 航班入座率和等待名单分析 🔒](https://leetcode.cn/problems/flight-occupancy-and-waitlist-analysis) [English Version](/solution/2700-2799/2783.Flight%20Occupancy%20and%20Waitlist%20Analysis/README_EN.md) diff --git a/solution/2700-2799/2783.Flight Occupancy and Waitlist Analysis/README_EN.md b/solution/2700-2799/2783.Flight Occupancy and Waitlist Analysis/README_EN.md index cecfe9a5105a7..f8170590b6ae1 100644 --- a/solution/2700-2799/2783.Flight Occupancy and Waitlist Analysis/README_EN.md +++ b/solution/2700-2799/2783.Flight Occupancy and Waitlist Analysis/README_EN.md @@ -1,4 +1,4 @@ -# [2783. Flight Occupancy and Waitlist Analysis](https://leetcode.com/problems/flight-occupancy-and-waitlist-analysis) +# [2783. Flight Occupancy and Waitlist Analysis 🔒](https://leetcode.com/problems/flight-occupancy-and-waitlist-analysis) [中文文档](/solution/2700-2799/2783.Flight%20Occupancy%20and%20Waitlist%20Analysis/README.md) diff --git a/solution/2700-2799/2792.Count Nodes That Are Great Enough/README.md b/solution/2700-2799/2792.Count Nodes That Are Great Enough/README.md index 3cafa6acb8c16..43272cf3a3569 100644 --- a/solution/2700-2799/2792.Count Nodes That Are Great Enough/README.md +++ b/solution/2700-2799/2792.Count Nodes That Are Great Enough/README.md @@ -1,4 +1,4 @@ -# [2792. 计算足够大的节点数](https://leetcode.cn/problems/count-nodes-that-are-great-enough) +# [2792. 计算足够大的节点数 🔒](https://leetcode.cn/problems/count-nodes-that-are-great-enough) [English Version](/solution/2700-2799/2792.Count%20Nodes%20That%20Are%20Great%20Enough/README_EN.md) diff --git a/solution/2700-2799/2792.Count Nodes That Are Great Enough/README_EN.md b/solution/2700-2799/2792.Count Nodes That Are Great Enough/README_EN.md index 4419481ef1ee7..72e010561719b 100644 --- a/solution/2700-2799/2792.Count Nodes That Are Great Enough/README_EN.md +++ b/solution/2700-2799/2792.Count Nodes That Are Great Enough/README_EN.md @@ -1,4 +1,4 @@ -# [2792. Count Nodes That Are Great Enough](https://leetcode.com/problems/count-nodes-that-are-great-enough) +# [2792. Count Nodes That Are Great Enough 🔒](https://leetcode.com/problems/count-nodes-that-are-great-enough) [中文文档](/solution/2700-2799/2792.Count%20Nodes%20That%20Are%20Great%20Enough/README.md) diff --git a/solution/2700-2799/2793.Status of Flight Tickets/README.md b/solution/2700-2799/2793.Status of Flight Tickets/README.md index 3ca00086089ab..8492f21247c47 100644 --- a/solution/2700-2799/2793.Status of Flight Tickets/README.md +++ b/solution/2700-2799/2793.Status of Flight Tickets/README.md @@ -1,4 +1,4 @@ -# [2793. 航班机票状态](https://leetcode.cn/problems/status-of-flight-tickets) +# [2793. 航班机票状态 🔒](https://leetcode.cn/problems/status-of-flight-tickets) [English Version](/solution/2700-2799/2793.Status%20of%20Flight%20Tickets/README_EN.md) diff --git a/solution/2700-2799/2793.Status of Flight Tickets/README_EN.md b/solution/2700-2799/2793.Status of Flight Tickets/README_EN.md index 1292e9bbd4300..ab80f7269ef94 100644 --- a/solution/2700-2799/2793.Status of Flight Tickets/README_EN.md +++ b/solution/2700-2799/2793.Status of Flight Tickets/README_EN.md @@ -1,4 +1,4 @@ -# [2793. Status of Flight Tickets](https://leetcode.com/problems/status-of-flight-tickets) +# [2793. Status of Flight Tickets 🔒](https://leetcode.com/problems/status-of-flight-tickets) [中文文档](/solution/2700-2799/2793.Status%20of%20Flight%20Tickets/README.md) diff --git a/solution/2700-2799/2794.Create Object from Two Arrays/README.md b/solution/2700-2799/2794.Create Object from Two Arrays/README.md index 30a95118d5957..7a20047c6338e 100644 --- a/solution/2700-2799/2794.Create Object from Two Arrays/README.md +++ b/solution/2700-2799/2794.Create Object from Two Arrays/README.md @@ -1,4 +1,4 @@ -# [2794. 从两个数组中创建对象](https://leetcode.cn/problems/create-object-from-two-arrays) +# [2794. 从两个数组中创建对象 🔒](https://leetcode.cn/problems/create-object-from-two-arrays) [English Version](/solution/2700-2799/2794.Create%20Object%20from%20Two%20Arrays/README_EN.md) diff --git a/solution/2700-2799/2794.Create Object from Two Arrays/README_EN.md b/solution/2700-2799/2794.Create Object from Two Arrays/README_EN.md index b24836524d86d..0621e5632ad78 100644 --- a/solution/2700-2799/2794.Create Object from Two Arrays/README_EN.md +++ b/solution/2700-2799/2794.Create Object from Two Arrays/README_EN.md @@ -1,4 +1,4 @@ -# [2794. Create Object from Two Arrays](https://leetcode.com/problems/create-object-from-two-arrays) +# [2794. Create Object from Two Arrays 🔒](https://leetcode.com/problems/create-object-from-two-arrays) [中文文档](/solution/2700-2799/2794.Create%20Object%20from%20Two%20Arrays/README.md) diff --git a/solution/2700-2799/2795.Parallel Execution of Promises for Individual Results Retrieval/README.md b/solution/2700-2799/2795.Parallel Execution of Promises for Individual Results Retrieval/README.md index 7a5f5e14c99f7..331ecefda73ac 100644 --- a/solution/2700-2799/2795.Parallel Execution of Promises for Individual Results Retrieval/README.md +++ b/solution/2700-2799/2795.Parallel Execution of Promises for Individual Results Retrieval/README.md @@ -1,4 +1,4 @@ -# [2795. 并行执行 Promise 以获取独有的结果](https://leetcode.cn/problems/parallel-execution-of-promises-for-individual-results-retrieval) +# [2795. 并行执行 Promise 以获取独有的结果 🔒](https://leetcode.cn/problems/parallel-execution-of-promises-for-individual-results-retrieval) [English Version](/solution/2700-2799/2795.Parallel%20Execution%20of%20Promises%20for%20Individual%20Results%20Retrieval/README_EN.md) diff --git a/solution/2700-2799/2795.Parallel Execution of Promises for Individual Results Retrieval/README_EN.md b/solution/2700-2799/2795.Parallel Execution of Promises for Individual Results Retrieval/README_EN.md index dad069e5de634..166ad5ae65a3f 100644 --- a/solution/2700-2799/2795.Parallel Execution of Promises for Individual Results Retrieval/README_EN.md +++ b/solution/2700-2799/2795.Parallel Execution of Promises for Individual Results Retrieval/README_EN.md @@ -1,4 +1,4 @@ -# [2795. Parallel Execution of Promises for Individual Results Retrieval](https://leetcode.com/problems/parallel-execution-of-promises-for-individual-results-retrieval) +# [2795. Parallel Execution of Promises for Individual Results Retrieval 🔒](https://leetcode.com/problems/parallel-execution-of-promises-for-individual-results-retrieval) [中文文档](/solution/2700-2799/2795.Parallel%20Execution%20of%20Promises%20for%20Individual%20Results%20Retrieval/README.md) diff --git a/solution/2700-2799/2796.Repeat String/README.md b/solution/2700-2799/2796.Repeat String/README.md index bc3dc1775af25..f025dd03beee4 100644 --- a/solution/2700-2799/2796.Repeat String/README.md +++ b/solution/2700-2799/2796.Repeat String/README.md @@ -1,4 +1,4 @@ -# [2796. 重复字符串](https://leetcode.cn/problems/repeat-string) +# [2796. 重复字符串 🔒](https://leetcode.cn/problems/repeat-string) [English Version](/solution/2700-2799/2796.Repeat%20String/README_EN.md) diff --git a/solution/2700-2799/2796.Repeat String/README_EN.md b/solution/2700-2799/2796.Repeat String/README_EN.md index 4a4df730d7f17..27691b52e6a4d 100644 --- a/solution/2700-2799/2796.Repeat String/README_EN.md +++ b/solution/2700-2799/2796.Repeat String/README_EN.md @@ -1,4 +1,4 @@ -# [2796. Repeat String](https://leetcode.com/problems/repeat-string) +# [2796. Repeat String 🔒](https://leetcode.com/problems/repeat-string) [中文文档](/solution/2700-2799/2796.Repeat%20String/README.md) diff --git a/solution/2700-2799/2797.Partial Function with Placeholders/README.md b/solution/2700-2799/2797.Partial Function with Placeholders/README.md index 6255cb7282a52..11748009cfb54 100644 --- a/solution/2700-2799/2797.Partial Function with Placeholders/README.md +++ b/solution/2700-2799/2797.Partial Function with Placeholders/README.md @@ -1,4 +1,4 @@ -# [2797. 带有占位符的部分函数](https://leetcode.cn/problems/partial-function-with-placeholders) +# [2797. 带有占位符的部分函数 🔒](https://leetcode.cn/problems/partial-function-with-placeholders) [English Version](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README_EN.md) diff --git a/solution/2700-2799/2797.Partial Function with Placeholders/README_EN.md b/solution/2700-2799/2797.Partial Function with Placeholders/README_EN.md index 58a2666bfd417..621cafe591d8b 100644 --- a/solution/2700-2799/2797.Partial Function with Placeholders/README_EN.md +++ b/solution/2700-2799/2797.Partial Function with Placeholders/README_EN.md @@ -1,4 +1,4 @@ -# [2797. Partial Function with Placeholders](https://leetcode.com/problems/partial-function-with-placeholders) +# [2797. Partial Function with Placeholders 🔒](https://leetcode.com/problems/partial-function-with-placeholders) [中文文档](/solution/2700-2799/2797.Partial%20Function%20with%20Placeholders/README.md) diff --git a/solution/2800-2899/2802.Find The K-th Lucky Number/README.md b/solution/2800-2899/2802.Find The K-th Lucky Number/README.md index e7c01e755493f..5b7455622316d 100644 --- a/solution/2800-2899/2802.Find The K-th Lucky Number/README.md +++ b/solution/2800-2899/2802.Find The K-th Lucky Number/README.md @@ -1,4 +1,4 @@ -# [2802. 找出第 K 个幸运数字](https://leetcode.cn/problems/find-the-k-th-lucky-number) +# [2802. 找出第 K 个幸运数字 🔒](https://leetcode.cn/problems/find-the-k-th-lucky-number) [English Version](/solution/2800-2899/2802.Find%20The%20K-th%20Lucky%20Number/README_EN.md) diff --git a/solution/2800-2899/2802.Find The K-th Lucky Number/README_EN.md b/solution/2800-2899/2802.Find The K-th Lucky Number/README_EN.md index a3ad6162546f4..f1758049f7e98 100644 --- a/solution/2800-2899/2802.Find The K-th Lucky Number/README_EN.md +++ b/solution/2800-2899/2802.Find The K-th Lucky Number/README_EN.md @@ -1,4 +1,4 @@ -# [2802. Find The K-th Lucky Number](https://leetcode.com/problems/find-the-k-th-lucky-number) +# [2802. Find The K-th Lucky Number 🔒](https://leetcode.com/problems/find-the-k-th-lucky-number) [中文文档](/solution/2800-2899/2802.Find%20The%20K-th%20Lucky%20Number/README.md) diff --git a/solution/2800-2899/2803.Factorial Generator/README.md b/solution/2800-2899/2803.Factorial Generator/README.md index 876802db3811b..cd827712457fd 100644 --- a/solution/2800-2899/2803.Factorial Generator/README.md +++ b/solution/2800-2899/2803.Factorial Generator/README.md @@ -1,4 +1,4 @@ -# [2803. 阶乘生成器](https://leetcode.cn/problems/factorial-generator) +# [2803. 阶乘生成器 🔒](https://leetcode.cn/problems/factorial-generator) [English Version](/solution/2800-2899/2803.Factorial%20Generator/README_EN.md) diff --git a/solution/2800-2899/2803.Factorial Generator/README_EN.md b/solution/2800-2899/2803.Factorial Generator/README_EN.md index 14bae6e642e38..53bd2f05285d5 100644 --- a/solution/2800-2899/2803.Factorial Generator/README_EN.md +++ b/solution/2800-2899/2803.Factorial Generator/README_EN.md @@ -1,4 +1,4 @@ -# [2803. Factorial Generator](https://leetcode.com/problems/factorial-generator) +# [2803. Factorial Generator 🔒](https://leetcode.com/problems/factorial-generator) [中文文档](/solution/2800-2899/2803.Factorial%20Generator/README.md) diff --git a/solution/2800-2899/2804.Array Prototype ForEach/README.md b/solution/2800-2899/2804.Array Prototype ForEach/README.md index 2c9402856ca3a..13932b782fd54 100644 --- a/solution/2800-2899/2804.Array Prototype ForEach/README.md +++ b/solution/2800-2899/2804.Array Prototype ForEach/README.md @@ -1,4 +1,4 @@ -# [2804. 数组原型的 forEach 方法](https://leetcode.cn/problems/array-prototype-foreach) +# [2804. 数组原型的 forEach 方法 🔒](https://leetcode.cn/problems/array-prototype-foreach) [English Version](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README_EN.md) diff --git a/solution/2800-2899/2804.Array Prototype ForEach/README_EN.md b/solution/2800-2899/2804.Array Prototype ForEach/README_EN.md index 5e004a4ad4bfc..2995d66ba2afd 100644 --- a/solution/2800-2899/2804.Array Prototype ForEach/README_EN.md +++ b/solution/2800-2899/2804.Array Prototype ForEach/README_EN.md @@ -1,4 +1,4 @@ -# [2804. Array Prototype ForEach](https://leetcode.com/problems/array-prototype-foreach) +# [2804. Array Prototype ForEach 🔒](https://leetcode.com/problems/array-prototype-foreach) [中文文档](/solution/2800-2899/2804.Array%20Prototype%20ForEach/README.md) diff --git a/solution/2800-2899/2805.Custom Interval/README.md b/solution/2800-2899/2805.Custom Interval/README.md index 5a59722fcee7a..11852f9b29357 100644 --- a/solution/2800-2899/2805.Custom Interval/README.md +++ b/solution/2800-2899/2805.Custom Interval/README.md @@ -1,4 +1,4 @@ -# [2805. 自定义间隔](https://leetcode.cn/problems/custom-interval) +# [2805. 自定义间隔 🔒](https://leetcode.cn/problems/custom-interval) [English Version](/solution/2800-2899/2805.Custom%20Interval/README_EN.md) diff --git a/solution/2800-2899/2805.Custom Interval/README_EN.md b/solution/2800-2899/2805.Custom Interval/README_EN.md index 264fc87c3c082..db54b15de3f9f 100644 --- a/solution/2800-2899/2805.Custom Interval/README_EN.md +++ b/solution/2800-2899/2805.Custom Interval/README_EN.md @@ -1,4 +1,4 @@ -# [2805. Custom Interval](https://leetcode.com/problems/custom-interval) +# [2805. Custom Interval 🔒](https://leetcode.com/problems/custom-interval) [中文文档](/solution/2800-2899/2805.Custom%20Interval/README.md) diff --git a/solution/2800-2899/2814.Minimum Time Takes to Reach Destination Without Drowning/README.md b/solution/2800-2899/2814.Minimum Time Takes to Reach Destination Without Drowning/README.md index 1f8edd15450b8..d224d93b88f54 100644 --- a/solution/2800-2899/2814.Minimum Time Takes to Reach Destination Without Drowning/README.md +++ b/solution/2800-2899/2814.Minimum Time Takes to Reach Destination Without Drowning/README.md @@ -1,4 +1,4 @@ -# [2814. 避免淹死并到达目的地的最短时间](https://leetcode.cn/problems/minimum-time-takes-to-reach-destination-without-drowning) +# [2814. 避免淹死并到达目的地的最短时间 🔒](https://leetcode.cn/problems/minimum-time-takes-to-reach-destination-without-drowning) [English Version](/solution/2800-2899/2814.Minimum%20Time%20Takes%20to%20Reach%20Destination%20Without%20Drowning/README_EN.md) diff --git a/solution/2800-2899/2814.Minimum Time Takes to Reach Destination Without Drowning/README_EN.md b/solution/2800-2899/2814.Minimum Time Takes to Reach Destination Without Drowning/README_EN.md index 101e2d574dfc6..a7e9b02edc3da 100644 --- a/solution/2800-2899/2814.Minimum Time Takes to Reach Destination Without Drowning/README_EN.md +++ b/solution/2800-2899/2814.Minimum Time Takes to Reach Destination Without Drowning/README_EN.md @@ -1,4 +1,4 @@ -# [2814. Minimum Time Takes to Reach Destination Without Drowning](https://leetcode.com/problems/minimum-time-takes-to-reach-destination-without-drowning) +# [2814. Minimum Time Takes to Reach Destination Without Drowning 🔒](https://leetcode.com/problems/minimum-time-takes-to-reach-destination-without-drowning) [中文文档](/solution/2800-2899/2814.Minimum%20Time%20Takes%20to%20Reach%20Destination%20Without%20Drowning/README.md) diff --git a/solution/2800-2899/2819.Minimum Relative Loss After Buying Chocolates/README.md b/solution/2800-2899/2819.Minimum Relative Loss After Buying Chocolates/README.md index 7c08ff2b26d57..c8d617a7bd75a 100644 --- a/solution/2800-2899/2819.Minimum Relative Loss After Buying Chocolates/README.md +++ b/solution/2800-2899/2819.Minimum Relative Loss After Buying Chocolates/README.md @@ -1,4 +1,4 @@ -# [2819. 购买巧克力后的最小相对损失](https://leetcode.cn/problems/minimum-relative-loss-after-buying-chocolates) +# [2819. 购买巧克力后的最小相对损失 🔒](https://leetcode.cn/problems/minimum-relative-loss-after-buying-chocolates) [English Version](/solution/2800-2899/2819.Minimum%20Relative%20Loss%20After%20Buying%20Chocolates/README_EN.md) diff --git a/solution/2800-2899/2819.Minimum Relative Loss After Buying Chocolates/README_EN.md b/solution/2800-2899/2819.Minimum Relative Loss After Buying Chocolates/README_EN.md index 496c55e965585..a209f1fcbff7c 100644 --- a/solution/2800-2899/2819.Minimum Relative Loss After Buying Chocolates/README_EN.md +++ b/solution/2800-2899/2819.Minimum Relative Loss After Buying Chocolates/README_EN.md @@ -1,4 +1,4 @@ -# [2819. Minimum Relative Loss After Buying Chocolates](https://leetcode.com/problems/minimum-relative-loss-after-buying-chocolates) +# [2819. Minimum Relative Loss After Buying Chocolates 🔒](https://leetcode.com/problems/minimum-relative-loss-after-buying-chocolates) [中文文档](/solution/2800-2899/2819.Minimum%20Relative%20Loss%20After%20Buying%20Chocolates/README.md) diff --git a/solution/2800-2899/2820.Election Results/README.md b/solution/2800-2899/2820.Election Results/README.md index c4c81a1a81b95..f3a82c77280a3 100644 --- a/solution/2800-2899/2820.Election Results/README.md +++ b/solution/2800-2899/2820.Election Results/README.md @@ -1,4 +1,4 @@ -# [2820. 选举结果](https://leetcode.cn/problems/election-results) +# [2820. 选举结果 🔒](https://leetcode.cn/problems/election-results) [English Version](/solution/2800-2899/2820.Election%20Results/README_EN.md) diff --git a/solution/2800-2899/2820.Election Results/README_EN.md b/solution/2800-2899/2820.Election Results/README_EN.md index 1c4d64b05830b..0c9199ea15970 100644 --- a/solution/2800-2899/2820.Election Results/README_EN.md +++ b/solution/2800-2899/2820.Election Results/README_EN.md @@ -1,4 +1,4 @@ -# [2820. Election Results](https://leetcode.com/problems/election-results) +# [2820. Election Results 🔒](https://leetcode.com/problems/election-results) [中文文档](/solution/2800-2899/2820.Election%20Results/README.md) diff --git a/solution/2800-2899/2821.Delay the Resolution of Each Promise/README.md b/solution/2800-2899/2821.Delay the Resolution of Each Promise/README.md index 6d50821abd89e..7bbb8ddc3dd42 100644 --- a/solution/2800-2899/2821.Delay the Resolution of Each Promise/README.md +++ b/solution/2800-2899/2821.Delay the Resolution of Each Promise/README.md @@ -1,4 +1,4 @@ -# [2821. 延迟每个 Promise 对象的解析](https://leetcode.cn/problems/delay-the-resolution-of-each-promise) +# [2821. 延迟每个 Promise 对象的解析 🔒](https://leetcode.cn/problems/delay-the-resolution-of-each-promise) [English Version](/solution/2800-2899/2821.Delay%20the%20Resolution%20of%20Each%20Promise/README_EN.md) diff --git a/solution/2800-2899/2821.Delay the Resolution of Each Promise/README_EN.md b/solution/2800-2899/2821.Delay the Resolution of Each Promise/README_EN.md index f3f6437b12b37..faf8dcd805760 100644 --- a/solution/2800-2899/2821.Delay the Resolution of Each Promise/README_EN.md +++ b/solution/2800-2899/2821.Delay the Resolution of Each Promise/README_EN.md @@ -1,4 +1,4 @@ -# [2821. Delay the Resolution of Each Promise](https://leetcode.com/problems/delay-the-resolution-of-each-promise) +# [2821. Delay the Resolution of Each Promise 🔒](https://leetcode.com/problems/delay-the-resolution-of-each-promise) [中文文档](/solution/2800-2899/2821.Delay%20the%20Resolution%20of%20Each%20Promise/README.md) diff --git a/solution/2800-2899/2822.Inversion of Object/README.md b/solution/2800-2899/2822.Inversion of Object/README.md index 492cfd95fda4f..a413bc2919cf8 100644 --- a/solution/2800-2899/2822.Inversion of Object/README.md +++ b/solution/2800-2899/2822.Inversion of Object/README.md @@ -1,4 +1,4 @@ -# [2822. 对象反转](https://leetcode.cn/problems/inversion-of-object) +# [2822. 对象反转 🔒](https://leetcode.cn/problems/inversion-of-object) [English Version](/solution/2800-2899/2822.Inversion%20of%20Object/README_EN.md) diff --git a/solution/2800-2899/2822.Inversion of Object/README_EN.md b/solution/2800-2899/2822.Inversion of Object/README_EN.md index 8a09275054215..3ccdcd0f55fd8 100644 --- a/solution/2800-2899/2822.Inversion of Object/README_EN.md +++ b/solution/2800-2899/2822.Inversion of Object/README_EN.md @@ -1,4 +1,4 @@ -# [2822. Inversion of Object](https://leetcode.com/problems/inversion-of-object) +# [2822. Inversion of Object 🔒](https://leetcode.com/problems/inversion-of-object) [中文文档](/solution/2800-2899/2822.Inversion%20of%20Object/README.md) diff --git a/solution/2800-2899/2823.Deep Object Filter/README.md b/solution/2800-2899/2823.Deep Object Filter/README.md index cf0db4bd7448d..f9c26699afa98 100644 --- a/solution/2800-2899/2823.Deep Object Filter/README.md +++ b/solution/2800-2899/2823.Deep Object Filter/README.md @@ -1,4 +1,4 @@ -# [2823. 深度对象筛选](https://leetcode.cn/problems/deep-object-filter) +# [2823. 深度对象筛选 🔒](https://leetcode.cn/problems/deep-object-filter) [English Version](/solution/2800-2899/2823.Deep%20Object%20Filter/README_EN.md) diff --git a/solution/2800-2899/2823.Deep Object Filter/README_EN.md b/solution/2800-2899/2823.Deep Object Filter/README_EN.md index 66b34bb89e6e7..ee1c83a37ad76 100644 --- a/solution/2800-2899/2823.Deep Object Filter/README_EN.md +++ b/solution/2800-2899/2823.Deep Object Filter/README_EN.md @@ -1,4 +1,4 @@ -# [2823. Deep Object Filter](https://leetcode.com/problems/deep-object-filter) +# [2823. Deep Object Filter 🔒](https://leetcode.com/problems/deep-object-filter) [中文文档](/solution/2800-2899/2823.Deep%20Object%20Filter/README.md) diff --git a/solution/2800-2899/2832.Maximal Range That Each Element Is Maximum in It/README.md b/solution/2800-2899/2832.Maximal Range That Each Element Is Maximum in It/README.md index af490237feedd..5b5a908111c9b 100644 --- a/solution/2800-2899/2832.Maximal Range That Each Element Is Maximum in It/README.md +++ b/solution/2800-2899/2832.Maximal Range That Each Element Is Maximum in It/README.md @@ -1,4 +1,4 @@ -# [2832. 每个元素为最大值的最大范围](https://leetcode.cn/problems/maximal-range-that-each-element-is-maximum-in-it) +# [2832. 每个元素为最大值的最大范围 🔒](https://leetcode.cn/problems/maximal-range-that-each-element-is-maximum-in-it) [English Version](/solution/2800-2899/2832.Maximal%20Range%20That%20Each%20Element%20Is%20Maximum%20in%20It/README_EN.md) diff --git a/solution/2800-2899/2832.Maximal Range That Each Element Is Maximum in It/README_EN.md b/solution/2800-2899/2832.Maximal Range That Each Element Is Maximum in It/README_EN.md index 80699b8239436..88c5e229493ba 100644 --- a/solution/2800-2899/2832.Maximal Range That Each Element Is Maximum in It/README_EN.md +++ b/solution/2800-2899/2832.Maximal Range That Each Element Is Maximum in It/README_EN.md @@ -1,4 +1,4 @@ -# [2832. Maximal Range That Each Element Is Maximum in It](https://leetcode.com/problems/maximal-range-that-each-element-is-maximum-in-it) +# [2832. Maximal Range That Each Element Is Maximum in It 🔒](https://leetcode.com/problems/maximal-range-that-each-element-is-maximum-in-it) [中文文档](/solution/2800-2899/2832.Maximal%20Range%20That%20Each%20Element%20Is%20Maximum%20in%20It/README.md) diff --git a/solution/2800-2899/2837.Total Traveled Distance/README.md b/solution/2800-2899/2837.Total Traveled Distance/README.md index 0d2255f94f96b..260097572b325 100644 --- a/solution/2800-2899/2837.Total Traveled Distance/README.md +++ b/solution/2800-2899/2837.Total Traveled Distance/README.md @@ -1,4 +1,4 @@ -# [2837. 总旅行距离](https://leetcode.cn/problems/total-traveled-distance) +# [2837. 总旅行距离 🔒](https://leetcode.cn/problems/total-traveled-distance) [English Version](/solution/2800-2899/2837.Total%20Traveled%20Distance/README_EN.md) diff --git a/solution/2800-2899/2837.Total Traveled Distance/README_EN.md b/solution/2800-2899/2837.Total Traveled Distance/README_EN.md index 4257c819a182f..6d633f4e96dd6 100644 --- a/solution/2800-2899/2837.Total Traveled Distance/README_EN.md +++ b/solution/2800-2899/2837.Total Traveled Distance/README_EN.md @@ -1,4 +1,4 @@ -# [2837. Total Traveled Distance](https://leetcode.com/problems/total-traveled-distance) +# [2837. Total Traveled Distance 🔒](https://leetcode.com/problems/total-traveled-distance) [中文文档](/solution/2800-2899/2837.Total%20Traveled%20Distance/README.md) diff --git a/solution/2800-2899/2838.Maximum Coins Heroes Can Collect/README.md b/solution/2800-2899/2838.Maximum Coins Heroes Can Collect/README.md index b775bd217f367..f4c4eba6f3e6c 100644 --- a/solution/2800-2899/2838.Maximum Coins Heroes Can Collect/README.md +++ b/solution/2800-2899/2838.Maximum Coins Heroes Can Collect/README.md @@ -1,4 +1,4 @@ -# [2838. Maximum Coins Heroes Can Collect](https://leetcode.cn/problems/maximum-coins-heroes-can-collect) +# [2838. Maximum Coins Heroes Can Collect 🔒](https://leetcode.cn/problems/maximum-coins-heroes-can-collect) [English Version](/solution/2800-2899/2838.Maximum%20Coins%20Heroes%20Can%20Collect/README_EN.md) diff --git a/solution/2800-2899/2838.Maximum Coins Heroes Can Collect/README_EN.md b/solution/2800-2899/2838.Maximum Coins Heroes Can Collect/README_EN.md index 71ff4abfba45a..1ece564773451 100644 --- a/solution/2800-2899/2838.Maximum Coins Heroes Can Collect/README_EN.md +++ b/solution/2800-2899/2838.Maximum Coins Heroes Can Collect/README_EN.md @@ -1,4 +1,4 @@ -# [2838. Maximum Coins Heroes Can Collect](https://leetcode.com/problems/maximum-coins-heroes-can-collect) +# [2838. Maximum Coins Heroes Can Collect 🔒](https://leetcode.com/problems/maximum-coins-heroes-can-collect) [中文文档](/solution/2800-2899/2838.Maximum%20Coins%20Heroes%20Can%20Collect/README.md) diff --git a/solution/2800-2899/2847.Smallest Number With Given Digit Product/README.md b/solution/2800-2899/2847.Smallest Number With Given Digit Product/README.md index f0fb59f5e65c0..abbcd82e0224c 100644 --- a/solution/2800-2899/2847.Smallest Number With Given Digit Product/README.md +++ b/solution/2800-2899/2847.Smallest Number With Given Digit Product/README.md @@ -1,4 +1,4 @@ -# [2847. 给定数字乘积的最小数字](https://leetcode.cn/problems/smallest-number-with-given-digit-product) +# [2847. 给定数字乘积的最小数字 🔒](https://leetcode.cn/problems/smallest-number-with-given-digit-product) [English Version](/solution/2800-2899/2847.Smallest%20Number%20With%20Given%20Digit%20Product/README_EN.md) diff --git a/solution/2800-2899/2847.Smallest Number With Given Digit Product/README_EN.md b/solution/2800-2899/2847.Smallest Number With Given Digit Product/README_EN.md index 8d2b57164b09b..525f71dffae3a 100644 --- a/solution/2800-2899/2847.Smallest Number With Given Digit Product/README_EN.md +++ b/solution/2800-2899/2847.Smallest Number With Given Digit Product/README_EN.md @@ -1,4 +1,4 @@ -# [2847. Smallest Number With Given Digit Product](https://leetcode.com/problems/smallest-number-with-given-digit-product) +# [2847. Smallest Number With Given Digit Product 🔒](https://leetcode.com/problems/smallest-number-with-given-digit-product) [中文文档](/solution/2800-2899/2847.Smallest%20Number%20With%20Given%20Digit%20Product/README.md) diff --git a/solution/2800-2899/2852.Sum of Remoteness of All Cells/README.md b/solution/2800-2899/2852.Sum of Remoteness of All Cells/README.md index f1bef480273f1..8123949c3e9a6 100644 --- a/solution/2800-2899/2852.Sum of Remoteness of All Cells/README.md +++ b/solution/2800-2899/2852.Sum of Remoteness of All Cells/README.md @@ -1,4 +1,4 @@ -# [2852. 所有单元格的远离程度之和](https://leetcode.cn/problems/sum-of-remoteness-of-all-cells) +# [2852. 所有单元格的远离程度之和 🔒](https://leetcode.cn/problems/sum-of-remoteness-of-all-cells) [English Version](/solution/2800-2899/2852.Sum%20of%20Remoteness%20of%20All%20Cells/README_EN.md) diff --git a/solution/2800-2899/2852.Sum of Remoteness of All Cells/README_EN.md b/solution/2800-2899/2852.Sum of Remoteness of All Cells/README_EN.md index 589e1fece08ea..6ed78b72d002e 100644 --- a/solution/2800-2899/2852.Sum of Remoteness of All Cells/README_EN.md +++ b/solution/2800-2899/2852.Sum of Remoteness of All Cells/README_EN.md @@ -1,4 +1,4 @@ -# [2852. Sum of Remoteness of All Cells](https://leetcode.com/problems/sum-of-remoteness-of-all-cells) +# [2852. Sum of Remoteness of All Cells 🔒](https://leetcode.com/problems/sum-of-remoteness-of-all-cells) [中文文档](/solution/2800-2899/2852.Sum%20of%20Remoteness%20of%20All%20Cells/README.md) diff --git a/solution/2800-2899/2853.Highest Salaries Difference/README.md b/solution/2800-2899/2853.Highest Salaries Difference/README.md index dfb46ac65a39d..4b616b945d25d 100644 --- a/solution/2800-2899/2853.Highest Salaries Difference/README.md +++ b/solution/2800-2899/2853.Highest Salaries Difference/README.md @@ -1,4 +1,4 @@ -# [2853. 最高薪水差异](https://leetcode.cn/problems/highest-salaries-difference) +# [2853. 最高薪水差异 🔒](https://leetcode.cn/problems/highest-salaries-difference) [English Version](/solution/2800-2899/2853.Highest%20Salaries%20Difference/README_EN.md) diff --git a/solution/2800-2899/2853.Highest Salaries Difference/README_EN.md b/solution/2800-2899/2853.Highest Salaries Difference/README_EN.md index 8b08fdcd2267a..b94064c304228 100644 --- a/solution/2800-2899/2853.Highest Salaries Difference/README_EN.md +++ b/solution/2800-2899/2853.Highest Salaries Difference/README_EN.md @@ -1,4 +1,4 @@ -# [2853. Highest Salaries Difference](https://leetcode.com/problems/highest-salaries-difference) +# [2853. Highest Salaries Difference 🔒](https://leetcode.com/problems/highest-salaries-difference) [中文文档](/solution/2800-2899/2853.Highest%20Salaries%20Difference/README.md) diff --git a/solution/2800-2899/2854.Rolling Average Steps/README.md b/solution/2800-2899/2854.Rolling Average Steps/README.md index 38d4bb464e7e3..b23a43a442c7b 100644 --- a/solution/2800-2899/2854.Rolling Average Steps/README.md +++ b/solution/2800-2899/2854.Rolling Average Steps/README.md @@ -1,4 +1,4 @@ -# [2854. 滚动平均步数](https://leetcode.cn/problems/rolling-average-steps) +# [2854. 滚动平均步数 🔒](https://leetcode.cn/problems/rolling-average-steps) [English Version](/solution/2800-2899/2854.Rolling%20Average%20Steps/README_EN.md) diff --git a/solution/2800-2899/2854.Rolling Average Steps/README_EN.md b/solution/2800-2899/2854.Rolling Average Steps/README_EN.md index 7cff4cc826090..7662af546ad00 100644 --- a/solution/2800-2899/2854.Rolling Average Steps/README_EN.md +++ b/solution/2800-2899/2854.Rolling Average Steps/README_EN.md @@ -1,4 +1,4 @@ -# [2854. Rolling Average Steps](https://leetcode.com/problems/rolling-average-steps) +# [2854. Rolling Average Steps 🔒](https://leetcode.com/problems/rolling-average-steps) [中文文档](/solution/2800-2899/2854.Rolling%20Average%20Steps/README.md) diff --git a/solution/2800-2899/2863.Maximum Length of Semi-Decreasing Subarrays/README.md b/solution/2800-2899/2863.Maximum Length of Semi-Decreasing Subarrays/README.md index d7fae83d117d0..7c832cfb7c76e 100644 --- a/solution/2800-2899/2863.Maximum Length of Semi-Decreasing Subarrays/README.md +++ b/solution/2800-2899/2863.Maximum Length of Semi-Decreasing Subarrays/README.md @@ -1,4 +1,4 @@ -# [2863. 最长半递减数组](https://leetcode.cn/problems/maximum-length-of-semi-decreasing-subarrays) +# [2863. 最长半递减数组 🔒](https://leetcode.cn/problems/maximum-length-of-semi-decreasing-subarrays) [English Version](/solution/2800-2899/2863.Maximum%20Length%20of%20Semi-Decreasing%20Subarrays/README_EN.md) diff --git a/solution/2800-2899/2863.Maximum Length of Semi-Decreasing Subarrays/README_EN.md b/solution/2800-2899/2863.Maximum Length of Semi-Decreasing Subarrays/README_EN.md index 16a3de80e7c32..eedf031cfa055 100644 --- a/solution/2800-2899/2863.Maximum Length of Semi-Decreasing Subarrays/README_EN.md +++ b/solution/2800-2899/2863.Maximum Length of Semi-Decreasing Subarrays/README_EN.md @@ -1,4 +1,4 @@ -# [2863. Maximum Length of Semi-Decreasing Subarrays](https://leetcode.com/problems/maximum-length-of-semi-decreasing-subarrays) +# [2863. Maximum Length of Semi-Decreasing Subarrays 🔒](https://leetcode.com/problems/maximum-length-of-semi-decreasing-subarrays) [中文文档](/solution/2800-2899/2863.Maximum%20Length%20of%20Semi-Decreasing%20Subarrays/README.md) diff --git a/solution/2800-2899/2868.The Wording Game/README.md b/solution/2800-2899/2868.The Wording Game/README.md index b3daba140d470..feeefebe312cd 100644 --- a/solution/2800-2899/2868.The Wording Game/README.md +++ b/solution/2800-2899/2868.The Wording Game/README.md @@ -1,4 +1,4 @@ -# [2868. 单词游戏](https://leetcode.cn/problems/the-wording-game) +# [2868. 单词游戏 🔒](https://leetcode.cn/problems/the-wording-game) [English Version](/solution/2800-2899/2868.The%20Wording%20Game/README_EN.md) diff --git a/solution/2800-2899/2868.The Wording Game/README_EN.md b/solution/2800-2899/2868.The Wording Game/README_EN.md index 5d2574e3aca6e..da8e2656a48a6 100644 --- a/solution/2800-2899/2868.The Wording Game/README_EN.md +++ b/solution/2800-2899/2868.The Wording Game/README_EN.md @@ -1,4 +1,4 @@ -# [2868. The Wording Game](https://leetcode.com/problems/the-wording-game) +# [2868. The Wording Game 🔒](https://leetcode.com/problems/the-wording-game) [中文文档](/solution/2800-2899/2868.The%20Wording%20Game/README.md) diff --git a/solution/2800-2899/2892.Minimizing Array After Replacing Pairs With Their Product/README.md b/solution/2800-2899/2892.Minimizing Array After Replacing Pairs With Their Product/README.md index d8290a832fcd5..f46d7312c7549 100644 --- a/solution/2800-2899/2892.Minimizing Array After Replacing Pairs With Their Product/README.md +++ b/solution/2800-2899/2892.Minimizing Array After Replacing Pairs With Their Product/README.md @@ -1,4 +1,4 @@ -# [2892. 将相邻元素相乘后得到最小化数组](https://leetcode.cn/problems/minimizing-array-after-replacing-pairs-with-their-product) +# [2892. 将相邻元素相乘后得到最小化数组 🔒](https://leetcode.cn/problems/minimizing-array-after-replacing-pairs-with-their-product) [English Version](/solution/2800-2899/2892.Minimizing%20Array%20After%20Replacing%20Pairs%20With%20Their%20Product/README_EN.md) diff --git a/solution/2800-2899/2892.Minimizing Array After Replacing Pairs With Their Product/README_EN.md b/solution/2800-2899/2892.Minimizing Array After Replacing Pairs With Their Product/README_EN.md index 0b9cac1900085..c0cb7044b80fd 100644 --- a/solution/2800-2899/2892.Minimizing Array After Replacing Pairs With Their Product/README_EN.md +++ b/solution/2800-2899/2892.Minimizing Array After Replacing Pairs With Their Product/README_EN.md @@ -1,4 +1,4 @@ -# [2892. Minimizing Array After Replacing Pairs With Their Product](https://leetcode.com/problems/minimizing-array-after-replacing-pairs-with-their-product) +# [2892. Minimizing Array After Replacing Pairs With Their Product 🔒](https://leetcode.com/problems/minimizing-array-after-replacing-pairs-with-their-product) [中文文档](/solution/2800-2899/2892.Minimizing%20Array%20After%20Replacing%20Pairs%20With%20Their%20Product/README.md) diff --git a/solution/2800-2899/2893.Calculate Orders Within Each Interval/README.md b/solution/2800-2899/2893.Calculate Orders Within Each Interval/README.md index c2fc6e0209afe..e0cab3d886869 100644 --- a/solution/2800-2899/2893.Calculate Orders Within Each Interval/README.md +++ b/solution/2800-2899/2893.Calculate Orders Within Each Interval/README.md @@ -1,4 +1,4 @@ -# [2893. 计算每个区间内的订单](https://leetcode.cn/problems/calculate-orders-within-each-interval) +# [2893. 计算每个区间内的订单 🔒](https://leetcode.cn/problems/calculate-orders-within-each-interval) [English Version](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README_EN.md) diff --git a/solution/2800-2899/2893.Calculate Orders Within Each Interval/README_EN.md b/solution/2800-2899/2893.Calculate Orders Within Each Interval/README_EN.md index 14b42f7c640ed..68a3502fbb936 100644 --- a/solution/2800-2899/2893.Calculate Orders Within Each Interval/README_EN.md +++ b/solution/2800-2899/2893.Calculate Orders Within Each Interval/README_EN.md @@ -1,4 +1,4 @@ -# [2893. Calculate Orders Within Each Interval](https://leetcode.com/problems/calculate-orders-within-each-interval) +# [2893. Calculate Orders Within Each Interval 🔒](https://leetcode.com/problems/calculate-orders-within-each-interval) [中文文档](/solution/2800-2899/2893.Calculate%20Orders%20Within%20Each%20Interval/README.md) diff --git a/solution/2800-2899/2898.Maximum Linear Stock Score/README.md b/solution/2800-2899/2898.Maximum Linear Stock Score/README.md index 90752f8d4989c..62349d7248834 100644 --- a/solution/2800-2899/2898.Maximum Linear Stock Score/README.md +++ b/solution/2800-2899/2898.Maximum Linear Stock Score/README.md @@ -1,4 +1,4 @@ -# [2898. 最大线性股票得分](https://leetcode.cn/problems/maximum-linear-stock-score) +# [2898. 最大线性股票得分 🔒](https://leetcode.cn/problems/maximum-linear-stock-score) [English Version](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README_EN.md) diff --git a/solution/2800-2899/2898.Maximum Linear Stock Score/README_EN.md b/solution/2800-2899/2898.Maximum Linear Stock Score/README_EN.md index 855a810d7e11b..1bc592fc24783 100644 --- a/solution/2800-2899/2898.Maximum Linear Stock Score/README_EN.md +++ b/solution/2800-2899/2898.Maximum Linear Stock Score/README_EN.md @@ -1,4 +1,4 @@ -# [2898. Maximum Linear Stock Score](https://leetcode.com/problems/maximum-linear-stock-score) +# [2898. Maximum Linear Stock Score 🔒](https://leetcode.com/problems/maximum-linear-stock-score) [中文文档](/solution/2800-2899/2898.Maximum%20Linear%20Stock%20Score/README.md) diff --git a/solution/2900-2999/2907.Maximum Profitable Triplets With Increasing Prices I/README.md b/solution/2900-2999/2907.Maximum Profitable Triplets With Increasing Prices I/README.md index 4d41e413d9486..c29c099091f9e 100644 --- a/solution/2900-2999/2907.Maximum Profitable Triplets With Increasing Prices I/README.md +++ b/solution/2900-2999/2907.Maximum Profitable Triplets With Increasing Prices I/README.md @@ -1,4 +1,4 @@ -# [2907. 价格递增的最大利润三元组 I](https://leetcode.cn/problems/maximum-profitable-triplets-with-increasing-prices-i) +# [2907. 价格递增的最大利润三元组 I 🔒](https://leetcode.cn/problems/maximum-profitable-triplets-with-increasing-prices-i) [English Version](/solution/2900-2999/2907.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20I/README_EN.md) diff --git a/solution/2900-2999/2907.Maximum Profitable Triplets With Increasing Prices I/README_EN.md b/solution/2900-2999/2907.Maximum Profitable Triplets With Increasing Prices I/README_EN.md index e24e71700f77f..2409aae1c7092 100644 --- a/solution/2900-2999/2907.Maximum Profitable Triplets With Increasing Prices I/README_EN.md +++ b/solution/2900-2999/2907.Maximum Profitable Triplets With Increasing Prices I/README_EN.md @@ -1,4 +1,4 @@ -# [2907. Maximum Profitable Triplets With Increasing Prices I](https://leetcode.com/problems/maximum-profitable-triplets-with-increasing-prices-i) +# [2907. Maximum Profitable Triplets With Increasing Prices I 🔒](https://leetcode.com/problems/maximum-profitable-triplets-with-increasing-prices-i) [中文文档](/solution/2900-2999/2907.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20I/README.md) diff --git a/solution/2900-2999/2912.Number of Ways to Reach Destination in the Grid/README.md b/solution/2900-2999/2912.Number of Ways to Reach Destination in the Grid/README.md index f8d48f7f835b7..5e926bfabbc1f 100644 --- a/solution/2900-2999/2912.Number of Ways to Reach Destination in the Grid/README.md +++ b/solution/2900-2999/2912.Number of Ways to Reach Destination in the Grid/README.md @@ -1,4 +1,4 @@ -# [2912. 在网格上移动到目的地的方法数](https://leetcode.cn/problems/number-of-ways-to-reach-destination-in-the-grid) +# [2912. 在网格上移动到目的地的方法数 🔒](https://leetcode.cn/problems/number-of-ways-to-reach-destination-in-the-grid) [English Version](/solution/2900-2999/2912.Number%20of%20Ways%20to%20Reach%20Destination%20in%20the%20Grid/README_EN.md) diff --git a/solution/2900-2999/2912.Number of Ways to Reach Destination in the Grid/README_EN.md b/solution/2900-2999/2912.Number of Ways to Reach Destination in the Grid/README_EN.md index 1dc11e986a290..c3ab58f4fd328 100644 --- a/solution/2900-2999/2912.Number of Ways to Reach Destination in the Grid/README_EN.md +++ b/solution/2900-2999/2912.Number of Ways to Reach Destination in the Grid/README_EN.md @@ -1,4 +1,4 @@ -# [2912. Number of Ways to Reach Destination in the Grid](https://leetcode.com/problems/number-of-ways-to-reach-destination-in-the-grid) +# [2912. Number of Ways to Reach Destination in the Grid 🔒](https://leetcode.com/problems/number-of-ways-to-reach-destination-in-the-grid) [中文文档](/solution/2900-2999/2912.Number%20of%20Ways%20to%20Reach%20Destination%20in%20the%20Grid/README.md) diff --git a/solution/2900-2999/2921.Maximum Profitable Triplets With Increasing Prices II/README.md b/solution/2900-2999/2921.Maximum Profitable Triplets With Increasing Prices II/README.md index 0478c98374a3e..985a8b39f4636 100644 --- a/solution/2900-2999/2921.Maximum Profitable Triplets With Increasing Prices II/README.md +++ b/solution/2900-2999/2921.Maximum Profitable Triplets With Increasing Prices II/README.md @@ -1,4 +1,4 @@ -# [2921. 价格递增的最大利润三元组 II](https://leetcode.cn/problems/maximum-profitable-triplets-with-increasing-prices-ii) +# [2921. 价格递增的最大利润三元组 II 🔒](https://leetcode.cn/problems/maximum-profitable-triplets-with-increasing-prices-ii) [English Version](/solution/2900-2999/2921.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20II/README_EN.md) diff --git a/solution/2900-2999/2921.Maximum Profitable Triplets With Increasing Prices II/README_EN.md b/solution/2900-2999/2921.Maximum Profitable Triplets With Increasing Prices II/README_EN.md index 09324b3f51cba..c47f1f836048d 100644 --- a/solution/2900-2999/2921.Maximum Profitable Triplets With Increasing Prices II/README_EN.md +++ b/solution/2900-2999/2921.Maximum Profitable Triplets With Increasing Prices II/README_EN.md @@ -1,4 +1,4 @@ -# [2921. Maximum Profitable Triplets With Increasing Prices II](https://leetcode.com/problems/maximum-profitable-triplets-with-increasing-prices-ii) +# [2921. Maximum Profitable Triplets With Increasing Prices II 🔒](https://leetcode.com/problems/maximum-profitable-triplets-with-increasing-prices-ii) [中文文档](/solution/2900-2999/2921.Maximum%20Profitable%20Triplets%20With%20Increasing%20Prices%20II/README.md) diff --git a/solution/2900-2999/2922.Market Analysis III/README.md b/solution/2900-2999/2922.Market Analysis III/README.md index ad7a501c06c0f..c29267ff9ba93 100644 --- a/solution/2900-2999/2922.Market Analysis III/README.md +++ b/solution/2900-2999/2922.Market Analysis III/README.md @@ -1,4 +1,4 @@ -# [2922. 市场分析 III](https://leetcode.cn/problems/market-analysis-iii) +# [2922. 市场分析 III 🔒](https://leetcode.cn/problems/market-analysis-iii) [English Version](/solution/2900-2999/2922.Market%20Analysis%20III/README_EN.md) diff --git a/solution/2900-2999/2922.Market Analysis III/README_EN.md b/solution/2900-2999/2922.Market Analysis III/README_EN.md index 3c8c93ed300bc..56f96c77a2e72 100644 --- a/solution/2900-2999/2922.Market Analysis III/README_EN.md +++ b/solution/2900-2999/2922.Market Analysis III/README_EN.md @@ -1,4 +1,4 @@ -# [2922. Market Analysis III](https://leetcode.com/problems/market-analysis-iii) +# [2922. Market Analysis III 🔒](https://leetcode.com/problems/market-analysis-iii) [中文文档](/solution/2900-2999/2922.Market%20Analysis%20III/README.md) diff --git a/solution/2900-2999/2927.Distribute Candies Among Children III/README.md b/solution/2900-2999/2927.Distribute Candies Among Children III/README.md index ba5b98d973db5..7d70a86a5aea1 100644 --- a/solution/2900-2999/2927.Distribute Candies Among Children III/README.md +++ b/solution/2900-2999/2927.Distribute Candies Among Children III/README.md @@ -1,4 +1,4 @@ -# [2927. 给小朋友们分糖果 III](https://leetcode.cn/problems/distribute-candies-among-children-iii) +# [2927. 给小朋友们分糖果 III 🔒](https://leetcode.cn/problems/distribute-candies-among-children-iii) [English Version](/solution/2900-2999/2927.Distribute%20Candies%20Among%20Children%20III/README_EN.md) diff --git a/solution/2900-2999/2927.Distribute Candies Among Children III/README_EN.md b/solution/2900-2999/2927.Distribute Candies Among Children III/README_EN.md index 838ed4e733a2d..f9da534b8635a 100644 --- a/solution/2900-2999/2927.Distribute Candies Among Children III/README_EN.md +++ b/solution/2900-2999/2927.Distribute Candies Among Children III/README_EN.md @@ -1,4 +1,4 @@ -# [2927. Distribute Candies Among Children III](https://leetcode.com/problems/distribute-candies-among-children-iii) +# [2927. Distribute Candies Among Children III 🔒](https://leetcode.com/problems/distribute-candies-among-children-iii) [中文文档](/solution/2900-2999/2927.Distribute%20Candies%20Among%20Children%20III/README.md) diff --git a/solution/2900-2999/2936.Number of Equal Numbers Blocks/README.md b/solution/2900-2999/2936.Number of Equal Numbers Blocks/README.md index e67f494e08056..1f7501d166e9d 100644 --- a/solution/2900-2999/2936.Number of Equal Numbers Blocks/README.md +++ b/solution/2900-2999/2936.Number of Equal Numbers Blocks/README.md @@ -1,4 +1,4 @@ -# [2936. 包含相等值数字块的数量](https://leetcode.cn/problems/number-of-equal-numbers-blocks) +# [2936. 包含相等值数字块的数量 🔒](https://leetcode.cn/problems/number-of-equal-numbers-blocks) [English Version](/solution/2900-2999/2936.Number%20of%20Equal%20Numbers%20Blocks/README_EN.md) diff --git a/solution/2900-2999/2936.Number of Equal Numbers Blocks/README_EN.md b/solution/2900-2999/2936.Number of Equal Numbers Blocks/README_EN.md index 227af193cf5e8..6979acb7bc8e0 100644 --- a/solution/2900-2999/2936.Number of Equal Numbers Blocks/README_EN.md +++ b/solution/2900-2999/2936.Number of Equal Numbers Blocks/README_EN.md @@ -1,4 +1,4 @@ -# [2936. Number of Equal Numbers Blocks](https://leetcode.com/problems/number-of-equal-numbers-blocks) +# [2936. Number of Equal Numbers Blocks 🔒](https://leetcode.com/problems/number-of-equal-numbers-blocks) [中文文档](/solution/2900-2999/2936.Number%20of%20Equal%20Numbers%20Blocks/README.md) diff --git a/solution/2900-2999/2941.Maximum GCD-Sum of a Subarray/README.md b/solution/2900-2999/2941.Maximum GCD-Sum of a Subarray/README.md index 4ef8d63cf8ddd..1eb55c58ad6d5 100644 --- a/solution/2900-2999/2941.Maximum GCD-Sum of a Subarray/README.md +++ b/solution/2900-2999/2941.Maximum GCD-Sum of a Subarray/README.md @@ -1,4 +1,4 @@ -# [2941. 子数组的最大 GCD-Sum](https://leetcode.cn/problems/maximum-gcd-sum-of-a-subarray) +# [2941. 子数组的最大 GCD-Sum 🔒](https://leetcode.cn/problems/maximum-gcd-sum-of-a-subarray) [English Version](/solution/2900-2999/2941.Maximum%20GCD-Sum%20of%20a%20Subarray/README_EN.md) diff --git a/solution/2900-2999/2941.Maximum GCD-Sum of a Subarray/README_EN.md b/solution/2900-2999/2941.Maximum GCD-Sum of a Subarray/README_EN.md index 0f6d6be66e58d..ec8db5a4a9d2a 100644 --- a/solution/2900-2999/2941.Maximum GCD-Sum of a Subarray/README_EN.md +++ b/solution/2900-2999/2941.Maximum GCD-Sum of a Subarray/README_EN.md @@ -1,4 +1,4 @@ -# [2941. Maximum GCD-Sum of a Subarray](https://leetcode.com/problems/maximum-gcd-sum-of-a-subarray) +# [2941. Maximum GCD-Sum of a Subarray 🔒](https://leetcode.com/problems/maximum-gcd-sum-of-a-subarray) [中文文档](/solution/2900-2999/2941.Maximum%20GCD-Sum%20of%20a%20Subarray/README.md) diff --git a/solution/2900-2999/2950.Number of Divisible Substrings/README.md b/solution/2900-2999/2950.Number of Divisible Substrings/README.md index 9636b4851f39d..b550eee594cd9 100644 --- a/solution/2900-2999/2950.Number of Divisible Substrings/README.md +++ b/solution/2900-2999/2950.Number of Divisible Substrings/README.md @@ -1,4 +1,4 @@ -# [2950. 可整除子串的数量](https://leetcode.cn/problems/number-of-divisible-substrings) +# [2950. 可整除子串的数量 🔒](https://leetcode.cn/problems/number-of-divisible-substrings) [English Version](/solution/2900-2999/2950.Number%20of%20Divisible%20Substrings/README_EN.md) diff --git a/solution/2900-2999/2950.Number of Divisible Substrings/README_EN.md b/solution/2900-2999/2950.Number of Divisible Substrings/README_EN.md index af95d753512a8..7a7743ca3d0ea 100644 --- a/solution/2900-2999/2950.Number of Divisible Substrings/README_EN.md +++ b/solution/2900-2999/2950.Number of Divisible Substrings/README_EN.md @@ -1,4 +1,4 @@ -# [2950. Number of Divisible Substrings](https://leetcode.com/problems/number-of-divisible-substrings) +# [2950. Number of Divisible Substrings 🔒](https://leetcode.com/problems/number-of-divisible-substrings) [中文文档](/solution/2900-2999/2950.Number%20of%20Divisible%20Substrings/README.md) diff --git a/solution/2900-2999/2955.Number of Same-End Substrings/README.md b/solution/2900-2999/2955.Number of Same-End Substrings/README.md index 6962e352a26d0..e9af1ca15cffb 100644 --- a/solution/2900-2999/2955.Number of Same-End Substrings/README.md +++ b/solution/2900-2999/2955.Number of Same-End Substrings/README.md @@ -1,4 +1,4 @@ -# [2955. 同端子串的数量](https://leetcode.cn/problems/number-of-same-end-substrings) +# [2955. 同端子串的数量 🔒](https://leetcode.cn/problems/number-of-same-end-substrings) [English Version](/solution/2900-2999/2955.Number%20of%20Same-End%20Substrings/README_EN.md) diff --git a/solution/2900-2999/2955.Number of Same-End Substrings/README_EN.md b/solution/2900-2999/2955.Number of Same-End Substrings/README_EN.md index 5350805036371..968256cbe87ad 100644 --- a/solution/2900-2999/2955.Number of Same-End Substrings/README_EN.md +++ b/solution/2900-2999/2955.Number of Same-End Substrings/README_EN.md @@ -1,4 +1,4 @@ -# [2955. Number of Same-End Substrings](https://leetcode.com/problems/number-of-same-end-substrings) +# [2955. Number of Same-End Substrings 🔒](https://leetcode.com/problems/number-of-same-end-substrings) [中文文档](/solution/2900-2999/2955.Number%20of%20Same-End%20Substrings/README.md) diff --git a/solution/2900-2999/2964.Number of Divisible Triplet Sums/README.md b/solution/2900-2999/2964.Number of Divisible Triplet Sums/README.md index 298e1b16e00ec..9a52613ce7db6 100644 --- a/solution/2900-2999/2964.Number of Divisible Triplet Sums/README.md +++ b/solution/2900-2999/2964.Number of Divisible Triplet Sums/README.md @@ -1,4 +1,4 @@ -# [2964. 可被整除的三元组数量](https://leetcode.cn/problems/number-of-divisible-triplet-sums) +# [2964. 可被整除的三元组数量 🔒](https://leetcode.cn/problems/number-of-divisible-triplet-sums) [English Version](/solution/2900-2999/2964.Number%20of%20Divisible%20Triplet%20Sums/README_EN.md) diff --git a/solution/2900-2999/2964.Number of Divisible Triplet Sums/README_EN.md b/solution/2900-2999/2964.Number of Divisible Triplet Sums/README_EN.md index f076fc8d730aa..56f0f0ce63e04 100644 --- a/solution/2900-2999/2964.Number of Divisible Triplet Sums/README_EN.md +++ b/solution/2900-2999/2964.Number of Divisible Triplet Sums/README_EN.md @@ -1,4 +1,4 @@ -# [2964. Number of Divisible Triplet Sums](https://leetcode.com/problems/number-of-divisible-triplet-sums) +# [2964. Number of Divisible Triplet Sums 🔒](https://leetcode.com/problems/number-of-divisible-triplet-sums) [中文文档](/solution/2900-2999/2964.Number%20of%20Divisible%20Triplet%20Sums/README.md) diff --git a/solution/2900-2999/2969.Minimum Number of Coins for Fruits II/README.md b/solution/2900-2999/2969.Minimum Number of Coins for Fruits II/README.md index d5f82a8ed8370..171b09af17917 100644 --- a/solution/2900-2999/2969.Minimum Number of Coins for Fruits II/README.md +++ b/solution/2900-2999/2969.Minimum Number of Coins for Fruits II/README.md @@ -1,4 +1,4 @@ -# [2969. 购买水果需要的最少金币数 II](https://leetcode.cn/problems/minimum-number-of-coins-for-fruits-ii) +# [2969. 购买水果需要的最少金币数 II 🔒](https://leetcode.cn/problems/minimum-number-of-coins-for-fruits-ii) [English Version](/solution/2900-2999/2969.Minimum%20Number%20of%20Coins%20for%20Fruits%20II/README_EN.md) diff --git a/solution/2900-2999/2969.Minimum Number of Coins for Fruits II/README_EN.md b/solution/2900-2999/2969.Minimum Number of Coins for Fruits II/README_EN.md index dc79018e00a27..e431a094aa6e7 100644 --- a/solution/2900-2999/2969.Minimum Number of Coins for Fruits II/README_EN.md +++ b/solution/2900-2999/2969.Minimum Number of Coins for Fruits II/README_EN.md @@ -1,4 +1,4 @@ -# [2969. Minimum Number of Coins for Fruits II](https://leetcode.com/problems/minimum-number-of-coins-for-fruits-ii) +# [2969. Minimum Number of Coins for Fruits II 🔒](https://leetcode.com/problems/minimum-number-of-coins-for-fruits-ii) [中文文档](/solution/2900-2999/2969.Minimum%20Number%20of%20Coins%20for%20Fruits%20II/README.md) diff --git a/solution/2900-2999/2978.Symmetric Coordinates/README.md b/solution/2900-2999/2978.Symmetric Coordinates/README.md index 75aee4a9e696a..0e5cf9d002021 100644 --- a/solution/2900-2999/2978.Symmetric Coordinates/README.md +++ b/solution/2900-2999/2978.Symmetric Coordinates/README.md @@ -1,4 +1,4 @@ -# [2978. 对称坐标](https://leetcode.cn/problems/symmetric-coordinates) +# [2978. 对称坐标 🔒](https://leetcode.cn/problems/symmetric-coordinates) [English Version](/solution/2900-2999/2978.Symmetric%20Coordinates/README_EN.md) diff --git a/solution/2900-2999/2978.Symmetric Coordinates/README_EN.md b/solution/2900-2999/2978.Symmetric Coordinates/README_EN.md index 63199a0524730..d9ea5091196da 100644 --- a/solution/2900-2999/2978.Symmetric Coordinates/README_EN.md +++ b/solution/2900-2999/2978.Symmetric Coordinates/README_EN.md @@ -1,4 +1,4 @@ -# [2978. Symmetric Coordinates](https://leetcode.com/problems/symmetric-coordinates) +# [2978. Symmetric Coordinates 🔒](https://leetcode.com/problems/symmetric-coordinates) [中文文档](/solution/2900-2999/2978.Symmetric%20Coordinates/README.md) diff --git a/solution/2900-2999/2979.Most Expensive Item That Can Not Be Bought/README.md b/solution/2900-2999/2979.Most Expensive Item That Can Not Be Bought/README.md index 365ccbb12bdd0..9e783645e51a1 100644 --- a/solution/2900-2999/2979.Most Expensive Item That Can Not Be Bought/README.md +++ b/solution/2900-2999/2979.Most Expensive Item That Can Not Be Bought/README.md @@ -1,4 +1,4 @@ -# [2979. 最贵的无法购买的商品](https://leetcode.cn/problems/most-expensive-item-that-can-not-be-bought) +# [2979. 最贵的无法购买的商品 🔒](https://leetcode.cn/problems/most-expensive-item-that-can-not-be-bought) [English Version](/solution/2900-2999/2979.Most%20Expensive%20Item%20That%20Can%20Not%20Be%20Bought/README_EN.md) diff --git a/solution/2900-2999/2979.Most Expensive Item That Can Not Be Bought/README_EN.md b/solution/2900-2999/2979.Most Expensive Item That Can Not Be Bought/README_EN.md index ceb23645185be..9fe8bc8eca66d 100644 --- a/solution/2900-2999/2979.Most Expensive Item That Can Not Be Bought/README_EN.md +++ b/solution/2900-2999/2979.Most Expensive Item That Can Not Be Bought/README_EN.md @@ -1,4 +1,4 @@ -# [2979. Most Expensive Item That Can Not Be Bought](https://leetcode.com/problems/most-expensive-item-that-can-not-be-bought) +# [2979. Most Expensive Item That Can Not Be Bought 🔒](https://leetcode.com/problems/most-expensive-item-that-can-not-be-bought) [中文文档](/solution/2900-2999/2979.Most%20Expensive%20Item%20That%20Can%20Not%20Be%20Bought/README.md) diff --git a/solution/2900-2999/2984.Find Peak Calling Hours for Each City/README.md b/solution/2900-2999/2984.Find Peak Calling Hours for Each City/README.md index b0cae282e565b..1366bf9b440d7 100644 --- a/solution/2900-2999/2984.Find Peak Calling Hours for Each City/README.md +++ b/solution/2900-2999/2984.Find Peak Calling Hours for Each City/README.md @@ -1,4 +1,4 @@ -# [2984. 找到每座城市的高峰通话时间](https://leetcode.cn/problems/find-peak-calling-hours-for-each-city) +# [2984. 找到每座城市的高峰通话时间 🔒](https://leetcode.cn/problems/find-peak-calling-hours-for-each-city) [English Version](/solution/2900-2999/2984.Find%20Peak%20Calling%20Hours%20for%20Each%20City/README_EN.md) diff --git a/solution/2900-2999/2984.Find Peak Calling Hours for Each City/README_EN.md b/solution/2900-2999/2984.Find Peak Calling Hours for Each City/README_EN.md index 99e16f09c4bc4..9eb59888bc5f8 100644 --- a/solution/2900-2999/2984.Find Peak Calling Hours for Each City/README_EN.md +++ b/solution/2900-2999/2984.Find Peak Calling Hours for Each City/README_EN.md @@ -1,4 +1,4 @@ -# [2984. Find Peak Calling Hours for Each City](https://leetcode.com/problems/find-peak-calling-hours-for-each-city) +# [2984. Find Peak Calling Hours for Each City 🔒](https://leetcode.com/problems/find-peak-calling-hours-for-each-city) [中文文档](/solution/2900-2999/2984.Find%20Peak%20Calling%20Hours%20for%20Each%20City/README.md) diff --git a/solution/2900-2999/2985.Calculate Compressed Mean/README.md b/solution/2900-2999/2985.Calculate Compressed Mean/README.md index 3013972d521b7..19ddd89340f8c 100644 --- a/solution/2900-2999/2985.Calculate Compressed Mean/README.md +++ b/solution/2900-2999/2985.Calculate Compressed Mean/README.md @@ -1,4 +1,4 @@ -# [2985. 计算订单平均商品数量](https://leetcode.cn/problems/calculate-compressed-mean) +# [2985. 计算订单平均商品数量 🔒](https://leetcode.cn/problems/calculate-compressed-mean) [English Version](/solution/2900-2999/2985.Calculate%20Compressed%20Mean/README_EN.md) diff --git a/solution/2900-2999/2985.Calculate Compressed Mean/README_EN.md b/solution/2900-2999/2985.Calculate Compressed Mean/README_EN.md index d9697fb818ed3..47ff1765c27f0 100644 --- a/solution/2900-2999/2985.Calculate Compressed Mean/README_EN.md +++ b/solution/2900-2999/2985.Calculate Compressed Mean/README_EN.md @@ -1,4 +1,4 @@ -# [2985. Calculate Compressed Mean](https://leetcode.com/problems/calculate-compressed-mean) +# [2985. Calculate Compressed Mean 🔒](https://leetcode.com/problems/calculate-compressed-mean) [中文文档](/solution/2900-2999/2985.Calculate%20Compressed%20Mean/README.md) diff --git a/solution/2900-2999/2986.Find Third Transaction/README.md b/solution/2900-2999/2986.Find Third Transaction/README.md index fd8dcc7ebbfec..587a8dff7459b 100644 --- a/solution/2900-2999/2986.Find Third Transaction/README.md +++ b/solution/2900-2999/2986.Find Third Transaction/README.md @@ -1,4 +1,4 @@ -# [2986. 找到第三笔交易](https://leetcode.cn/problems/find-third-transaction) +# [2986. 找到第三笔交易 🔒](https://leetcode.cn/problems/find-third-transaction) [English Version](/solution/2900-2999/2986.Find%20Third%20Transaction/README_EN.md) diff --git a/solution/2900-2999/2986.Find Third Transaction/README_EN.md b/solution/2900-2999/2986.Find Third Transaction/README_EN.md index d18471385ff03..694dede09fc21 100644 --- a/solution/2900-2999/2986.Find Third Transaction/README_EN.md +++ b/solution/2900-2999/2986.Find Third Transaction/README_EN.md @@ -1,4 +1,4 @@ -# [2986. Find Third Transaction](https://leetcode.com/problems/find-third-transaction) +# [2986. Find Third Transaction 🔒](https://leetcode.com/problems/find-third-transaction) [中文文档](/solution/2900-2999/2986.Find%20Third%20Transaction/README.md) diff --git a/solution/2900-2999/2987.Find Expensive Cities/README.md b/solution/2900-2999/2987.Find Expensive Cities/README.md index 4e18c8bbd6e78..f75a291c617af 100644 --- a/solution/2900-2999/2987.Find Expensive Cities/README.md +++ b/solution/2900-2999/2987.Find Expensive Cities/README.md @@ -1,4 +1,4 @@ -# [2987. 寻找房价最贵的城市](https://leetcode.cn/problems/find-expensive-cities) +# [2987. 寻找房价最贵的城市 🔒](https://leetcode.cn/problems/find-expensive-cities) [English Version](/solution/2900-2999/2987.Find%20Expensive%20Cities/README_EN.md) diff --git a/solution/2900-2999/2987.Find Expensive Cities/README_EN.md b/solution/2900-2999/2987.Find Expensive Cities/README_EN.md index 46d6ae6cd201e..994514055655e 100644 --- a/solution/2900-2999/2987.Find Expensive Cities/README_EN.md +++ b/solution/2900-2999/2987.Find Expensive Cities/README_EN.md @@ -1,4 +1,4 @@ -# [2987. Find Expensive Cities](https://leetcode.com/problems/find-expensive-cities) +# [2987. Find Expensive Cities 🔒](https://leetcode.com/problems/find-expensive-cities) [中文文档](/solution/2900-2999/2987.Find%20Expensive%20Cities/README.md) diff --git a/solution/2900-2999/2988.Manager of the Largest Department/README.md b/solution/2900-2999/2988.Manager of the Largest Department/README.md index c465e6f1f0534..aa0a7948d92be 100644 --- a/solution/2900-2999/2988.Manager of the Largest Department/README.md +++ b/solution/2900-2999/2988.Manager of the Largest Department/README.md @@ -1,4 +1,4 @@ -# [2988. 最大部门的经理](https://leetcode.cn/problems/manager-of-the-largest-department) +# [2988. 最大部门的经理 🔒](https://leetcode.cn/problems/manager-of-the-largest-department) [English Version](/solution/2900-2999/2988.Manager%20of%20the%20Largest%20Department/README_EN.md) diff --git a/solution/2900-2999/2988.Manager of the Largest Department/README_EN.md b/solution/2900-2999/2988.Manager of the Largest Department/README_EN.md index 4ec2cba82afaa..b0e33600dbf85 100644 --- a/solution/2900-2999/2988.Manager of the Largest Department/README_EN.md +++ b/solution/2900-2999/2988.Manager of the Largest Department/README_EN.md @@ -1,4 +1,4 @@ -# [2988. Manager of the Largest Department](https://leetcode.com/problems/manager-of-the-largest-department) +# [2988. Manager of the Largest Department 🔒](https://leetcode.com/problems/manager-of-the-largest-department) [中文文档](/solution/2900-2999/2988.Manager%20of%20the%20Largest%20Department/README.md) diff --git a/solution/2900-2999/2989.Class Performance/README.md b/solution/2900-2999/2989.Class Performance/README.md index 1df5defb91eb5..5d455a096559a 100644 --- a/solution/2900-2999/2989.Class Performance/README.md +++ b/solution/2900-2999/2989.Class Performance/README.md @@ -1,4 +1,4 @@ -# [2989. 班级表现](https://leetcode.cn/problems/class-performance) +# [2989. 班级表现 🔒](https://leetcode.cn/problems/class-performance) [English Version](/solution/2900-2999/2989.Class%20Performance/README_EN.md) diff --git a/solution/2900-2999/2989.Class Performance/README_EN.md b/solution/2900-2999/2989.Class Performance/README_EN.md index b5a17fd73d3dc..da1a51dfa85f6 100644 --- a/solution/2900-2999/2989.Class Performance/README_EN.md +++ b/solution/2900-2999/2989.Class Performance/README_EN.md @@ -1,4 +1,4 @@ -# [2989. Class Performance](https://leetcode.com/problems/class-performance) +# [2989. Class Performance 🔒](https://leetcode.com/problems/class-performance) [中文文档](/solution/2900-2999/2989.Class%20Performance/README.md) diff --git a/solution/2900-2999/2990.Loan Types/README.md b/solution/2900-2999/2990.Loan Types/README.md index c2ceae5ff251a..cabe7fbb0d32c 100644 --- a/solution/2900-2999/2990.Loan Types/README.md +++ b/solution/2900-2999/2990.Loan Types/README.md @@ -1,4 +1,4 @@ -# [2990. 贷款类型](https://leetcode.cn/problems/loan-types) +# [2990. 贷款类型 🔒](https://leetcode.cn/problems/loan-types) [English Version](/solution/2900-2999/2990.Loan%20Types/README_EN.md) diff --git a/solution/2900-2999/2990.Loan Types/README_EN.md b/solution/2900-2999/2990.Loan Types/README_EN.md index 91260ff03f829..8defe1ab9fc59 100644 --- a/solution/2900-2999/2990.Loan Types/README_EN.md +++ b/solution/2900-2999/2990.Loan Types/README_EN.md @@ -1,4 +1,4 @@ -# [2990. Loan Types](https://leetcode.com/problems/loan-types) +# [2990. Loan Types 🔒](https://leetcode.com/problems/loan-types) [中文文档](/solution/2900-2999/2990.Loan%20Types/README.md) diff --git a/solution/2900-2999/2991.Top Three Wineries/README.md b/solution/2900-2999/2991.Top Three Wineries/README.md index cb407434a0ed0..02598513af7fe 100644 --- a/solution/2900-2999/2991.Top Three Wineries/README.md +++ b/solution/2900-2999/2991.Top Three Wineries/README.md @@ -1,4 +1,4 @@ -# [2991. 最好的三家酒庄](https://leetcode.cn/problems/top-three-wineries) +# [2991. 最好的三家酒庄 🔒](https://leetcode.cn/problems/top-three-wineries) [English Version](/solution/2900-2999/2991.Top%20Three%20Wineries/README_EN.md) diff --git a/solution/2900-2999/2991.Top Three Wineries/README_EN.md b/solution/2900-2999/2991.Top Three Wineries/README_EN.md index 4ff7f51d8e19e..8e98efec99c99 100644 --- a/solution/2900-2999/2991.Top Three Wineries/README_EN.md +++ b/solution/2900-2999/2991.Top Three Wineries/README_EN.md @@ -1,4 +1,4 @@ -# [2991. Top Three Wineries](https://leetcode.com/problems/top-three-wineries) +# [2991. Top Three Wineries 🔒](https://leetcode.com/problems/top-three-wineries) [中文文档](/solution/2900-2999/2991.Top%20Three%20Wineries/README.md) diff --git a/solution/2900-2999/2992.Number of Self-Divisible Permutations/README.md b/solution/2900-2999/2992.Number of Self-Divisible Permutations/README.md index 0dcfdf87a9f23..5c63c8925e3e4 100644 --- a/solution/2900-2999/2992.Number of Self-Divisible Permutations/README.md +++ b/solution/2900-2999/2992.Number of Self-Divisible Permutations/README.md @@ -1,4 +1,4 @@ -# [2992. 自整除排列的数量](https://leetcode.cn/problems/number-of-self-divisible-permutations) +# [2992. 自整除排列的数量 🔒](https://leetcode.cn/problems/number-of-self-divisible-permutations) [English Version](/solution/2900-2999/2992.Number%20of%20Self-Divisible%20Permutations/README_EN.md) diff --git a/solution/2900-2999/2992.Number of Self-Divisible Permutations/README_EN.md b/solution/2900-2999/2992.Number of Self-Divisible Permutations/README_EN.md index cefe52b20a7fc..584a34ca8703e 100644 --- a/solution/2900-2999/2992.Number of Self-Divisible Permutations/README_EN.md +++ b/solution/2900-2999/2992.Number of Self-Divisible Permutations/README_EN.md @@ -1,4 +1,4 @@ -# [2992. Number of Self-Divisible Permutations](https://leetcode.com/problems/number-of-self-divisible-permutations) +# [2992. Number of Self-Divisible Permutations 🔒](https://leetcode.com/problems/number-of-self-divisible-permutations) [中文文档](/solution/2900-2999/2992.Number%20of%20Self-Divisible%20Permutations/README.md) diff --git a/solution/2900-2999/2993.Friday Purchases I/README.md b/solution/2900-2999/2993.Friday Purchases I/README.md index 67137c8f6f548..e2169747a5639 100644 --- a/solution/2900-2999/2993.Friday Purchases I/README.md +++ b/solution/2900-2999/2993.Friday Purchases I/README.md @@ -1,4 +1,4 @@ -# [2993. 发生在周五的交易 I](https://leetcode.cn/problems/friday-purchases-i) +# [2993. 发生在周五的交易 I 🔒](https://leetcode.cn/problems/friday-purchases-i) [English Version](/solution/2900-2999/2993.Friday%20Purchases%20I/README_EN.md) diff --git a/solution/2900-2999/2993.Friday Purchases I/README_EN.md b/solution/2900-2999/2993.Friday Purchases I/README_EN.md index a448df7078808..d688e51bfe5db 100644 --- a/solution/2900-2999/2993.Friday Purchases I/README_EN.md +++ b/solution/2900-2999/2993.Friday Purchases I/README_EN.md @@ -1,4 +1,4 @@ -# [2993. Friday Purchases I](https://leetcode.com/problems/friday-purchases-i) +# [2993. Friday Purchases I 🔒](https://leetcode.com/problems/friday-purchases-i) [中文文档](/solution/2900-2999/2993.Friday%20Purchases%20I/README.md) diff --git a/solution/2900-2999/2994.Friday Purchases II/README.md b/solution/2900-2999/2994.Friday Purchases II/README.md index a5d57fa7435cf..028b109485268 100644 --- a/solution/2900-2999/2994.Friday Purchases II/README.md +++ b/solution/2900-2999/2994.Friday Purchases II/README.md @@ -1,4 +1,4 @@ -# [2994. 发生在周五的交易 II](https://leetcode.cn/problems/friday-purchases-ii) +# [2994. 发生在周五的交易 II 🔒](https://leetcode.cn/problems/friday-purchases-ii) [English Version](/solution/2900-2999/2994.Friday%20Purchases%20II/README_EN.md) diff --git a/solution/2900-2999/2994.Friday Purchases II/README_EN.md b/solution/2900-2999/2994.Friday Purchases II/README_EN.md index df49ea36ba581..117d036e9a82f 100644 --- a/solution/2900-2999/2994.Friday Purchases II/README_EN.md +++ b/solution/2900-2999/2994.Friday Purchases II/README_EN.md @@ -1,4 +1,4 @@ -# [2994. Friday Purchases II](https://leetcode.com/problems/friday-purchases-ii) +# [2994. Friday Purchases II 🔒](https://leetcode.com/problems/friday-purchases-ii) [中文文档](/solution/2900-2999/2994.Friday%20Purchases%20II/README.md) diff --git a/solution/2900-2999/2995.Viewers Turned Streamers/README.md b/solution/2900-2999/2995.Viewers Turned Streamers/README.md index f1f3cb4873489..d21fbadcbb367 100644 --- a/solution/2900-2999/2995.Viewers Turned Streamers/README.md +++ b/solution/2900-2999/2995.Viewers Turned Streamers/README.md @@ -1,4 +1,4 @@ -# [2995. 观众变主播](https://leetcode.cn/problems/viewers-turned-streamers) +# [2995. 观众变主播 🔒](https://leetcode.cn/problems/viewers-turned-streamers) [English Version](/solution/2900-2999/2995.Viewers%20Turned%20Streamers/README_EN.md) diff --git a/solution/2900-2999/2995.Viewers Turned Streamers/README_EN.md b/solution/2900-2999/2995.Viewers Turned Streamers/README_EN.md index 4abbed5e8a06d..1a617249070ea 100644 --- a/solution/2900-2999/2995.Viewers Turned Streamers/README_EN.md +++ b/solution/2900-2999/2995.Viewers Turned Streamers/README_EN.md @@ -1,4 +1,4 @@ -# [2995. Viewers Turned Streamers](https://leetcode.com/problems/viewers-turned-streamers) +# [2995. Viewers Turned Streamers 🔒](https://leetcode.com/problems/viewers-turned-streamers) [中文文档](/solution/2900-2999/2995.Viewers%20Turned%20Streamers/README.md) diff --git a/solution/3000-3099/3004.Maximum Subtree of the Same Color/README.md b/solution/3000-3099/3004.Maximum Subtree of the Same Color/README.md index 058a32324723b..dceb619ece936 100644 --- a/solution/3000-3099/3004.Maximum Subtree of the Same Color/README.md +++ b/solution/3000-3099/3004.Maximum Subtree of the Same Color/README.md @@ -1,4 +1,4 @@ -# [3004. 相同颜色的最大子树](https://leetcode.cn/problems/maximum-subtree-of-the-same-color) +# [3004. 相同颜色的最大子树 🔒](https://leetcode.cn/problems/maximum-subtree-of-the-same-color) [English Version](/solution/3000-3099/3004.Maximum%20Subtree%20of%20the%20Same%20Color/README_EN.md) diff --git a/solution/3000-3099/3004.Maximum Subtree of the Same Color/README_EN.md b/solution/3000-3099/3004.Maximum Subtree of the Same Color/README_EN.md index 725b7b004fa53..51c91184817b3 100644 --- a/solution/3000-3099/3004.Maximum Subtree of the Same Color/README_EN.md +++ b/solution/3000-3099/3004.Maximum Subtree of the Same Color/README_EN.md @@ -1,4 +1,4 @@ -# [3004. Maximum Subtree of the Same Color](https://leetcode.com/problems/maximum-subtree-of-the-same-color) +# [3004. Maximum Subtree of the Same Color 🔒](https://leetcode.com/problems/maximum-subtree-of-the-same-color) [中文文档](/solution/3000-3099/3004.Maximum%20Subtree%20of%20the%20Same%20Color/README.md) diff --git a/solution/3000-3099/3009.Maximum Number of Intersections on the Chart/README.md b/solution/3000-3099/3009.Maximum Number of Intersections on the Chart/README.md index 68f4a99089f85..822708ebe087e 100644 --- a/solution/3000-3099/3009.Maximum Number of Intersections on the Chart/README.md +++ b/solution/3000-3099/3009.Maximum Number of Intersections on the Chart/README.md @@ -1,4 +1,4 @@ -# [3009. 折线图上的最大交点数量](https://leetcode.cn/problems/maximum-number-of-intersections-on-the-chart) +# [3009. 折线图上的最大交点数量 🔒](https://leetcode.cn/problems/maximum-number-of-intersections-on-the-chart) [English Version](/solution/3000-3099/3009.Maximum%20Number%20of%20Intersections%20on%20the%20Chart/README_EN.md) diff --git a/solution/3000-3099/3009.Maximum Number of Intersections on the Chart/README_EN.md b/solution/3000-3099/3009.Maximum Number of Intersections on the Chart/README_EN.md index df5466964ed67..011f03ef28324 100644 --- a/solution/3000-3099/3009.Maximum Number of Intersections on the Chart/README_EN.md +++ b/solution/3000-3099/3009.Maximum Number of Intersections on the Chart/README_EN.md @@ -1,4 +1,4 @@ -# [3009. Maximum Number of Intersections on the Chart](https://leetcode.com/problems/maximum-number-of-intersections-on-the-chart) +# [3009. Maximum Number of Intersections on the Chart 🔒](https://leetcode.com/problems/maximum-number-of-intersections-on-the-chart) [中文文档](/solution/3000-3099/3009.Maximum%20Number%20of%20Intersections%20on%20the%20Chart/README.md) diff --git a/solution/3000-3099/3018.Maximum Number of Removal Queries That Can Be Processed I/README.md b/solution/3000-3099/3018.Maximum Number of Removal Queries That Can Be Processed I/README.md index fb41539e687c3..3c1ccf4d2b244 100644 --- a/solution/3000-3099/3018.Maximum Number of Removal Queries That Can Be Processed I/README.md +++ b/solution/3000-3099/3018.Maximum Number of Removal Queries That Can Be Processed I/README.md @@ -1,4 +1,4 @@ -# [3018. 可处理的最大删除操作数 I](https://leetcode.cn/problems/maximum-number-of-removal-queries-that-can-be-processed-i) +# [3018. 可处理的最大删除操作数 I 🔒](https://leetcode.cn/problems/maximum-number-of-removal-queries-that-can-be-processed-i) [English Version](/solution/3000-3099/3018.Maximum%20Number%20of%20Removal%20Queries%20That%20Can%20Be%20Processed%20I/README_EN.md) diff --git a/solution/3000-3099/3018.Maximum Number of Removal Queries That Can Be Processed I/README_EN.md b/solution/3000-3099/3018.Maximum Number of Removal Queries That Can Be Processed I/README_EN.md index 3b75e11d01f6f..ab334f58b58ac 100644 --- a/solution/3000-3099/3018.Maximum Number of Removal Queries That Can Be Processed I/README_EN.md +++ b/solution/3000-3099/3018.Maximum Number of Removal Queries That Can Be Processed I/README_EN.md @@ -1,4 +1,4 @@ -# [3018. Maximum Number of Removal Queries That Can Be Processed I](https://leetcode.com/problems/maximum-number-of-removal-queries-that-can-be-processed-i) +# [3018. Maximum Number of Removal Queries That Can Be Processed I 🔒](https://leetcode.com/problems/maximum-number-of-removal-queries-that-can-be-processed-i) [中文文档](/solution/3000-3099/3018.Maximum%20Number%20of%20Removal%20Queries%20That%20Can%20Be%20Processed%20I/README.md) diff --git a/solution/3000-3099/3023.Find Pattern in Infinite Stream I/README.md b/solution/3000-3099/3023.Find Pattern in Infinite Stream I/README.md index 692dd599fc03a..e52b34dda9f48 100644 --- a/solution/3000-3099/3023.Find Pattern in Infinite Stream I/README.md +++ b/solution/3000-3099/3023.Find Pattern in Infinite Stream I/README.md @@ -1,4 +1,4 @@ -# [3023. 在无限流中寻找模式 I](https://leetcode.cn/problems/find-pattern-in-infinite-stream-i) +# [3023. 在无限流中寻找模式 I 🔒](https://leetcode.cn/problems/find-pattern-in-infinite-stream-i) [English Version](/solution/3000-3099/3023.Find%20Pattern%20in%20Infinite%20Stream%20I/README_EN.md) diff --git a/solution/3000-3099/3023.Find Pattern in Infinite Stream I/README_EN.md b/solution/3000-3099/3023.Find Pattern in Infinite Stream I/README_EN.md index 572f8cc17c70a..479b52709fba3 100644 --- a/solution/3000-3099/3023.Find Pattern in Infinite Stream I/README_EN.md +++ b/solution/3000-3099/3023.Find Pattern in Infinite Stream I/README_EN.md @@ -1,4 +1,4 @@ -# [3023. Find Pattern in Infinite Stream I](https://leetcode.com/problems/find-pattern-in-infinite-stream-i) +# [3023. Find Pattern in Infinite Stream I 🔒](https://leetcode.com/problems/find-pattern-in-infinite-stream-i) [中文文档](/solution/3000-3099/3023.Find%20Pattern%20in%20Infinite%20Stream%20I/README.md) diff --git a/solution/3000-3099/3032.Count Numbers With Unique Digits II/README.md b/solution/3000-3099/3032.Count Numbers With Unique Digits II/README.md index d80baf520bed7..ebe243861fbcb 100644 --- a/solution/3000-3099/3032.Count Numbers With Unique Digits II/README.md +++ b/solution/3000-3099/3032.Count Numbers With Unique Digits II/README.md @@ -1,4 +1,4 @@ -# [3032. 统计各位数字都不同的数字个数 II](https://leetcode.cn/problems/count-numbers-with-unique-digits-ii) +# [3032. 统计各位数字都不同的数字个数 II 🔒](https://leetcode.cn/problems/count-numbers-with-unique-digits-ii) [English Version](/solution/3000-3099/3032.Count%20Numbers%20With%20Unique%20Digits%20II/README_EN.md) diff --git a/solution/3000-3099/3032.Count Numbers With Unique Digits II/README_EN.md b/solution/3000-3099/3032.Count Numbers With Unique Digits II/README_EN.md index c8f24e63c3b49..232678c2e3765 100644 --- a/solution/3000-3099/3032.Count Numbers With Unique Digits II/README_EN.md +++ b/solution/3000-3099/3032.Count Numbers With Unique Digits II/README_EN.md @@ -1,4 +1,4 @@ -# [3032. Count Numbers With Unique Digits II](https://leetcode.com/problems/count-numbers-with-unique-digits-ii) +# [3032. Count Numbers With Unique Digits II 🔒](https://leetcode.com/problems/count-numbers-with-unique-digits-ii) [中文文档](/solution/3000-3099/3032.Count%20Numbers%20With%20Unique%20Digits%20II/README.md) diff --git a/solution/3000-3099/3037.Find Pattern in Infinite Stream II/README.md b/solution/3000-3099/3037.Find Pattern in Infinite Stream II/README.md index e62915c5f966e..384c06f041a36 100644 --- a/solution/3000-3099/3037.Find Pattern in Infinite Stream II/README.md +++ b/solution/3000-3099/3037.Find Pattern in Infinite Stream II/README.md @@ -1,4 +1,4 @@ -# [3037. 在无限流中寻找模式 II](https://leetcode.cn/problems/find-pattern-in-infinite-stream-ii) +# [3037. 在无限流中寻找模式 II 🔒](https://leetcode.cn/problems/find-pattern-in-infinite-stream-ii) [English Version](/solution/3000-3099/3037.Find%20Pattern%20in%20Infinite%20Stream%20II/README_EN.md) diff --git a/solution/3000-3099/3037.Find Pattern in Infinite Stream II/README_EN.md b/solution/3000-3099/3037.Find Pattern in Infinite Stream II/README_EN.md index b0e307c0f16cc..62c6e2fbd65a2 100644 --- a/solution/3000-3099/3037.Find Pattern in Infinite Stream II/README_EN.md +++ b/solution/3000-3099/3037.Find Pattern in Infinite Stream II/README_EN.md @@ -1,4 +1,4 @@ -# [3037. Find Pattern in Infinite Stream II](https://leetcode.com/problems/find-pattern-in-infinite-stream-ii) +# [3037. Find Pattern in Infinite Stream II 🔒](https://leetcode.com/problems/find-pattern-in-infinite-stream-ii) [中文文档](/solution/3000-3099/3037.Find%20Pattern%20in%20Infinite%20Stream%20II/README.md) diff --git a/solution/3000-3099/3050.Pizza Toppings Cost Analysis/README.md b/solution/3000-3099/3050.Pizza Toppings Cost Analysis/README.md index fcfb87be16767..c2ace67cab749 100644 --- a/solution/3000-3099/3050.Pizza Toppings Cost Analysis/README.md +++ b/solution/3000-3099/3050.Pizza Toppings Cost Analysis/README.md @@ -1,4 +1,4 @@ -# [3050. 披萨配料成本分析](https://leetcode.cn/problems/pizza-toppings-cost-analysis) +# [3050. 披萨配料成本分析 🔒](https://leetcode.cn/problems/pizza-toppings-cost-analysis) [English Version](/solution/3000-3099/3050.Pizza%20Toppings%20Cost%20Analysis/README_EN.md) diff --git a/solution/3000-3099/3050.Pizza Toppings Cost Analysis/README_EN.md b/solution/3000-3099/3050.Pizza Toppings Cost Analysis/README_EN.md index edd328116738e..76985506a88b7 100644 --- a/solution/3000-3099/3050.Pizza Toppings Cost Analysis/README_EN.md +++ b/solution/3000-3099/3050.Pizza Toppings Cost Analysis/README_EN.md @@ -1,4 +1,4 @@ -# [3050. Pizza Toppings Cost Analysis](https://leetcode.com/problems/pizza-toppings-cost-analysis) +# [3050. Pizza Toppings Cost Analysis 🔒](https://leetcode.com/problems/pizza-toppings-cost-analysis) [中文文档](/solution/3000-3099/3050.Pizza%20Toppings%20Cost%20Analysis/README.md) diff --git a/solution/3000-3099/3051.Find Candidates for Data Scientist Position/README.md b/solution/3000-3099/3051.Find Candidates for Data Scientist Position/README.md index dbca237799734..ac19d2f454b51 100644 --- a/solution/3000-3099/3051.Find Candidates for Data Scientist Position/README.md +++ b/solution/3000-3099/3051.Find Candidates for Data Scientist Position/README.md @@ -1,4 +1,4 @@ -# [3051. 寻找数据科学家职位的候选人](https://leetcode.cn/problems/find-candidates-for-data-scientist-position) +# [3051. 寻找数据科学家职位的候选人 🔒](https://leetcode.cn/problems/find-candidates-for-data-scientist-position) [English Version](/solution/3000-3099/3051.Find%20Candidates%20for%20Data%20Scientist%20Position/README_EN.md) diff --git a/solution/3000-3099/3051.Find Candidates for Data Scientist Position/README_EN.md b/solution/3000-3099/3051.Find Candidates for Data Scientist Position/README_EN.md index ffb510208b748..e5d74342b07f0 100644 --- a/solution/3000-3099/3051.Find Candidates for Data Scientist Position/README_EN.md +++ b/solution/3000-3099/3051.Find Candidates for Data Scientist Position/README_EN.md @@ -1,4 +1,4 @@ -# [3051. Find Candidates for Data Scientist Position](https://leetcode.com/problems/find-candidates-for-data-scientist-position) +# [3051. Find Candidates for Data Scientist Position 🔒](https://leetcode.com/problems/find-candidates-for-data-scientist-position) [中文文档](/solution/3000-3099/3051.Find%20Candidates%20for%20Data%20Scientist%20Position/README.md) diff --git a/solution/3000-3099/3052.Maximize Items/README.md b/solution/3000-3099/3052.Maximize Items/README.md index 1ffecac6ecc6d..0ec1cb759ff1b 100644 --- a/solution/3000-3099/3052.Maximize Items/README.md +++ b/solution/3000-3099/3052.Maximize Items/README.md @@ -1,4 +1,4 @@ -# [3052. 最大化商品](https://leetcode.cn/problems/maximize-items) +# [3052. 最大化商品 🔒](https://leetcode.cn/problems/maximize-items) [English Version](/solution/3000-3099/3052.Maximize%20Items/README_EN.md) diff --git a/solution/3000-3099/3052.Maximize Items/README_EN.md b/solution/3000-3099/3052.Maximize Items/README_EN.md index 1bcf7a3ad0769..ce04c794df2cf 100644 --- a/solution/3000-3099/3052.Maximize Items/README_EN.md +++ b/solution/3000-3099/3052.Maximize Items/README_EN.md @@ -1,4 +1,4 @@ -# [3052. Maximize Items](https://leetcode.com/problems/maximize-items) +# [3052. Maximize Items 🔒](https://leetcode.com/problems/maximize-items) [中文文档](/solution/3000-3099/3052.Maximize%20Items/README.md) diff --git a/solution/3000-3099/3053.Classifying Triangles by Lengths/README.md b/solution/3000-3099/3053.Classifying Triangles by Lengths/README.md index 3a41eccb971ad..2013abfc3f83f 100644 --- a/solution/3000-3099/3053.Classifying Triangles by Lengths/README.md +++ b/solution/3000-3099/3053.Classifying Triangles by Lengths/README.md @@ -1,4 +1,4 @@ -# [3053. 根据长度分类三角形](https://leetcode.cn/problems/classifying-triangles-by-lengths) +# [3053. 根据长度分类三角形 🔒](https://leetcode.cn/problems/classifying-triangles-by-lengths) [English Version](/solution/3000-3099/3053.Classifying%20Triangles%20by%20Lengths/README_EN.md) diff --git a/solution/3000-3099/3053.Classifying Triangles by Lengths/README_EN.md b/solution/3000-3099/3053.Classifying Triangles by Lengths/README_EN.md index aa1bf6ca41291..b27a0c6a8d7c4 100644 --- a/solution/3000-3099/3053.Classifying Triangles by Lengths/README_EN.md +++ b/solution/3000-3099/3053.Classifying Triangles by Lengths/README_EN.md @@ -1,4 +1,4 @@ -# [3053. Classifying Triangles by Lengths](https://leetcode.com/problems/classifying-triangles-by-lengths) +# [3053. Classifying Triangles by Lengths 🔒](https://leetcode.com/problems/classifying-triangles-by-lengths) [中文文档](/solution/3000-3099/3053.Classifying%20Triangles%20by%20Lengths/README.md) diff --git a/solution/3000-3099/3054.Binary Tree Nodes/README.md b/solution/3000-3099/3054.Binary Tree Nodes/README.md index 8e532773c4b6d..29bde0f95a641 100644 --- a/solution/3000-3099/3054.Binary Tree Nodes/README.md +++ b/solution/3000-3099/3054.Binary Tree Nodes/README.md @@ -1,4 +1,4 @@ -# [3054. 二叉树节点](https://leetcode.cn/problems/binary-tree-nodes) +# [3054. 二叉树节点 🔒](https://leetcode.cn/problems/binary-tree-nodes) [English Version](/solution/3000-3099/3054.Binary%20Tree%20Nodes/README_EN.md) diff --git a/solution/3000-3099/3054.Binary Tree Nodes/README_EN.md b/solution/3000-3099/3054.Binary Tree Nodes/README_EN.md index 552163342a894..b9809a457b862 100644 --- a/solution/3000-3099/3054.Binary Tree Nodes/README_EN.md +++ b/solution/3000-3099/3054.Binary Tree Nodes/README_EN.md @@ -1,4 +1,4 @@ -# [3054. Binary Tree Nodes](https://leetcode.com/problems/binary-tree-nodes) +# [3054. Binary Tree Nodes 🔒](https://leetcode.com/problems/binary-tree-nodes) [中文文档](/solution/3000-3099/3054.Binary%20Tree%20Nodes/README.md) diff --git a/solution/3000-3099/3055.Top Percentile Fraud/README.md b/solution/3000-3099/3055.Top Percentile Fraud/README.md index 20f70ecbaca5e..04e6837e5e161 100644 --- a/solution/3000-3099/3055.Top Percentile Fraud/README.md +++ b/solution/3000-3099/3055.Top Percentile Fraud/README.md @@ -1,4 +1,4 @@ -# [3055. 最高欺诈百分位数](https://leetcode.cn/problems/top-percentile-fraud) +# [3055. 最高欺诈百分位数 🔒](https://leetcode.cn/problems/top-percentile-fraud) [English Version](/solution/3000-3099/3055.Top%20Percentile%20Fraud/README_EN.md) diff --git a/solution/3000-3099/3055.Top Percentile Fraud/README_EN.md b/solution/3000-3099/3055.Top Percentile Fraud/README_EN.md index 7b21d36ace387..c1879610eb015 100644 --- a/solution/3000-3099/3055.Top Percentile Fraud/README_EN.md +++ b/solution/3000-3099/3055.Top Percentile Fraud/README_EN.md @@ -1,4 +1,4 @@ -# [3055. Top Percentile Fraud](https://leetcode.com/problems/top-percentile-fraud) +# [3055. Top Percentile Fraud 🔒](https://leetcode.com/problems/top-percentile-fraud) [中文文档](/solution/3000-3099/3055.Top%20Percentile%20Fraud/README.md) diff --git a/solution/3000-3099/3056.Snaps Analysis/README.md b/solution/3000-3099/3056.Snaps Analysis/README.md index 7435fa1e134d9..7d670e9930a5a 100644 --- a/solution/3000-3099/3056.Snaps Analysis/README.md +++ b/solution/3000-3099/3056.Snaps Analysis/README.md @@ -1,4 +1,4 @@ -# [3056. 快照分析](https://leetcode.cn/problems/snaps-analysis) +# [3056. 快照分析 🔒](https://leetcode.cn/problems/snaps-analysis) [English Version](/solution/3000-3099/3056.Snaps%20Analysis/README_EN.md) diff --git a/solution/3000-3099/3056.Snaps Analysis/README_EN.md b/solution/3000-3099/3056.Snaps Analysis/README_EN.md index 01147487febb4..0735dec116d8f 100644 --- a/solution/3000-3099/3056.Snaps Analysis/README_EN.md +++ b/solution/3000-3099/3056.Snaps Analysis/README_EN.md @@ -1,4 +1,4 @@ -# [3056. Snaps Analysis](https://leetcode.com/problems/snaps-analysis) +# [3056. Snaps Analysis 🔒](https://leetcode.com/problems/snaps-analysis) [中文文档](/solution/3000-3099/3056.Snaps%20Analysis/README.md) diff --git a/solution/3000-3099/3057.Employees Project Allocation/README.md b/solution/3000-3099/3057.Employees Project Allocation/README.md index bf1235e778f9e..c4be391aa0b26 100644 --- a/solution/3000-3099/3057.Employees Project Allocation/README.md +++ b/solution/3000-3099/3057.Employees Project Allocation/README.md @@ -1,4 +1,4 @@ -# [3057. 员工项目分配](https://leetcode.cn/problems/employees-project-allocation) +# [3057. 员工项目分配 🔒](https://leetcode.cn/problems/employees-project-allocation) [English Version](/solution/3000-3099/3057.Employees%20Project%20Allocation/README_EN.md) diff --git a/solution/3000-3099/3057.Employees Project Allocation/README_EN.md b/solution/3000-3099/3057.Employees Project Allocation/README_EN.md index 82289eead9301..353a34ce36f62 100644 --- a/solution/3000-3099/3057.Employees Project Allocation/README_EN.md +++ b/solution/3000-3099/3057.Employees Project Allocation/README_EN.md @@ -1,4 +1,4 @@ -# [3057. Employees Project Allocation](https://leetcode.com/problems/employees-project-allocation) +# [3057. Employees Project Allocation 🔒](https://leetcode.com/problems/employees-project-allocation) [中文文档](/solution/3000-3099/3057.Employees%20Project%20Allocation/README.md) diff --git a/solution/3000-3099/3058.Friends With No Mutual Friends/README.md b/solution/3000-3099/3058.Friends With No Mutual Friends/README.md index 5eeb1fa28571f..338173e484c61 100644 --- a/solution/3000-3099/3058.Friends With No Mutual Friends/README.md +++ b/solution/3000-3099/3058.Friends With No Mutual Friends/README.md @@ -1,4 +1,4 @@ -# [3058. 没有共同朋友的朋友](https://leetcode.cn/problems/friends-with-no-mutual-friends) +# [3058. 没有共同朋友的朋友 🔒](https://leetcode.cn/problems/friends-with-no-mutual-friends) [English Version](/solution/3000-3099/3058.Friends%20With%20No%20Mutual%20Friends/README_EN.md) @@ -65,9 +65,9 @@ Friends 表： ### 方法一：子查询 -我们先把所有的朋友关系都列出来，记录在 `T` 表中。然后再找出 没有共同朋友的朋友对。 +我们先把所有的朋友关系都列出来，记录在 `T` 表中。然后再找出 没有共同朋友的朋友 🔒 对。 -接下来，我们可以使用子查询来找出没有共同朋友的朋友对，即这个朋友对不属于其他某个人的朋友。 +接下来，我们可以使用子查询来找出没有共同朋友的朋友 🔒 对，即这个朋友对不属于其他某个人的朋友。 diff --git a/solution/3000-3099/3058.Friends With No Mutual Friends/README_EN.md b/solution/3000-3099/3058.Friends With No Mutual Friends/README_EN.md index 0b124570ac7e2..cf443702e8ac3 100644 --- a/solution/3000-3099/3058.Friends With No Mutual Friends/README_EN.md +++ b/solution/3000-3099/3058.Friends With No Mutual Friends/README_EN.md @@ -1,4 +1,4 @@ -# [3058. Friends With No Mutual Friends](https://leetcode.com/problems/friends-with-no-mutual-friends) +# [3058. Friends With No Mutual Friends 🔒](https://leetcode.com/problems/friends-with-no-mutual-friends) [中文文档](/solution/3000-3099/3058.Friends%20With%20No%20Mutual%20Friends/README.md) diff --git a/solution/3000-3099/3059.Find All Unique Email Domains/README.md b/solution/3000-3099/3059.Find All Unique Email Domains/README.md index 122857828723e..666dd2215d068 100644 --- a/solution/3000-3099/3059.Find All Unique Email Domains/README.md +++ b/solution/3000-3099/3059.Find All Unique Email Domains/README.md @@ -1,4 +1,4 @@ -# [3059. 找到所有不同的邮件域名](https://leetcode.cn/problems/find-all-unique-email-domains) +# [3059. 找到所有不同的邮件域名 🔒](https://leetcode.cn/problems/find-all-unique-email-domains) [English Version](/solution/3000-3099/3059.Find%20All%20Unique%20Email%20Domains/README_EN.md) diff --git a/solution/3000-3099/3059.Find All Unique Email Domains/README_EN.md b/solution/3000-3099/3059.Find All Unique Email Domains/README_EN.md index 056c6f6b5db80..cbb2878ed232d 100644 --- a/solution/3000-3099/3059.Find All Unique Email Domains/README_EN.md +++ b/solution/3000-3099/3059.Find All Unique Email Domains/README_EN.md @@ -1,4 +1,4 @@ -# [3059. Find All Unique Email Domains](https://leetcode.com/problems/find-all-unique-email-domains) +# [3059. Find All Unique Email Domains 🔒](https://leetcode.com/problems/find-all-unique-email-domains) [中文文档](/solution/3000-3099/3059.Find%20All%20Unique%20Email%20Domains/README.md) diff --git a/solution/3000-3099/3060.User Activities within Time Bounds/README.md b/solution/3000-3099/3060.User Activities within Time Bounds/README.md index fed2f289a9d58..3010f75cbf8e2 100644 --- a/solution/3000-3099/3060.User Activities within Time Bounds/README.md +++ b/solution/3000-3099/3060.User Activities within Time Bounds/README.md @@ -1,4 +1,4 @@ -# [3060. 时间范围内的用户活动](https://leetcode.cn/problems/user-activities-within-time-bounds) +# [3060. 时间范围内的用户活动 🔒](https://leetcode.cn/problems/user-activities-within-time-bounds) [English Version](/solution/3000-3099/3060.User%20Activities%20within%20Time%20Bounds/README_EN.md) diff --git a/solution/3000-3099/3060.User Activities within Time Bounds/README_EN.md b/solution/3000-3099/3060.User Activities within Time Bounds/README_EN.md index ac9a5808467fa..ed9c6b04cec73 100644 --- a/solution/3000-3099/3060.User Activities within Time Bounds/README_EN.md +++ b/solution/3000-3099/3060.User Activities within Time Bounds/README_EN.md @@ -1,4 +1,4 @@ -# [3060. User Activities within Time Bounds](https://leetcode.com/problems/user-activities-within-time-bounds) +# [3060. User Activities within Time Bounds 🔒](https://leetcode.com/problems/user-activities-within-time-bounds) [中文文档](/solution/3000-3099/3060.User%20Activities%20within%20Time%20Bounds/README.md) diff --git a/solution/3000-3099/3061.Calculate Trapping Rain Water/README.md b/solution/3000-3099/3061.Calculate Trapping Rain Water/README.md index 6cd7dc16b9480..16648cb44cb65 100644 --- a/solution/3000-3099/3061.Calculate Trapping Rain Water/README.md +++ b/solution/3000-3099/3061.Calculate Trapping Rain Water/README.md @@ -1,4 +1,4 @@ -# [3061. 计算滞留雨水](https://leetcode.cn/problems/calculate-trapping-rain-water) +# [3061. 计算滞留雨水 🔒](https://leetcode.cn/problems/calculate-trapping-rain-water) [English Version](/solution/3000-3099/3061.Calculate%20Trapping%20Rain%20Water/README_EN.md) diff --git a/solution/3000-3099/3061.Calculate Trapping Rain Water/README_EN.md b/solution/3000-3099/3061.Calculate Trapping Rain Water/README_EN.md index c2674e43976ff..3b7b2b1281cb7 100644 --- a/solution/3000-3099/3061.Calculate Trapping Rain Water/README_EN.md +++ b/solution/3000-3099/3061.Calculate Trapping Rain Water/README_EN.md @@ -1,4 +1,4 @@ -# [3061. Calculate Trapping Rain Water](https://leetcode.com/problems/calculate-trapping-rain-water) +# [3061. Calculate Trapping Rain Water 🔒](https://leetcode.com/problems/calculate-trapping-rain-water) [中文文档](/solution/3000-3099/3061.Calculate%20Trapping%20Rain%20Water/README.md) diff --git a/solution/3000-3099/3062.Winner of the Linked List Game/README.md b/solution/3000-3099/3062.Winner of the Linked List Game/README.md index 574ebe63f216b..a858a3736ef16 100644 --- a/solution/3000-3099/3062.Winner of the Linked List Game/README.md +++ b/solution/3000-3099/3062.Winner of the Linked List Game/README.md @@ -1,4 +1,4 @@ -# [3062. 链表游戏的获胜者](https://leetcode.cn/problems/winner-of-the-linked-list-game) +# [3062. 链表游戏的获胜者 🔒](https://leetcode.cn/problems/winner-of-the-linked-list-game) [English Version](/solution/3000-3099/3062.Winner%20of%20the%20Linked%20List%20Game/README_EN.md) diff --git a/solution/3000-3099/3062.Winner of the Linked List Game/README_EN.md b/solution/3000-3099/3062.Winner of the Linked List Game/README_EN.md index 99ba7496a91f2..9b80972cd674f 100644 --- a/solution/3000-3099/3062.Winner of the Linked List Game/README_EN.md +++ b/solution/3000-3099/3062.Winner of the Linked List Game/README_EN.md @@ -1,4 +1,4 @@ -# [3062. Winner of the Linked List Game](https://leetcode.com/problems/winner-of-the-linked-list-game) +# [3062. Winner of the Linked List Game 🔒](https://leetcode.com/problems/winner-of-the-linked-list-game) [中文文档](/solution/3000-3099/3062.Winner%20of%20the%20Linked%20List%20Game/README.md) diff --git a/solution/3000-3099/3063.Linked List Frequency/README.md b/solution/3000-3099/3063.Linked List Frequency/README.md index e3ab5f0d82058..35152c555b200 100644 --- a/solution/3000-3099/3063.Linked List Frequency/README.md +++ b/solution/3000-3099/3063.Linked List Frequency/README.md @@ -1,4 +1,4 @@ -# [3063. 链表频率](https://leetcode.cn/problems/linked-list-frequency) +# [3063. 链表频率 🔒](https://leetcode.cn/problems/linked-list-frequency) [English Version](/solution/3000-3099/3063.Linked%20List%20Frequency/README_EN.md) diff --git a/solution/3000-3099/3063.Linked List Frequency/README_EN.md b/solution/3000-3099/3063.Linked List Frequency/README_EN.md index a86caf8527475..ab952d661b77a 100644 --- a/solution/3000-3099/3063.Linked List Frequency/README_EN.md +++ b/solution/3000-3099/3063.Linked List Frequency/README_EN.md @@ -1,4 +1,4 @@ -# [3063. Linked List Frequency](https://leetcode.com/problems/linked-list-frequency) +# [3063. Linked List Frequency 🔒](https://leetcode.com/problems/linked-list-frequency) [中文文档](/solution/3000-3099/3063.Linked%20List%20Frequency/README.md) diff --git a/solution/3000-3099/3064.Guess the Number Using Bitwise Questions I/README.md b/solution/3000-3099/3064.Guess the Number Using Bitwise Questions I/README.md index 547c25d9ced2f..9d2566df09d5a 100644 --- a/solution/3000-3099/3064.Guess the Number Using Bitwise Questions I/README.md +++ b/solution/3000-3099/3064.Guess the Number Using Bitwise Questions I/README.md @@ -1,4 +1,4 @@ -# [3064. 使用按位查询猜测数字 I](https://leetcode.cn/problems/guess-the-number-using-bitwise-questions-i) +# [3064. 使用按位查询猜测数字 I 🔒](https://leetcode.cn/problems/guess-the-number-using-bitwise-questions-i) [English Version](/solution/3000-3099/3064.Guess%20the%20Number%20Using%20Bitwise%20Questions%20I/README_EN.md) diff --git a/solution/3000-3099/3064.Guess the Number Using Bitwise Questions I/README_EN.md b/solution/3000-3099/3064.Guess the Number Using Bitwise Questions I/README_EN.md index ef493386d0b6e..37ff0581b3b84 100644 --- a/solution/3000-3099/3064.Guess the Number Using Bitwise Questions I/README_EN.md +++ b/solution/3000-3099/3064.Guess the Number Using Bitwise Questions I/README_EN.md @@ -1,4 +1,4 @@ -# [3064. Guess the Number Using Bitwise Questions I](https://leetcode.com/problems/guess-the-number-using-bitwise-questions-i) +# [3064. Guess the Number Using Bitwise Questions I 🔒](https://leetcode.com/problems/guess-the-number-using-bitwise-questions-i) [中文文档](/solution/3000-3099/3064.Guess%20the%20Number%20Using%20Bitwise%20Questions%20I/README.md) diff --git a/solution/3000-3099/3073.Maximum Increasing Triplet Value/README.md b/solution/3000-3099/3073.Maximum Increasing Triplet Value/README.md index 2b73016f6eb32..2fa450846bca9 100644 --- a/solution/3000-3099/3073.Maximum Increasing Triplet Value/README.md +++ b/solution/3000-3099/3073.Maximum Increasing Triplet Value/README.md @@ -1,4 +1,4 @@ -# [3073. 最大递增三元组](https://leetcode.cn/problems/maximum-increasing-triplet-value) +# [3073. 最大递增三元组 🔒](https://leetcode.cn/problems/maximum-increasing-triplet-value) [English Version](/solution/3000-3099/3073.Maximum%20Increasing%20Triplet%20Value/README_EN.md) diff --git a/solution/3000-3099/3073.Maximum Increasing Triplet Value/README_EN.md b/solution/3000-3099/3073.Maximum Increasing Triplet Value/README_EN.md index 91a146d4430c1..833c9012787b8 100644 --- a/solution/3000-3099/3073.Maximum Increasing Triplet Value/README_EN.md +++ b/solution/3000-3099/3073.Maximum Increasing Triplet Value/README_EN.md @@ -1,4 +1,4 @@ -# [3073. Maximum Increasing Triplet Value](https://leetcode.com/problems/maximum-increasing-triplet-value) +# [3073. Maximum Increasing Triplet Value 🔒](https://leetcode.com/problems/maximum-increasing-triplet-value) [中文文档](/solution/3000-3099/3073.Maximum%20Increasing%20Triplet%20Value/README.md) diff --git a/solution/3000-3099/3078.Match Alphanumerical Pattern in Matrix I/README.md b/solution/3000-3099/3078.Match Alphanumerical Pattern in Matrix I/README.md index 7a287b3f090b8..ceebbb0b032cb 100644 --- a/solution/3000-3099/3078.Match Alphanumerical Pattern in Matrix I/README.md +++ b/solution/3000-3099/3078.Match Alphanumerical Pattern in Matrix I/README.md @@ -1,4 +1,4 @@ -# [3078. 矩阵中的字母数字模式匹配 I](https://leetcode.cn/problems/match-alphanumerical-pattern-in-matrix-i) +# [3078. 矩阵中的字母数字模式匹配 I 🔒](https://leetcode.cn/problems/match-alphanumerical-pattern-in-matrix-i) [English Version](/solution/3000-3099/3078.Match%20Alphanumerical%20Pattern%20in%20Matrix%20I/README_EN.md) diff --git a/solution/3000-3099/3078.Match Alphanumerical Pattern in Matrix I/README_EN.md b/solution/3000-3099/3078.Match Alphanumerical Pattern in Matrix I/README_EN.md index 97e67455bc123..22fb9788e0448 100644 --- a/solution/3000-3099/3078.Match Alphanumerical Pattern in Matrix I/README_EN.md +++ b/solution/3000-3099/3078.Match Alphanumerical Pattern in Matrix I/README_EN.md @@ -1,4 +1,4 @@ -# [3078. Match Alphanumerical Pattern in Matrix I](https://leetcode.com/problems/match-alphanumerical-pattern-in-matrix-i) +# [3078. Match Alphanumerical Pattern in Matrix I 🔒](https://leetcode.com/problems/match-alphanumerical-pattern-in-matrix-i) [中文文档](/solution/3000-3099/3078.Match%20Alphanumerical%20Pattern%20in%20Matrix%20I/README.md) diff --git a/solution/3000-3099/3087.Find Trending Hashtags/README.md b/solution/3000-3099/3087.Find Trending Hashtags/README.md index d850d8e12f8d7..d75e2501e386a 100644 --- a/solution/3000-3099/3087.Find Trending Hashtags/README.md +++ b/solution/3000-3099/3087.Find Trending Hashtags/README.md @@ -1,4 +1,4 @@ -# [3087. 查找热门话题标签](https://leetcode.cn/problems/find-trending-hashtags) +# [3087. 查找热门话题标签 🔒](https://leetcode.cn/problems/find-trending-hashtags) [English Version](/solution/3000-3099/3087.Find%20Trending%20Hashtags/README_EN.md) diff --git a/solution/3000-3099/3087.Find Trending Hashtags/README_EN.md b/solution/3000-3099/3087.Find Trending Hashtags/README_EN.md index 9b8f89650d262..9831dd4e7623d 100644 --- a/solution/3000-3099/3087.Find Trending Hashtags/README_EN.md +++ b/solution/3000-3099/3087.Find Trending Hashtags/README_EN.md @@ -1,4 +1,4 @@ -# [3087. Find Trending Hashtags](https://leetcode.com/problems/find-trending-hashtags) +# [3087. Find Trending Hashtags 🔒](https://leetcode.com/problems/find-trending-hashtags) [中文文档](/solution/3000-3099/3087.Find%20Trending%20Hashtags/README.md) diff --git a/solution/3000-3099/3088.Make String Anti-palindrome/README.md b/solution/3000-3099/3088.Make String Anti-palindrome/README.md index 534453d582054..9abaf631d663f 100644 --- a/solution/3000-3099/3088.Make String Anti-palindrome/README.md +++ b/solution/3000-3099/3088.Make String Anti-palindrome/README.md @@ -1,4 +1,4 @@ -# [3088. 使字符串反回文](https://leetcode.cn/problems/make-string-anti-palindrome) +# [3088. 使字符串反回文 🔒](https://leetcode.cn/problems/make-string-anti-palindrome) [English Version](/solution/3000-3099/3088.Make%20String%20Anti-palindrome/README_EN.md) diff --git a/solution/3000-3099/3088.Make String Anti-palindrome/README_EN.md b/solution/3000-3099/3088.Make String Anti-palindrome/README_EN.md index b8bbf6dbcde2d..2b3099eb84a9a 100644 --- a/solution/3000-3099/3088.Make String Anti-palindrome/README_EN.md +++ b/solution/3000-3099/3088.Make String Anti-palindrome/README_EN.md @@ -1,4 +1,4 @@ -# [3088. Make String Anti-palindrome](https://leetcode.com/problems/make-string-anti-palindrome) +# [3088. Make String Anti-palindrome 🔒](https://leetcode.com/problems/make-string-anti-palindrome) [中文文档](/solution/3000-3099/3088.Make%20String%20Anti-palindrome/README.md) diff --git a/solution/3000-3099/3089.Find Bursty Behavior/README.md b/solution/3000-3099/3089.Find Bursty Behavior/README.md index 84ffd679d3a4e..c4b244b888b31 100644 --- a/solution/3000-3099/3089.Find Bursty Behavior/README.md +++ b/solution/3000-3099/3089.Find Bursty Behavior/README.md @@ -1,4 +1,4 @@ -# [3089. 查找突发行为](https://leetcode.cn/problems/find-bursty-behavior) +# [3089. 查找突发行为 🔒](https://leetcode.cn/problems/find-bursty-behavior) [English Version](/solution/3000-3099/3089.Find%20Bursty%20Behavior/README_EN.md) diff --git a/solution/3000-3099/3089.Find Bursty Behavior/README_EN.md b/solution/3000-3099/3089.Find Bursty Behavior/README_EN.md index 62a39d30dd22a..cc38c3809efd5 100644 --- a/solution/3000-3099/3089.Find Bursty Behavior/README_EN.md +++ b/solution/3000-3099/3089.Find Bursty Behavior/README_EN.md @@ -1,4 +1,4 @@ -# [3089. Find Bursty Behavior](https://leetcode.com/problems/find-bursty-behavior) +# [3089. Find Bursty Behavior 🔒](https://leetcode.com/problems/find-bursty-behavior) [中文文档](/solution/3000-3099/3089.Find%20Bursty%20Behavior/README.md) diff --git a/solution/3000-3099/3094.Guess the Number Using Bitwise Questions II/README.md b/solution/3000-3099/3094.Guess the Number Using Bitwise Questions II/README.md index 6552560a06b1d..d8cc5796c9b3d 100644 --- a/solution/3000-3099/3094.Guess the Number Using Bitwise Questions II/README.md +++ b/solution/3000-3099/3094.Guess the Number Using Bitwise Questions II/README.md @@ -1,4 +1,4 @@ -# [3094. 使用按位查询猜测数字 II](https://leetcode.cn/problems/guess-the-number-using-bitwise-questions-ii) +# [3094. 使用按位查询猜测数字 II 🔒](https://leetcode.cn/problems/guess-the-number-using-bitwise-questions-ii) [English Version](/solution/3000-3099/3094.Guess%20the%20Number%20Using%20Bitwise%20Questions%20II/README_EN.md) diff --git a/solution/3000-3099/3094.Guess the Number Using Bitwise Questions II/README_EN.md b/solution/3000-3099/3094.Guess the Number Using Bitwise Questions II/README_EN.md index aa214c64a8404..03ad0c248d448 100644 --- a/solution/3000-3099/3094.Guess the Number Using Bitwise Questions II/README_EN.md +++ b/solution/3000-3099/3094.Guess the Number Using Bitwise Questions II/README_EN.md @@ -1,4 +1,4 @@ -# [3094. Guess the Number Using Bitwise Questions II](https://leetcode.com/problems/guess-the-number-using-bitwise-questions-ii) +# [3094. Guess the Number Using Bitwise Questions II 🔒](https://leetcode.com/problems/guess-the-number-using-bitwise-questions-ii) [中文文档](/solution/3000-3099/3094.Guess%20the%20Number%20Using%20Bitwise%20Questions%20II/README.md) diff --git a/solution/3100-3199/3103.Find Trending Hashtags II/README.md b/solution/3100-3199/3103.Find Trending Hashtags II/README.md index 4d5201ab08d3b..71d74e1de4ef7 100644 --- a/solution/3100-3199/3103.Find Trending Hashtags II/README.md +++ b/solution/3100-3199/3103.Find Trending Hashtags II/README.md @@ -1,4 +1,4 @@ -# [3103. 查找热门话题标签 II](https://leetcode.cn/problems/find-trending-hashtags-ii) +# [3103. 查找热门话题标签 II 🔒](https://leetcode.cn/problems/find-trending-hashtags-ii) [English Version](/solution/3100-3199/3103.Find%20Trending%20Hashtags%20II/README_EN.md) diff --git a/solution/3100-3199/3103.Find Trending Hashtags II/README_EN.md b/solution/3100-3199/3103.Find Trending Hashtags II/README_EN.md index 851a88a457a0a..b731feb562768 100644 --- a/solution/3100-3199/3103.Find Trending Hashtags II/README_EN.md +++ b/solution/3100-3199/3103.Find Trending Hashtags II/README_EN.md @@ -1,4 +1,4 @@ -# [3103. Find Trending Hashtags II](https://leetcode.com/problems/find-trending-hashtags-ii) +# [3103. Find Trending Hashtags II 🔒](https://leetcode.com/problems/find-trending-hashtags-ii) [中文文档](/solution/3100-3199/3103.Find%20Trending%20Hashtags%20II/README.md) diff --git a/solution/3100-3199/3104.Find Longest Self-Contained Substring/README.md b/solution/3100-3199/3104.Find Longest Self-Contained Substring/README.md index 460b52128452a..1f427e7a0a0ac 100644 --- a/solution/3100-3199/3104.Find Longest Self-Contained Substring/README.md +++ b/solution/3100-3199/3104.Find Longest Self-Contained Substring/README.md @@ -1,4 +1,4 @@ -# [3104. Find Longest Self-Contained Substring](https://leetcode.cn/problems/find-longest-self-contained-substring) +# [3104. Find Longest Self-Contained Substring 🔒](https://leetcode.cn/problems/find-longest-self-contained-substring) [English Version](/solution/3100-3199/3104.Find%20Longest%20Self-Contained%20Substring/README_EN.md) diff --git a/solution/3100-3199/3104.Find Longest Self-Contained Substring/README_EN.md b/solution/3100-3199/3104.Find Longest Self-Contained Substring/README_EN.md index 5d6d1fbcebee9..2a7b1d68f19f5 100644 --- a/solution/3100-3199/3104.Find Longest Self-Contained Substring/README_EN.md +++ b/solution/3100-3199/3104.Find Longest Self-Contained Substring/README_EN.md @@ -1,4 +1,4 @@ -# [3104. Find Longest Self-Contained Substring](https://leetcode.com/problems/find-longest-self-contained-substring) +# [3104. Find Longest Self-Contained Substring 🔒](https://leetcode.com/problems/find-longest-self-contained-substring) [中文文档](/solution/3100-3199/3104.Find%20Longest%20Self-Contained%20Substring/README.md) diff --git a/solution/3100-3199/3109.Find the Index of Permutation/README.md b/solution/3100-3199/3109.Find the Index of Permutation/README.md index f7cbbbcd0aeba..ea7eabae6ca05 100644 --- a/solution/3100-3199/3109.Find the Index of Permutation/README.md +++ b/solution/3100-3199/3109.Find the Index of Permutation/README.md @@ -1,4 +1,4 @@ -# [3109. Find the Index of Permutation](https://leetcode.cn/problems/find-the-index-of-permutation) +# [3109. Find the Index of Permutation 🔒](https://leetcode.cn/problems/find-the-index-of-permutation) [English Version](/solution/3100-3199/3109.Find%20the%20Index%20of%20Permutation/README_EN.md) diff --git a/solution/3100-3199/3109.Find the Index of Permutation/README_EN.md b/solution/3100-3199/3109.Find the Index of Permutation/README_EN.md index 78ec5ed36c33a..b62dffdd63510 100644 --- a/solution/3100-3199/3109.Find the Index of Permutation/README_EN.md +++ b/solution/3100-3199/3109.Find the Index of Permutation/README_EN.md @@ -1,4 +1,4 @@ -# [3109. Find the Index of Permutation](https://leetcode.com/problems/find-the-index-of-permutation) +# [3109. Find the Index of Permutation 🔒](https://leetcode.com/problems/find-the-index-of-permutation) [中文文档](/solution/3100-3199/3109.Find%20the%20Index%20of%20Permutation/README.md) diff --git a/solution/3100-3199/3118.Friday Purchase III/README.md b/solution/3100-3199/3118.Friday Purchase III/README.md index 01a727314d8d1..1e552e24b07ec 100644 --- a/solution/3100-3199/3118.Friday Purchase III/README.md +++ b/solution/3100-3199/3118.Friday Purchase III/README.md @@ -1,4 +1,4 @@ -# [3118. Friday Purchase III](https://leetcode.cn/problems/friday-purchase-iii) +# [3118. Friday Purchase III 🔒](https://leetcode.cn/problems/friday-purchase-iii) [English Version](/solution/3100-3199/3118.Friday%20Purchase%20III/README_EN.md) diff --git a/solution/3100-3199/3118.Friday Purchase III/README_EN.md b/solution/3100-3199/3118.Friday Purchase III/README_EN.md index a1f5db2033a61..5cdb28dfbb9a0 100644 --- a/solution/3100-3199/3118.Friday Purchase III/README_EN.md +++ b/solution/3100-3199/3118.Friday Purchase III/README_EN.md @@ -1,4 +1,4 @@ -# [3118. Friday Purchase III](https://leetcode.com/problems/friday-purchase-iii) +# [3118. Friday Purchase III 🔒](https://leetcode.com/problems/friday-purchase-iii) [中文文档](/solution/3100-3199/3118.Friday%20Purchase%20III/README.md) diff --git a/solution/3100-3199/3119.Maximum Number of Potholes That Can Be Fixed/README.md b/solution/3100-3199/3119.Maximum Number of Potholes That Can Be Fixed/README.md index 9f54ed845cab3..980fa3b136792 100644 --- a/solution/3100-3199/3119.Maximum Number of Potholes That Can Be Fixed/README.md +++ b/solution/3100-3199/3119.Maximum Number of Potholes That Can Be Fixed/README.md @@ -1,4 +1,4 @@ -# [3119. Maximum Number of Potholes That Can Be Fixed](https://leetcode.cn/problems/maximum-number-of-potholes-that-can-be-fixed) +# [3119. Maximum Number of Potholes That Can Be Fixed 🔒](https://leetcode.cn/problems/maximum-number-of-potholes-that-can-be-fixed) [English Version](/solution/3100-3199/3119.Maximum%20Number%20of%20Potholes%20That%20Can%20Be%20Fixed/README_EN.md) diff --git a/solution/3100-3199/3119.Maximum Number of Potholes That Can Be Fixed/README_EN.md b/solution/3100-3199/3119.Maximum Number of Potholes That Can Be Fixed/README_EN.md index a03ffd446acc7..16a5a6526d284 100644 --- a/solution/3100-3199/3119.Maximum Number of Potholes That Can Be Fixed/README_EN.md +++ b/solution/3100-3199/3119.Maximum Number of Potholes That Can Be Fixed/README_EN.md @@ -1,4 +1,4 @@ -# [3119. Maximum Number of Potholes That Can Be Fixed](https://leetcode.com/problems/maximum-number-of-potholes-that-can-be-fixed) +# [3119. Maximum Number of Potholes That Can Be Fixed 🔒](https://leetcode.com/problems/maximum-number-of-potholes-that-can-be-fixed) [中文文档](/solution/3100-3199/3119.Maximum%20Number%20of%20Potholes%20That%20Can%20Be%20Fixed/README.md) diff --git a/solution/util.py b/solution/util.py index 95335e82fa8bf..d245fa4a88bc2 100644 --- a/solution/util.py +++ b/solution/util.py @@ -150,13 +150,14 @@ def generate_question_readme(result): # choose the readme template category = item["category"] readme_template_cn, readme_template_en = select_templates(category) + paid_only = ' 🔒' if item['paid_only'] else '' # generate lc-cn problem readme with open(f"{path}/README.md", "w", encoding="utf-8") as f1: f1.write( readme_template_cn.format( int(item["frontend_question_id"]), - item["title_cn"], + item["title_cn"].strip() + paid_only, item["url_cn"], item["relative_path_en"], ",".join(item["tags_cn"]), @@ -169,7 +170,7 @@ def generate_question_readme(result): f2.write( readme_template_en.format( int(item["frontend_question_id"]), - item["title_en"], + item["title_en"].strip() + paid_only, item["url_en"], item["relative_path_cn"], ",".join(item["tags_en"]), @@ -262,8 +263,9 @@ def refresh(result): for question in result: front_question_id = question["frontend_question_id"] print(front_question_id) - title = question["title_cn"] - title_en = question["title_en"] + paid_only = ' 🔒' if question['paid_only'] else '' + title = question["title_cn"].strip() + paid_only + title_en = question["title_en"].strip() + paid_only tags = ",".join(question["tags_cn"]) tags_en = ",".join(question["tags_en"])