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:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/open-the-lock.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"217.7K\", \"totalSubmission\": \"389.7K\", \"totalAcceptedRaw\": 217721, \"totalSubmissionRaw\": 389688, \"acRate\": \"55.9%\"}",
"stats": "{\"totalAccepted\": \"217.7K\", \"totalSubmission\": \"389.7K\", \"totalAcceptedRaw\": 217731, \"totalSubmissionRaw\": 389704, \"acRate\": \"55.9%\"}",
"hints": [
"We can think of this problem as a shortest path problem on a graph: there are `10000` nodes (strings `'0000'` to `'9999'`), and there is an edge between two nodes if they differ in one digit, that digit differs by 1 (wrapping around, so `'0'` and `'9'` differ by 1), and if *both* nodes are not in `deadends`."
],