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,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 743,
|
||||
"likes": 756,
|
||||
"dislikes": 147,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -46,7 +46,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"81.8K\", \"totalAcceptedRaw\": 37238, \"totalSubmissionRaw\": 81808, \"acRate\": \"45.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"38K\", \"totalSubmission\": \"83.3K\", \"totalAcceptedRaw\": 38039, \"totalSubmissionRaw\": 83306, \"acRate\": \"45.7%\"}",
|
||||
"hints": [
|
||||
"Convert the tree to a general graph, and do a breadth-first search. Alternatively, find the closest leaf for every node on the path from root to target."
|
||||
],
|
||||
|
Reference in New Issue
Block a user