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/cracking-the-safe.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 184,
"dislikes": 32,
"likes": 199,
"dislikes": 36,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "1\n2\n2\n2",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"45.2K\", \"totalSubmission\": \"82.9K\", \"totalAcceptedRaw\": 45206, \"totalSubmissionRaw\": 82934, \"acRate\": \"54.5%\"}",
"stats": "{\"totalAccepted\": \"45.8K\", \"totalSubmission\": \"83.9K\", \"totalAcceptedRaw\": 45793, \"totalSubmissionRaw\": 83907, \"acRate\": \"54.6%\"}",
"hints": [
"We can think of this problem as the problem of finding an Euler path (a path visiting every edge exactly once) on the following graph: there are $$k^{n-1}$$ nodes with each node having $$k$$ edges. It turns out this graph always has an Eulerian circuit (path starting where it ends.)\r\n\r\nWe should visit each node in \"post-order\" so as to not get stuck in the graph prematurely."
],