coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,10 +11,10 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 7467,
"dislikes": 465,
"likes": 7670,
"dislikes": 485,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Diameter of N-Ary Tree\", \"titleSlug\": \"diameter-of-n-ary-tree\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"similarQuestions": "[{\"title\": \"Diameter of N-Ary Tree\", \"titleSlug\": \"diameter-of-n-ary-tree\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Path With Different Adjacent Characters\", \"titleSlug\": \"longest-path-with-different-adjacent-characters\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,3,4,5]\n[1,2]",
"categoryTitle": "Algorithms",
"contributors": [],
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"694.2K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 694184, \"totalSubmissionRaw\": 1288172, \"acRate\": \"53.9%\"}",
"stats": "{\"totalAccepted\": \"715.5K\", \"totalSubmission\": \"1.3M\", \"totalAcceptedRaw\": 715479, \"totalSubmissionRaw\": 1321210, \"acRate\": \"54.2%\"}",
"hints": [],
"solution": {
"id": "1115",