mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 1655,
|
||||
"dislikes": 79,
|
||||
"likes": 1725,
|
||||
"dislikes": 83,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Binary Tree Preorder Traversal\", \"titleSlug\": \"binary-tree-preorder-traversal\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"N-ary Tree Level Order Traversal\", \"titleSlug\": \"n-ary-tree-level-order-traversal\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"N-ary Tree Postorder Traversal\", \"titleSlug\": \"n-ary-tree-postorder-traversal\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[1,null,3,2,4,null,5,6]\n[1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]",
|
||||
@@ -125,7 +125,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"219.5K\", \"totalSubmission\": \"288.9K\", \"totalAcceptedRaw\": 219503, \"totalSubmissionRaw\": 288910, \"acRate\": \"76.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"226.2K\", \"totalSubmission\": \"297.3K\", \"totalAcceptedRaw\": 226223, \"totalSubmissionRaw\": 297307, \"acRate\": \"76.1%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "603",
|
||||
|
Reference in New Issue
Block a user