coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 13:36:46 +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

2
leetcode-cn/originData/minimum-moves-to-reach-target-with-rotations.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"6.4K\", \"totalAcceptedRaw\": 2905, \"totalSubmissionRaw\": 6374, \"acRate\": \"45.6%\"}",
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"6.5K\", \"totalAcceptedRaw\": 2946, \"totalSubmissionRaw\": 6455, \"acRate\": \"45.6%\"}",
"hints": [
"Use BFS to find the answer.",
"The state of the BFS is the position (x, y) along with a binary value that specifies if the position is horizontal or vertical."