mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 3848,
|
||||
"dislikes": 121,
|
||||
"likes": 3975,
|
||||
"dislikes": 127,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Binary Tree Inorder Traversal\", \"titleSlug\": \"binary-tree-inorder-traversal\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Verify Preorder Sequence in Binary Search Tree\", \"titleSlug\": \"verify-preorder-sequence-in-binary-search-tree\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"N-ary Tree Preorder Traversal\", \"titleSlug\": \"n-ary-tree-preorder-traversal\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[1,null,2,3]\n[]\n[1]",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"900.8K\", \"totalSubmission\": \"1.4M\", \"totalAcceptedRaw\": 900820, \"totalSubmissionRaw\": 1449348, \"acRate\": \"62.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"924.8K\", \"totalSubmission\": \"1.5M\", \"totalAcceptedRaw\": 924766, \"totalSubmissionRaw\": 1481016, \"acRate\": \"62.4%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "594",
|
||||
|
Reference in New Issue
Block a user