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": 890,
|
||||
"dislikes": 70,
|
||||
"likes": 903,
|
||||
"dislikes": 71,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Binary Tree Longest Consecutive Sequence\", \"titleSlug\": \"binary-tree-longest-consecutive-sequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"similarQuestions": "[{\"title\": \"Binary Tree Longest Consecutive Sequence\", \"titleSlug\": \"binary-tree-longest-consecutive-sequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Check if an Array Is Consecutive\", \"titleSlug\": \"check-if-an-array-is-consecutive\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[1,2,3]\n[2,1,3]",
|
||||
"categoryTitle": "Algorithms",
|
||||
"contributors": [],
|
||||
@@ -40,7 +40,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"41.7K\", \"totalSubmission\": \"85.9K\", \"totalAcceptedRaw\": 41673, \"totalSubmissionRaw\": 85865, \"acRate\": \"48.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"42.2K\", \"totalSubmission\": \"86.9K\", \"totalAcceptedRaw\": 42233, \"totalSubmissionRaw\": 86945, \"acRate\": \"48.6%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "103",
|
||||
|
Reference in New Issue
Block a user