coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21: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

6
leetcode/originData/restore-the-array-from-adjacent-pairs.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 606,
"dislikes": 10,
"likes": 628,
"dislikes": 11,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[2,1],[3,4],[3,2]]\n[[4,-2],[1,4],[-3,1]]\n[[100000,-100000]]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.4K\", \"totalSubmission\": \"35.9K\", \"totalAcceptedRaw\": 24439, \"totalSubmissionRaw\": 35903, \"acRate\": \"68.1%\"}",
"stats": "{\"totalAccepted\": \"25.2K\", \"totalSubmission\": \"37.1K\", \"totalAcceptedRaw\": 25246, \"totalSubmissionRaw\": 37060, \"acRate\": \"68.1%\"}",
"hints": [
"Find the first element of nums - it will only appear once in adjacentPairs.",
"The adjacent pairs are like edges of a graph. Perform a depth-first search from the first element."