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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/insufficient-nodes-in-root-to-leaf-paths.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 398,
"dislikes": 543,
"likes": 399,
"dislikes": 544,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,3,4,-99,-99,7,8,9,-99,-99,12,13,-99,14]\n1\n[5,4,8,11,null,17,4,7,1,null,null,5,3]\n22\n[1,2,-3,-5,null,4,null]\n-1",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"47.7K\", \"totalAcceptedRaw\": 24764, \"totalSubmissionRaw\": 47737, \"acRate\": \"51.9%\"}",
"stats": "{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"47.8K\", \"totalAcceptedRaw\": 24807, \"totalSubmissionRaw\": 47806, \"acRate\": \"51.9%\"}",
"hints": [
"Consider a DFS traversal of the tree. You can keep track of the current path sum from root to this node, and you can also use DFS to return the minimum value of any path from this node to the leaf. This will tell you if this node is insufficient."
],