coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/evaluate-boolean-binary-tree.json
View File

@@ -12,7 +12,7 @@
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 885,
"dislikes": 23,
"dislikes": 24,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Check If Two Expression Trees are Equivalent\", \"titleSlug\": \"check-if-two-expression-trees-are-equivalent\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Design an Expression Tree With Evaluate Function\", \"titleSlug\": \"design-an-expression-tree-with-evaluate-function\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Flips in Binary Tree to Get Result\", \"titleSlug\": \"minimum-flips-in-binary-tree-to-get-result\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[2,1,3,null,null,0,1]\n[0]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"60.9K\", \"totalSubmission\": \"78.3K\", \"totalAcceptedRaw\": 60940, \"totalSubmissionRaw\": 78262, \"acRate\": \"77.9%\"}",
"stats": "{\"totalAccepted\": \"61K\", \"totalSubmission\": \"78.3K\", \"totalAcceptedRaw\": 60971, \"totalSubmissionRaw\": 78311, \"acRate\": \"77.9%\"}",
"hints": [
"Traverse the tree using depth-first search in post-order.",
"Can you use recursion to solve this easily?"