mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 8034,
|
||||
"dislikes": 209,
|
||||
"likes": 8047,
|
||||
"dislikes": 210,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Construct Binary Tree from Inorder and Postorder Traversal\", \"titleSlug\": \"construct-binary-tree-from-inorder-and-postorder-traversal\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[3,9,20,15,7]\n[9,3,15,20,7]\n[-1]\n[-1]",
|
||||
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"677.6K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 677608, \"totalSubmissionRaw\": 1184001, \"acRate\": \"57.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"678.6K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 678646, \"totalSubmissionRaw\": 1185393, \"acRate\": \"57.3%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "1114",
|
||||
|
Reference in New Issue
Block a user