coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 05:26:46 +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

4
leetcode-cn/originData/all-elements-in-two-binary-search-trees.json
View File

@@ -161,14 +161,14 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"17.2K\", \"totalSubmission\": \"23K\", \"totalAcceptedRaw\": 17165, \"totalSubmissionRaw\": 22952, \"acRate\": \"74.8%\"}",
"stats": "{\"totalAccepted\": \"17.5K\", \"totalSubmission\": \"23.3K\", \"totalAcceptedRaw\": 17466, \"totalSubmissionRaw\": 23336, \"acRate\": \"74.8%\"}",
"hints": [
"Traverse the first tree in list1 and the second tree in list2.",
"Merge the two trees in one list and sort it."
],
"solution": null,
"status": null,
"sampleTestCase": "[2,1,4]\n[1,0,3]",
"sampleTestCase": "[2,1,4]\r\n[1,0,3]\r",
"metaData": "{\n \"name\": \"getAllElements\",\n \"params\": [\n {\n \"name\": \"root1\",\n \"type\": \"TreeNode\"\n },\n {\n \"type\": \"TreeNode\",\n \"name\": \"root2\"\n }\n ],\n \"return\": {\n \"type\": \"list<integer>\"\n }\n}",
"judgerAvailable": true,
"judgeType": "large",