coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +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/snail-traversal.json
View File

@@ -34,7 +34,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"11.3K\", \"totalAcceptedRaw\": 7333, \"totalSubmissionRaw\": 11266, \"acRate\": \"65.1%\"}",
"stats": "{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"11.3K\", \"totalAcceptedRaw\": 7345, \"totalSubmissionRaw\": 11285, \"acRate\": \"65.1%\"}",
"hints": [
"Different ways to approach this problem. Perhaps store a boolean if you are moving up or down and a current column. Reverse the direction and increment the column every time you hits a wall.",
"Is there a way way to do this without storing state - by just using math?"