mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,10 +11,10 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 870,
|
||||
"likes": 886,
|
||||
"dislikes": 211,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Longest Consecutive Sequence\", \"titleSlug\": \"longest-consecutive-sequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Binary Tree Longest Consecutive Sequence II\", \"titleSlug\": \"binary-tree-longest-consecutive-sequence-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"similarQuestions": "[{\"title\": \"Longest Consecutive Sequence\", \"titleSlug\": \"longest-consecutive-sequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Binary Tree Longest Consecutive Sequence II\", \"titleSlug\": \"binary-tree-longest-consecutive-sequence-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Check if an Array Is Consecutive\", \"titleSlug\": \"check-if-an-array-is-consecutive\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[1,null,3,2,4,null,null,null,5]\n[2,null,3,2,null,1]",
|
||||
"categoryTitle": "Algorithms",
|
||||
"contributors": [],
|
||||
@@ -40,7 +40,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"118.9K\", \"totalSubmission\": \"233K\", \"totalAcceptedRaw\": 118854, \"totalSubmissionRaw\": 233042, \"acRate\": \"51.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"120.2K\", \"totalSubmission\": \"235K\", \"totalAcceptedRaw\": 120161, \"totalSubmissionRaw\": 234964, \"acRate\": \"51.1%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "14",
|
||||
|
Reference in New Issue
Block a user