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

6
leetcode/originData/[no content]move-sub-tree-of-n-ary-tree.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 23,
"dislikes": 35,
"likes": 24,
"dislikes": 36,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Find Root of N-Ary Tree\", \"titleSlug\": \"find-root-of-n-ary-tree\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,null,2,3,null,4,5,null,6,null,7,8]\n4\n1\n[1,null,2,3,null,4,5,null,6,null,7,8]\n7\n4\n[1,null,2,3,null,4,5,null,6,null,7,8]\n3\n8",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"2.6K\", \"totalAcceptedRaw\": 1711, \"totalSubmissionRaw\": 2615, \"acRate\": \"65.4%\"}",
"stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"2.7K\", \"totalAcceptedRaw\": 1740, \"totalSubmissionRaw\": 2682, \"acRate\": \"64.9%\"}",
"hints": [
"Disconnect node p from its parent and append it to the children list of node q.",
"If q was in the sub-tree of node p (case 1), get the parent node of p and replace p in its children list with q.",