coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-01-09 01:30:35 +08:00
parent 2aacdf2f93
commit de35811b38
68 changed files with 23828 additions and 16382 deletions
Download Patch File Download Diff File Expand all files Collapse all files

86
leetcode-cn/originData/[no content]design-a-3d-binary-matrix-with-efficient-layer-tracking.json Normal file
View File

File diff suppressed because one or more lines are too long

61
leetcode-cn/originData/[no content]find-circular-gift-exchange-chains.json Normal file
View File

@@ -0,0 +1,61 @@
{
"data": {
"question": {
"questionId": "3746",
"questionFrontendId": "3401",
"categoryTitle": "Database",
"boundTopicId": 3033181,
"title": "Find Circular Gift Exchange Chains",
"titleSlug": "find-circular-gift-exchange-chains",
"content": null,
"translatedTitle": null,
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 0,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
"contributors": [],
"langToValidPlayground": null,
"topicTags": [
{
"name": "Database",
"slug": "database",
"translatedName": "数据库",
"__typename": "TopicTagNode"
}
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"16\", \"totalSubmission\": \"23\", \"totalAcceptedRaw\": 16, \"totalSubmissionRaw\": 23, \"acRate\": \"69.6%\"}",
"hints": [],
"solution": null,
"status": null,
"sampleTestCase": "{\"headers\":{\"SecretSanta\":[\"giver_id\",\"receiver_id\",\"gift_value\"]},\"rows\":{\"SecretSanta\":[[1,2,20],[2,3,30],[3,1,40],[4,5,25],[5,4,35]]}}",
"metaData": "{\"mysql\":[\"CREATE TABLE SecretSanta (\\n giver_id INT,\\n receiver_id INT,\\n gift_value INT\\n)\\n\"],\"mssql\":[\"CREATE TABLE SecretSanta (\\n giver_id INT,\\n receiver_id INT,\\n gift_value INT\\n)\\n\"],\"oraclesql\":[\"CREATE TABLE SecretSanta (\\n giver_id NUMBER,\\n receiver_id NUMBER,\\n gift_value NUMBER\\n)\\n\"],\"database\":true,\"name\":\"find_gift_chains\",\"pythondata\":[\"SecretSanta = pd.DataFrame(columns=[\\\"giver_id\\\", \\\"receiver_id\\\", \\\"gift_value\\\"]).astype({\\\"giver_id\\\": \\\"int\\\", \\\"receiver_id\\\": \\\"int\\\", \\\"gift_value\\\": \\\"int\\\"})\\n\"],\"postgresql\":[\"CREATE TABLE SecretSanta (\\n giver_id INT,\\n receiver_id INT,\\n gift_value INT\\n)\\n\"],\"database_schema\":{\"SecretSanta\":{\"giver_id\":\"INT\",\"receiver_id\":\"INT\",\"gift_value\":\"INT\"}}}",
"judgerAvailable": true,
"judgeType": "large",
"mysqlSchemas": [
"CREATE TABLE SecretSanta (\n giver_id INT,\n receiver_id INT,\n gift_value INT\n)\n",
"Truncate table SecretSanta",
"insert into SecretSanta (giver_id, receiver_id, gift_value) values ('1', '2', '20')",
"insert into SecretSanta (giver_id, receiver_id, gift_value) values ('2', '3', '30')",
"insert into SecretSanta (giver_id, receiver_id, gift_value) values ('3', '1', '40')",
"insert into SecretSanta (giver_id, receiver_id, gift_value) values ('4', '5', '25')",
"insert into SecretSanta (giver_id, receiver_id, gift_value) values ('5', '4', '35')"
],
"enableRunCode": true,
"envInfo": "{\"mysql\":[\"MySQL\",\"<p>\\u7248\\u672c\\uff1a<code>MySQL 8.0<\\/code><\\/p>\"],\"mssql\":[\"MS SQL Server\",\"<p>mssql server 2019.<\\/p>\"],\"oraclesql\":[\"Oracle\",\"<p>Oracle Sql 11.2.<\\/p>\"],\"pythondata\":[\"Pandas\",\"<p>Python 3.10 with Pandas 2.2.2 and NumPy 1.26.4<\\/p>\"],\"postgresql\":[\"PostgreSQL\",\"<p>PostgreSQL 16<\\/p>\"]}",
"book": null,
"isSubscribed": false,
"isDailyQuestion": false,
"dailyRecordStatus": null,
"editorType": "CKEDITOR",
"ugcQuestionId": null,
"style": "LEETCODE",
"exampleTestcases": "{\"headers\":{\"SecretSanta\":[\"giver_id\",\"receiver_id\",\"gift_value\"]},\"rows\":{\"SecretSanta\":[[1,2,20],[2,3,30],[3,1,40],[4,5,25],[5,4,35]]}}",
"__typename": "QuestionNode"
}
}
}

63
leetcode-cn/originData/[no content]find-products-with-three-consecutive-digits.json Normal file
View File

@@ -0,0 +1,63 @@
{
"data": {
"question": {
"questionId": "3757",
"questionFrontendId": "3415",
"categoryTitle": "Database",
"boundTopicId": 3039682,
"title": "Find Products with Three Consecutive Digits ",
"titleSlug": "find-products-with-three-consecutive-digits",
"content": null,
"translatedTitle": "查找具有三个连续数字的产品",
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Easy",
"likes": 0,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
"contributors": [],
"langToValidPlayground": null,
"topicTags": [
{
"name": "Database",
"slug": "database",
"translatedName": "数据库",
"__typename": "TopicTagNode"
}
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"21\", \"totalSubmission\": \"23\", \"totalAcceptedRaw\": 21, \"totalSubmissionRaw\": 23, \"acRate\": \"91.3%\"}",
"hints": [],
"solution": null,
"status": null,
"sampleTestCase": "{\"headers\":{\"Products\":[\"product_id\",\"name\"]},\"rows\":{\"Products\":[[1,\"ABC123XYZ\"],[2,\"A12B34C\"],[3,\"Product56789\"],[4,\"NoDigitsHere\"],[5,\"789Product\"],[6,\"Item003Description\"],[7,\"Product12X34\"]]}}",
"metaData": "{\"mysql\":[\"CREATE TABLE if not exists products (\\n product_id INT,\\n name VARCHAR(255)\\n)\\n\"],\"mssql\":[\"CREATE TABLE products (\\n product_id INT,\\n name VARCHAR(255)\\n)\\n\"],\"oraclesql\":[\"CREATE TABLE products (\\n product_id NUMBER,\\n name VARCHAR2(255)\\n)\\n\"],\"postgresql\":[\"CREATE TABLE if not exists products (\\n product_id INT,\\n name VARCHAR(255)\\n)\\n\"],\"database\":true,\"name\":\"find_products\",\"pythondata\":[\"Products = pd.DataFrame(columns=['product_id', 'name']).astype({'product_id': 'int', 'name': 'string'})\"],\"database_schema\":{\"products\":{\"product_id\":\"INT\",\"name\":\"VARCHAR(255)\"}}}",
"judgerAvailable": true,
"judgeType": "large",
"mysqlSchemas": [
"CREATE TABLE if not exists products (\n product_id INT,\n name VARCHAR(255)\n)\n",
"Truncate table Products",
"insert into Products (product_id, name) values ('1', 'ABC123XYZ')",
"insert into Products (product_id, name) values ('2', 'A12B34C')",
"insert into Products (product_id, name) values ('3', 'Product56789')",
"insert into Products (product_id, name) values ('4', 'NoDigitsHere')",
"insert into Products (product_id, name) values ('5', '789Product')",
"insert into Products (product_id, name) values ('6', 'Item003Description')",
"insert into Products (product_id, name) values ('7', 'Product12X34')"
],
"enableRunCode": true,
"envInfo": "{\"mysql\":[\"MySQL\",\"<p>\\u7248\\u672c\\uff1a<code>MySQL 8.0<\\/code><\\/p>\"],\"mssql\":[\"MS SQL Server\",\"<p>mssql server 2019.<\\/p>\"],\"oraclesql\":[\"Oracle\",\"<p>Oracle Sql 11.2.<\\/p>\"],\"pythondata\":[\"Pandas\",\"<p>Python 3.10 with Pandas 2.2.2 and NumPy 1.26.4<\\/p>\"],\"postgresql\":[\"PostgreSQL\",\"<p>PostgreSQL 16<\\/p>\"]}",
"book": null,
"isSubscribed": false,
"isDailyQuestion": false,
"dailyRecordStatus": null,
"editorType": "CKEDITOR",
"ugcQuestionId": null,
"style": "LEETCODE",
"exampleTestcases": "{\"headers\":{\"Products\":[\"product_id\",\"name\"]},\"rows\":{\"Products\":[[1,\"ABC123XYZ\"],[2,\"A12B34C\"],[3,\"Product56789\"],[4,\"NoDigitsHere\"],[5,\"789Product\"],[6,\"Item003Description\"],[7,\"Product12X34\"]]}}",
"__typename": "QuestionNode"
}
}
}

61
leetcode-cn/originData/[no content]find-the-lexicographically-largest-string-from-the-box-ii.json Normal file
View File

File diff suppressed because one or more lines are too long

67
leetcode-cn/originData/[no content]maximum-number-of-matching-indices-after-right-shifts.json Normal file
View File

File diff suppressed because one or more lines are too long

183
leetcode-cn/originData/check-if-grid-can-be-cut-into-sections.json Normal file
View File

File diff suppressed because one or more lines are too long

194
leetcode-cn/originData/count-paths-with-the-given-xor-value.json Normal file
View File

File diff suppressed because one or more lines are too long

195
leetcode-cn/originData/count-special-subsequences.json Normal file
View File

File diff suppressed because one or more lines are too long

176
leetcode-cn/originData/count-subarrays-of-length-three-with-a-condition.json Normal file
View File

File diff suppressed because one or more lines are too long

184
leetcode-cn/originData/count-the-number-of-arrays-with-k-matching-adjacent-elements.json Normal file
View File

File diff suppressed because one or more lines are too long

192
leetcode-cn/originData/design-task-manager.json Normal file
View File

File diff suppressed because one or more lines are too long

192
leetcode-cn/originData/find-mirror-score-of-a-string.json Normal file
View File

File diff suppressed because one or more lines are too long

188
leetcode-cn/originData/find-the-lexicographically-largest-string-from-the-box-i.json Normal file
View File

File diff suppressed because one or more lines are too long

183
leetcode-cn/originData/longest-subsequence-with-decreasing-adjacent-difference.json Normal file
View File

File diff suppressed because one or more lines are too long

189
leetcode-cn/originData/maximize-subarray-sum-after-removing-all-occurrences-of-one-element.json Normal file
View File

File diff suppressed because one or more lines are too long

206
leetcode-cn/originData/maximum-coins-from-k-consecutive-bags.json Normal file
View File

File diff suppressed because one or more lines are too long

189
leetcode-cn/originData/maximum-number-of-distinct-elements-after-operations.json Normal file
View File

File diff suppressed because one or more lines are too long

198
leetcode-cn/originData/maximum-score-of-non-overlapping-intervals.json Normal file
View File

File diff suppressed because one or more lines are too long

200
leetcode-cn/originData/maximum-subarray-with-equal-products.json Normal file
View File

File diff suppressed because one or more lines are too long

182
leetcode-cn/originData/minimum-number-of-operations-to-make-elements-in-array-distinct.json Normal file
View File

File diff suppressed because one or more lines are too long

189
leetcode-cn/originData/minimum-operations-to-make-columns-strictly-increasing.json Normal file
View File

File diff suppressed because one or more lines are too long

189
leetcode-cn/originData/smallest-substring-with-identical-characters-i.json Normal file
View File

File diff suppressed because one or more lines are too long

185
leetcode-cn/originData/smallest-substring-with-identical-characters-ii.json Normal file
View File

File diff suppressed because one or more lines are too long

195
leetcode-cn/originData/subsequences-with-a-unique-middle-mode-i.json Normal file
View File

File diff suppressed because one or more lines are too long

182
leetcode-cn/originData/substring-matching-pattern.json Normal file
View File

File diff suppressed because one or more lines are too long