coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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

4
leetcode/originData/[no content]tree-diameter.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 589,
"likes": 590,
"dislikes": 13,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Count Subtrees With Max Distance Between Cities\", \"titleSlug\": \"count-subtrees-with-max-distance-between-cities\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 24849, \"totalSubmissionRaw\": 39873, \"acRate\": \"62.3%\"}",
"stats": "{\"totalAccepted\": \"24.9K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 24893, \"totalSubmissionRaw\": 39936, \"acRate\": \"62.3%\"}",
"hints": [
"Start at any node A and traverse the tree to find the furthest node from it, let's call it B.",
"Having found the furthest node B, traverse the tree from B to find the furthest node from it, lets call it C.",