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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/longest-path-with-different-adjacent-characters.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 2296,
"likes": 2297,
"dislikes": 59,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Diameter of Binary Tree\", \"titleSlug\": \"diameter-of-binary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Longest Univalue Path\", \"titleSlug\": \"longest-univalue-path\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Choose Edges to Maximize Score in a Tree\", \"titleSlug\": \"choose-edges-to-maximize-score-in-a-tree\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -173,7 +173,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"69.6K\", \"totalSubmission\": \"126.5K\", \"totalAcceptedRaw\": 69554, \"totalSubmissionRaw\": 126499, \"acRate\": \"55.0%\"}",
"stats": "{\"totalAccepted\": \"69.6K\", \"totalSubmission\": \"126.5K\", \"totalAcceptedRaw\": 69555, \"totalSubmissionRaw\": 126508, \"acRate\": \"55.0%\"}",
"hints": [
"Do a DFS from the root. At each node, calculate the longest path we can make from two branches of that subtree.",
"To do that, we need to find the length of the longest path from each of the node’s children."