mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 85,
|
||||
"likes": 86,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -46,7 +46,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"3.9K\", \"totalAcceptedRaw\": 1910, \"totalSubmissionRaw\": 3909, \"acRate\": \"48.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"2K\", \"totalSubmission\": \"4K\", \"totalAcceptedRaw\": 1970, \"totalSubmissionRaw\": 4017, \"acRate\": \"49.0%\"}",
|
||||
"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