mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 1595,
|
||||
"dislikes": 91,
|
||||
"likes": 1683,
|
||||
"dislikes": 101,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Maximum Depth of Binary Tree\", \"titleSlug\": \"maximum-depth-of-binary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Binary Tree Maximum Path Sum\", \"titleSlug\": \"binary-tree-maximum-path-sum\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "1\n0\n[-1]\n[0]\n6\n2\n[2,2,-1,2,2,2]\n[0,0,1,0,0,0]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"84.3K\", \"totalSubmission\": \"145.4K\", \"totalAcceptedRaw\": 84294, \"totalSubmissionRaw\": 145378, \"acRate\": \"58.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"88.2K\", \"totalSubmission\": \"151.9K\", \"totalAcceptedRaw\": 88151, \"totalSubmissionRaw\": 151924, \"acRate\": \"58.0%\"}",
|
||||
"hints": [
|
||||
"The company can be represented as a tree, headID is always the root.",
|
||||
"Store for each node the time needed to be informed of the news.",
|
||||
|
Reference in New Issue
Block a user