coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 21:16:45 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/originData/diameter-of-binary-tree.json
View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给定一棵二叉树，你需要计算它的直径长度。一棵二叉树的直径长度是任意两个结点路径长度中的最大值。这条路径可能穿过也可能不穿过根结点。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 :</strong><br>\n给定二叉树</p>\n\n<pre> 1\n / \\\n 2 3\n / \\ \n 4 5 \n</pre>\n\n<p>返回&nbsp;<strong>3</strong>, 它的长度是路径 [4,2,1,3] 或者&nbsp;[5,2,1,3]。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>注意：</strong>两结点之间的路径长度是以它们之间边的数目表示。</p>\n",
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 964,
"likes": 966,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"196.8K\", \"totalSubmission\": \"348.4K\", \"totalAcceptedRaw\": 196838, \"totalSubmissionRaw\": 348384, \"acRate\": \"56.5%\"}",
"stats": "{\"totalAccepted\": \"197.7K\", \"totalSubmission\": \"349.7K\", \"totalAcceptedRaw\": 197703, \"totalSubmissionRaw\": 349728, \"acRate\": \"56.5%\"}",
"hints": [],
"solution": null,
"status": null,