coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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-cn/originData/check-if-point-is-reachable.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"4.4K\", \"totalAcceptedRaw\": 2069, \"totalSubmissionRaw\": 4371, \"acRate\": \"47.3%\"}",
"stats": "{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"4.4K\", \"totalAcceptedRaw\": 2070, \"totalSubmissionRaw\": 4373, \"acRate\": \"47.3%\"}",
"hints": [
"Let’s go in reverse order, from (targetX, targetY) to (1, 1). So, now we can move from (x, y) to (x+y, y), (x, y+x), (x/2, y) if x is even, and (x, y/2) if y is even.",
"When is it optimal to use the third and fourth operations?",