From 3b37d75984bc1443e592e751e17f9be5dd9aeec5 Mon Sep 17 00:00:00 2001 From: openset Date: 2019年12月23日 09:39:58 +0800 Subject: [PATCH] Add: new --- README.md | 9 +- internal/leetcode/topic_tag.go | 4 +- problems/best-meeting-point/README.md | 2 +- .../copy-list-with-random-pointer/README.md | 51 +++++++--- .../README.md | 76 +++++++++++++++ .../README.md | 59 ++++++++++++ problems/flip-game-ii/README.md | 2 +- problems/immediate-food-delivery-i/README.md | 2 +- .../README.md | 93 +++++++++++++++++++ .../README.md | 81 ++++++++++++++++ .../README.md | 2 +- problems/students-and-examinations/README.md | 2 +- .../weather-type-in-each-country/README.md | 14 +++ .../mysql_schemas.sql | 27 ++++++ tag/array/README.md | 2 + tag/bit-manipulation/README.md | 1 + tag/breadth-first-search/README.md | 1 + tag/greedy/README.md | 1 + tag/string/README.md | 1 + 19 files changed, 409 insertions(+), 21 deletions(-) create mode 100644 problems/divide-array-in-sets-of-k-consecutive-numbers/README.md create mode 100644 problems/find-numbers-with-even-number-of-digits/README.md create mode 100644 problems/maximum-candies-you-can-get-from-boxes/README.md create mode 100644 problems/maximum-number-of-occurrences-of-a-substring/README.md create mode 100644 problems/weather-type-in-each-country/README.md create mode 100644 problems/weather-type-in-each-country/mysql_schemas.sql diff --git a/README.md b/README.md index 4bce71657..53e640787 100644 --- a/README.md +++ b/README.md @@ -62,6 +62,11 @@ LeetCode Problems' Solutions | # | Title | Solution | Difficulty | | :-: | - | - | :-: | +| 1298 | [Maximum Candies You Can Get from Boxes](https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes "你能从盒子里获得的最大糖果数") | [Go](problems/maximum-candies-you-can-get-from-boxes) | Hard | +| 1297 | [Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring "子串的最大出现次数") | [Go](problems/maximum-number-of-occurrences-of-a-substring) | Medium | +| 1296 | [Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers "划分数组为连续数字的集合") | [Go](problems/divide-array-in-sets-of-k-consecutive-numbers) | Medium | +| 1295 | [Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits "统计位数为偶数的数字") | [Go](problems/find-numbers-with-even-number-of-digits) | Easy | +| 1294 | [Weather Type in Each Country](https://leetcode.com/problems/weather-type-in-each-country) 🔒 | [MySQL](problems/weather-type-in-each-country) | Easy | | 1293 | [Shortest Path in a Grid with Obstacles Elimination](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination "网格中的最短路径") | [Go](problems/shortest-path-in-a-grid-with-obstacles-elimination) | Hard | | 1292 | [Maximum Side Length of a Square with Sum Less than or Equal to Threshold](https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold "元素和小于等于阈值的正方形的最大边长") | [Go](problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold) | Medium | | 1291 | [Sequential Digits](https://leetcode.com/problems/sequential-digits "顺次数") | [Go](problems/sequential-digits) | Medium | @@ -75,7 +80,7 @@ LeetCode Problems' Solutions | 1283 | [Find the Smallest Divisor Given a Threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold "使结果不超过阈值的最小除数") | [Go](problems/find-the-smallest-divisor-given-a-threshold) | Medium | | 1282 | [Group the People Given the Group Size They Belong To](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to "用户分组") | [Go](problems/group-the-people-given-the-group-size-they-belong-to) | Medium | | 1281 | [Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer "整数的各位积和之差") | [Go](problems/subtract-the-product-and-sum-of-digits-of-an-integer) | Easy | -| 1280 | [Students and Examinations](https://leetcode.com/problems/students-and-examinations) 🔒 | [MySQL](problems/students-and-examinations) | Easy | +| 1280 | [Students and Examinations](https://leetcode.com/problems/students-and-examinations "学生们参加各科测试的次数") 🔒 | [MySQL](problems/students-and-examinations) | Easy | | 1279 | [Traffic Light Controlled Intersection](https://leetcode.com/problems/traffic-light-controlled-intersection) 🔒 | [Go](problems/traffic-light-controlled-intersection) | Easy | | 1278 | [Palindrome Partitioning III](https://leetcode.com/problems/palindrome-partitioning-iii "分割回文串 III") | [Go](problems/palindrome-partitioning-iii) | Hard | | 1277 | [Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones "统计全为 1 的正方形子矩阵") | [Go](problems/count-square-submatrices-with-all-ones) | Medium | @@ -182,7 +187,7 @@ LeetCode Problems' Solutions | 1176 | [Diet Plan Performance](https://leetcode.com/problems/diet-plan-performance "健身计划评估") 🔒 | [Go](problems/diet-plan-performance) | Easy | | 1175 | [Prime Arrangements](https://leetcode.com/problems/prime-arrangements "质数排列") | [Go](problems/prime-arrangements) | Easy | | 1174 | [Immediate Food Delivery II](https://leetcode.com/problems/immediate-food-delivery-ii) 🔒 | [MySQL](problems/immediate-food-delivery-ii) | Medium | -| 1173 | [Immediate Food Delivery I](https://leetcode.com/problems/immediate-food-delivery-i) 🔒 | [MySQL](problems/immediate-food-delivery-i) | Easy | +| 1173 | [Immediate Food Delivery I](https://leetcode.com/problems/immediate-food-delivery-i "即时食物配送 I") 🔒 | [MySQL](problems/immediate-food-delivery-i) | Easy | | 1172 | [Dinner Plate Stacks](https://leetcode.com/problems/dinner-plate-stacks "餐盘栈") | [Go](problems/dinner-plate-stacks) | Hard | | 1171 | [Remove Zero Sum Consecutive Nodes from Linked List](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list "从链表中删去总和值为零的连续节点") | [Go](problems/remove-zero-sum-consecutive-nodes-from-linked-list) | Medium | | 1170 | [Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character "比较字符串最小字母出现频次") | [Go](problems/compare-strings-by-frequency-of-the-smallest-character) | Easy | diff --git a/internal/leetcode/topic_tag.go b/internal/leetcode/topic_tag.go index c297cb3c9..17ae396d8 100644 --- a/internal/leetcode/topic_tag.go +++ b/internal/leetcode/topic_tag.go @@ -42,7 +42,9 @@ func (tag *TagType) SaveContents() { if question.TranslatedTitle == "" { question.TranslatedTitle = question.Title } - buf.WriteString(fmt.Sprintf(format, question.frontendID(), question.TranslatedTitle, question.TitleSlug, question.IsPaidOnly.Str(), question.TagsStr(), question.Difficulty)) + if question.frontendID()> 0 { + buf.WriteString(fmt.Sprintf(format, question.frontendID(), question.TranslatedTitle, question.TitleSlug, question.IsPaidOnly.Str(), question.TagsStr(), question.Difficulty)) + } } filename := filepath.Join("tag", tag.Slug, "README.md") filePutContents(filename, buf.Bytes()) diff --git a/problems/best-meeting-point/README.md b/problems/best-meeting-point/README.md index bb2a41eb3..297450d60 100644 --- a/problems/best-meeting-point/README.md +++ b/problems/best-meeting-point/README.md @@ -31,8 +31,8 @@ Explanation: Given three people living at (0,0), (0, of 2+2+2=6 is minimal. So return 6. ### Related Topics - [[Sort](../../tag/sort/README.md)] [[Math](../../tag/math/README.md)] + [[Sort](../../tag/sort/README.md)] ### Similar Questions 1. [Shortest Distance from All Buildings](../shortest-distance-from-all-buildings) (Hard) diff --git a/problems/copy-list-with-random-pointer/README.md b/problems/copy-list-with-random-pointer/README.md index ba40520ee..d09f36026 100644 --- a/problems/copy-list-with-random-pointer/README.md +++ b/problems/copy-list-with-random-pointer/README.md @@ -15,28 +15,53 @@

Return a deep copy of the list.

- +

The Linked List is represented in the input/output as a list of n nodes. Each node is represented as a pair of [val, random_index] where:

+ + +

Example 1:

+ +
+Input: head = [[7,null],[13,0],[11,4],[10,2],[1,0]]
+Output: [[7,null],[13,0],[11,4],[10,2],[1,0]]
+
+ +

Example 2:

+ +
+Input: head = [[1,1],[2,1]]
+Output: [[1,1],[2,1]]
+
+ +

Example 3:

-

+

-Input:
-{"$id":"1","next":{"$id":"2","next":null,"random":{"$ref":"2"},"val":2},"random":{"$ref":"2"},"val":1}
-
-Explanation:
-Node 1's value is 1, both of its next and random pointer points to Node 2.
-Node 2's value is 2, its next pointer points to null and its random pointer points to itself.
+Input: head = [[3,null],[3,0],[3,null]]
+Output: [[3,null],[3,0],[3,null]]
- +

Example 4:

-

Note:

+
+Input: head = []
+Output: []
+Explanation: Given linked list is empty (null pointer), so return null.
+
+ + +

Constraints:

-
    -
  1. You must return the copy of the given head as a reference to the cloned list.
    2. -
+ ### Related Topics [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/divide-array-in-sets-of-k-consecutive-numbers/README.md b/problems/divide-array-in-sets-of-k-consecutive-numbers/README.md new file mode 100644 index 000000000..a0d5c312b --- /dev/null +++ b/problems/divide-array-in-sets-of-k-consecutive-numbers/README.md @@ -0,0 +1,76 @@ + + + + + + + +[< Previous](../find-numbers-with-even-number-of-digits "Find Numbers with Even Number of Digits") + +[Next>](../maximum-number-of-occurrences-of-a-substring "Maximum Number of Occurrences of a Substring") + +## [1296. Divide Array in Sets of K Consecutive Numbers (Medium)](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers "划分数组为连续数字的集合") + +

Given an array of integers nums and a positive integer k, find whether it's possible to divide this array into sets of k consecutive numbers
+Return True if its possibleotherwise return False.

+ + +

Example 1:

+ +
+Input: nums = [1,2,3,3,4,4,5,6], k = 4
+Output: true
+Explanation: Array can be divided into [1,2,3,4] and [3,4,5,6].
+
+ +

Example 2:

+ +
+Input: nums = [3,2,1,2,3,4,3,4,5,9,10,11], k = 3
+Output: true
+Explanation: Array can be divided into [1,2,3] , [2,3,4] , [3,4,5] and [9,10,11].
+
+ +

Example 3:

+ +
+Input: nums = [3,3,2,2,1,1], k = 3
+Output: true
+
+ +

Example 4:

+ +
+Input: nums = [1,2,3,4], k = 3
+Output: false
+Explanation: Each array should be divided in subarrays of size 3.
+
+ + +

Constraints:

+ + + +### Related Topics + [[Greedy](../../tag/greedy/README.md)] + [[Array](../../tag/array/README.md)] + +### Hints +
+Hint 1 +If the smallest number in the possible-to-split array is V, then numbers V+1, V+2, ... V+k-1 must contain there as well. +
+ +
+Hint 2 +You can iteratively find k sets and remove them from array until it becomes empty. +
+ +
+Hint 3 +Failure to do so would mean that array is unsplittable. +
diff --git a/problems/find-numbers-with-even-number-of-digits/README.md b/problems/find-numbers-with-even-number-of-digits/README.md new file mode 100644 index 000000000..fc610d517 --- /dev/null +++ b/problems/find-numbers-with-even-number-of-digits/README.md @@ -0,0 +1,59 @@ + + + + + + + +[< Previous](../weather-type-in-each-country "Weather Type in Each Country") + +[Next>](../divide-array-in-sets-of-k-consecutive-numbers "Divide Array in Sets of K Consecutive Numbers") + +## [1295. Find Numbers with Even Number of Digits (Easy)](https://leetcode.com/problems/find-numbers-with-even-number-of-digits "统计位数为偶数的数字") + +Given an array nums of integers, return how many of them contain an even number of digits. + +

Example 1:

+ +
+Input: nums = [12,345,2,6,7896]
+Output: 2
+Explanation: 
+12 contains 2 digits (even number of digits). 
+345 contains 3 digits (odd number of digits). 
+2 contains 1 digit (odd number of digits). 
+6 contains 1 digit (odd number of digits). 
+7896 contains 4 digits (even number of digits). 
+Therefore only 12 and 7896 contain an even number of digits.
+
+ +

Example 2:

+ +
+Input: nums = [555,901,482,1771]
+Output: 1 
+Explanation: 
+Only 1771 contains an even number of digits.
+
+ + +

Constraints:

+ + + +### Related Topics + [[Array](../../tag/array/README.md)] + +### Hints +
+Hint 1 +How to compute the number of digits of a number ? +
+ +
+Hint 2 +Divide the number by 10 again and again to get the number of digits. +
diff --git a/problems/flip-game-ii/README.md b/problems/flip-game-ii/README.md index 2f1cb21a4..b35d2be9a 100644 --- a/problems/flip-game-ii/README.md +++ b/problems/flip-game-ii/README.md @@ -27,8 +27,8 @@ Derive your algorithm's runtime complexity.

### Related Topics - [[Backtracking](../../tag/backtracking/README.md)] [[Minimax](../../tag/minimax/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions 1. [Nim Game](../nim-game) (Easy) diff --git a/problems/immediate-food-delivery-i/README.md b/problems/immediate-food-delivery-i/README.md index 2eb47ffb4..39a2a918a 100644 --- a/problems/immediate-food-delivery-i/README.md +++ b/problems/immediate-food-delivery-i/README.md @@ -9,7 +9,7 @@ [Next>](../immediate-food-delivery-ii "Immediate Food Delivery II") -## [1173. Immediate Food Delivery I (Easy)](https://leetcode.com/problems/immediate-food-delivery-i "") +## [1173. Immediate Food Delivery I (Easy)](https://leetcode.com/problems/immediate-food-delivery-i "即时食物配送 I")

Table: Delivery

diff --git a/problems/maximum-candies-you-can-get-from-boxes/README.md b/problems/maximum-candies-you-can-get-from-boxes/README.md new file mode 100644 index 000000000..584b72f91 --- /dev/null +++ b/problems/maximum-candies-you-can-get-from-boxes/README.md @@ -0,0 +1,93 @@ + + + + + + + +[< Previous](../maximum-number-of-occurrences-of-a-substring "Maximum Number of Occurrences of a Substring") + +Next> + +## [1298. Maximum Candies You Can Get from Boxes (Hard)](https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes "你能从盒子里获得的最大糖果数") + +

Given n boxes, each box is given in the format [status, candies, keys, containedBoxes] where:

+ + + +

You will start with some boxes given in initialBoxes array. You can take all the candies in any open box and you can use the keys in it to open new boxes and you also can use the boxes you find in it.

+ +

Return the maximum number of candies you can get following the rules above.

+ + +

Example 1:

+ +
+Input: status = [1,0,1,0], candies = [7,5,4,100], keys = [[],[],[1],[]], containedBoxes = [[1,2],[3],[],[]], initialBoxes = [0]
+Output: 16
+Explanation: You will be initially given box 0. You will find 7 candies in it and boxes 1 and 2. Box 1 is closed and you don't have a key for it so you will open box 2. You will find 4 candies and a key to box 1 in box 2.
+In box 1, you will find 5 candies and box 3 but you will not find a key to box 3 so box 3 will remain closed.
+Total number of candies collected = 7 + 4 + 5 = 16 candy.
+
+ +

Example 2:

+ +
+Input: status = [1,0,0,0,0,0], candies = [1,1,1,1,1,1], keys = [[1,2,3,4,5],[],[],[],[],[]], containedBoxes = [[1,2,3,4,5],[],[],[],[],[]], initialBoxes = [0]
+Output: 6
+Explanation: You have initially box 0. Opening it you can find boxes 1,2,3,4 and 5 and their keys. The total number of candies will be 6.
+
+ +

Example 3:

+ +
+Input: status = [1,1,1], candies = [100,1,100], keys = [[],[0,2],[]], containedBoxes = [[],[],[]], initialBoxes = [1]
+Output: 1
+
+ +

Example 4:

+ +
+Input: status = [1], candies = [100], keys = [[]], containedBoxes = [[]], initialBoxes = []
+Output: 0
+
+ +

Example 5:

+ +
+Input: status = [1,1,1], candies = [2,3,2], keys = [[],[],[]], containedBoxes = [[],[],[]], initialBoxes = [2,1,0]
+Output: 7
+
+ + +

Constraints:

+ + + +### Related Topics + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + +### Hints +
+Hint 1 +Use Breadth First Search (BFS) to traverse all possible boxes you can open. Only push to the queue the boxes the you have with their keys. +
diff --git a/problems/maximum-number-of-occurrences-of-a-substring/README.md b/problems/maximum-number-of-occurrences-of-a-substring/README.md new file mode 100644 index 000000000..2716510ab --- /dev/null +++ b/problems/maximum-number-of-occurrences-of-a-substring/README.md @@ -0,0 +1,81 @@ + + + + + + + +[< Previous](../divide-array-in-sets-of-k-consecutive-numbers "Divide Array in Sets of K Consecutive Numbers") + +[Next>](../maximum-candies-you-can-get-from-boxes "Maximum Candies You Can Get from Boxes") + +## [1297. Maximum Number of Occurrences of a Substring (Medium)](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring "子串的最大出现次数") + +

Given a string s, return the maximum number of ocurrences of any substring under the following rules:

+ + + + +

Example 1:

+ +
+Input: s = "aababcaab", maxLetters = 2, minSize = 3, maxSize = 4
+Output: 2
+Explanation: Substring "aab" has 2 ocurrences in the original string.
+It satisfies the conditions, 2 unique letters and size 3 (between minSize and maxSize).
+
+ +

Example 2:

+ +
+Input: s = "aaaa", maxLetters = 1, minSize = 3, maxSize = 3
+Output: 2
+Explanation: Substring "aaa" occur 2 times in the string. It can overlap.
+
+ +

Example 3:

+ +
+Input: s = "aabcabcab", maxLetters = 2, minSize = 2, maxSize = 3
+Output: 3
+
+ +

Example 4:

+ +
+Input: s = "abcde", maxLetters = 2, minSize = 3, maxSize = 3
+Output: 0
+
+ + +

Constraints:

+ + + +### Related Topics + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[String](../../tag/string/README.md)] + +### Hints +
+Hint 1 +Check out the constraints, (maxSize <=26). +
+ +
+Hint 2 +This means you can explore all substrings in O(n * 26). +
+ +
+Hint 3 +Find the Maximum Number of Occurrences of a Substring with bruteforce. +
diff --git a/problems/shortest-path-in-a-grid-with-obstacles-elimination/README.md b/problems/shortest-path-in-a-grid-with-obstacles-elimination/README.md index 59f261ac0..8b4f60995 100644 --- a/problems/shortest-path-in-a-grid-with-obstacles-elimination/README.md +++ b/problems/shortest-path-in-a-grid-with-obstacles-elimination/README.md @@ -7,7 +7,7 @@ [< Previous](../maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold "Maximum Side Length of a Square with Sum Less than or Equal to Threshold") -Next> +[Next>](../weather-type-in-each-country "Weather Type in Each Country") ## [1293. Shortest Path in a Grid with Obstacles Elimination (Hard)](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination "网格中的最短路径") diff --git a/problems/students-and-examinations/README.md b/problems/students-and-examinations/README.md index 06b103b4d..bb99c2475 100644 --- a/problems/students-and-examinations/README.md +++ b/problems/students-and-examinations/README.md @@ -9,7 +9,7 @@ [Next>](../subtract-the-product-and-sum-of-digits-of-an-integer "Subtract the Product and Sum of Digits of an Integer") -## [1280. Students and Examinations (Easy)](https://leetcode.com/problems/students-and-examinations "") +## [1280. Students and Examinations (Easy)](https://leetcode.com/problems/students-and-examinations "学生们参加各科测试的次数")

Table: Students

diff --git a/problems/weather-type-in-each-country/README.md b/problems/weather-type-in-each-country/README.md
new file mode 100644
index 000000000..4f3e18a09
--- /dev/null
+++ b/problems/weather-type-in-each-country/README.md
@@ -0,0 +1,14 @@
+
+
+
+
+
+
+
+[< Previous](../shortest-path-in-a-grid-with-obstacles-elimination "Shortest Path in a Grid with Obstacles Elimination") +         +[Next>](../find-numbers-with-even-number-of-digits "Find Numbers with Even Number of Digits")
+
+## [1294. Weather Type in Each Country (Easy)](https://leetcode.com/problems/weather-type-in-each-country "")
+
+
diff --git a/problems/weather-type-in-each-country/mysql_schemas.sql b/problems/weather-type-in-each-country/mysql_schemas.sql
new file mode 100644
index 000000000..047159d79
--- /dev/null
+++ b/problems/weather-type-in-each-country/mysql_schemas.sql
@@ -0,0 +1,27 @@
+Create table If Not Exists Countries (country_id int, country_name varchar(20));
+Create table If Not Exists Weather (country_id int, weather_state int, day date);
+Truncate table Countries;
+insert into Countries (country_id, country_name) values ('2', 'USA');
+insert into Countries (country_id, country_name) values ('3', 'Australia');
+insert into Countries (country_id, country_name) values ('7', 'Peru');
+insert into Countries (country_id, country_name) values ('5', 'China');
+insert into Countries (country_id, country_name) values ('8', 'Morocco');
+insert into Countries (country_id, country_name) values ('9', 'Spain');
+Truncate table Weather;
+insert into Weather (country_id, weather_state, day) values ('2', '15', '2019-11-01');
+insert into Weather (country_id, weather_state, day) values ('2', '12', '2019-10-28');
+insert into Weather (country_id, weather_state, day) values ('2', '12', '2019-10-27');
+insert into Weather (country_id, weather_state, day) values ('3', '-2', '2019-11-10');
+insert into Weather (country_id, weather_state, day) values ('3', '0', '2019-11-11');
+insert into Weather (country_id, weather_state, day) values ('3', '3', '2019-11-12');
+insert into Weather (country_id, weather_state, day) values ('5', '16', '2019-11-07');
+insert into Weather (country_id, weather_state, day) values ('5', '18', '2019-11-09');
+insert into Weather (country_id, weather_state, day) values ('5', '21', '2019-11-23');
+insert into Weather (country_id, weather_state, day) values ('7', '25', '2019-11-28');
+insert into Weather (country_id, weather_state, day) values ('7', '22', '2019-12-01');
+insert into Weather (country_id, weather_state, day) values ('7', '20', '2019-12-02');
+insert into Weather (country_id, weather_state, day) values ('8', '25', '2019-11-05');
+insert into Weather (country_id, weather_state, day) values ('8', '27', '2019-11-15');
+insert into Weather (country_id, weather_state, day) values ('8', '31', '2019-11-25');
+insert into Weather (country_id, weather_state, day) values ('9', '7', '2019-10-23');
+insert into Weather (country_id, weather_state, day) values ('9', '3', '2019-12-23');
diff --git a/tag/array/README.md b/tag/array/README.md
index 65b453837..c27081e6a 100644
--- a/tag/array/README.md
+++ b/tag/array/README.md
@@ -9,6 +9,8 @@
 
 | # | 题名 | 标签 | 难度 |
 | :-: | - | - | :-: |
+| 1296 | [划分数组为连续数字的集合](../../problems/divide-array-in-sets-of-k-consecutive-numbers) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Medium |
+| 1295 | [统计位数为偶数的数字](../../problems/find-numbers-with-even-number-of-digits) | [[数组](../array/README.md)] | Easy |
 | 1292 | [元素和小于等于阈值的正方形的最大边长](../../problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium |
 | 1287 | [有序数组中出现次数超过25%的元素](../../problems/element-appearing-more-than-25-in-sorted-array) | [[数组](../array/README.md)] | Easy |
 | 1277 | [统计全为 1 的正方形子矩阵](../../problems/count-square-submatrices-with-all-ones) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium |
diff --git a/tag/bit-manipulation/README.md b/tag/bit-manipulation/README.md
index b33bb8c94..c7a0a6025 100644
--- a/tag/bit-manipulation/README.md
+++ b/tag/bit-manipulation/README.md
@@ -9,6 +9,7 @@
 
 | # | 题名 | 标签 | 难度 |
 | :-: | - | - | :-: |
+| 1297 | [子串的最大出现次数](../../problems/maximum-number-of-occurrences-of-a-substring) | [[位运算](../bit-manipulation/README.md)] [[字符串](../string/README.md)] | Medium |
 | 1290 | [二进制链表转整数](../../problems/convert-binary-number-in-a-linked-list-to-integer) | [[位运算](../bit-manipulation/README.md)] [[链表](../linked-list/README.md)] | Easy |
 | 1256 | [加密数字](../../problems/encode-number) 🔒 | [[位运算](../bit-manipulation/README.md)] [[数学](../math/README.md)] | Medium |
 | 1255 | [得分最高的单词集合](../../problems/maximum-score-words-formed-by-letters) | [[位运算](../bit-manipulation/README.md)] | Hard |
diff --git a/tag/breadth-first-search/README.md b/tag/breadth-first-search/README.md
index cc761a19f..e59be563c 100644
--- a/tag/breadth-first-search/README.md
+++ b/tag/breadth-first-search/README.md
@@ -9,6 +9,7 @@
 
 | # | 题名 | 标签 | 难度 |
 | :-: | - | - | :-: |
+| 1298 | [你能从盒子里获得的最大糖果数](../../problems/maximum-candies-you-can-get-from-boxes) | [[广度优先搜索](../breadth-first-search/README.md)] | Hard |
 | 1293 | [网格中的最短路径](../../problems/shortest-path-in-a-grid-with-obstacles-elimination) | [[广度优先搜索](../breadth-first-search/README.md)] | Hard |
 | 1284 | [转化为全零矩阵的最少反转次数](../../problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix) | [[广度优先搜索](../breadth-first-search/README.md)] | Hard |
 | 1263 | [推箱子](../../problems/minimum-moves-to-move-a-box-to-their-target-location) | [[广度优先搜索](../breadth-first-search/README.md)] | Hard |
diff --git a/tag/greedy/README.md b/tag/greedy/README.md
index 7c819aa53..f5e2fd318 100644
--- a/tag/greedy/README.md
+++ b/tag/greedy/README.md
@@ -9,6 +9,7 @@
 
 | # | 题名 | 标签 | 难度 |
 | :-: | - | - | :-: |
+| 1296 | [划分数组为连续数字的集合](../../problems/divide-array-in-sets-of-k-consecutive-numbers) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Medium |
 | 1282 | [用户分组](../../problems/group-the-people-given-the-group-size-they-belong-to) | [[贪心算法](../greedy/README.md)] | Medium |
 | 1276 | [不浪费原料的汉堡制作方案](../../problems/number-of-burgers-with-no-waste-of-ingredients) | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] | Medium |
 | 1253 | [重构 2 行二进制矩阵](../../problems/reconstruct-a-2-row-binary-matrix) | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] | Medium |
diff --git a/tag/string/README.md b/tag/string/README.md
index 82fa26b3c..db4c81d85 100644
--- a/tag/string/README.md
+++ b/tag/string/README.md
@@ -9,6 +9,7 @@
 
 | # | 题名 | 标签 | 难度 |
 | :-: | - | - | :-: |
+| 1297 | [子串的最大出现次数](../../problems/maximum-number-of-occurrences-of-a-substring) | [[位运算](../bit-manipulation/README.md)] [[字符串](../string/README.md)] | Medium |
 | 1271 | [十六进制魔术数字](../../problems/hexspeak) 🔒 | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Easy |
 | 1268 | [搜索推荐系统](../../problems/search-suggestions-system) | [[字符串](../string/README.md)] | Medium |
 | 1249 | [移除无效的括号](../../problems/minimum-remove-to-make-valid-parentheses) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Medium |





AltStyle によって変換されたページ (->オリジナル)
/