coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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]two-sum-bsts.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 377,
"dislikes": 36,
"likes": 387,
"dislikes": 37,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Two Sum IV - Input is a BST\", \"titleSlug\": \"two-sum-iv-input-is-a-bst\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[2,1,4]\n[1,0,3]\n5\n[0,-10,10]\n[5,1,7,0,2]\n18",
@@ -64,7 +64,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"31.7K\", \"totalSubmission\": \"47.6K\", \"totalAcceptedRaw\": 31748, \"totalSubmissionRaw\": 47557, \"acRate\": \"66.8%\"}",
"stats": "{\"totalAccepted\": \"32.5K\", \"totalSubmission\": \"48.9K\", \"totalAcceptedRaw\": 32508, \"totalSubmissionRaw\": 48866, \"acRate\": \"66.5%\"}",
"hints": [
"How can you reduce this problem to the classical Two Sum problem?",
"Do an in-order traversal of each tree to convert them to sorted arrays.",