coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-09 17:31: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/maximum-fruits-harvested-after-at-most-k-steps.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"39.8K\", \"totalAcceptedRaw\": 17938, \"totalSubmissionRaw\": 39783, \"acRate\": \"45.1%\"}",
"stats": "{\"totalAccepted\": \"17.9K\", \"totalSubmission\": \"39.8K\", \"totalAcceptedRaw\": 17938, \"totalSubmissionRaw\": 39785, \"acRate\": \"45.1%\"}",
"hints": [
"Does an optimal path have very few patterns? For example, could a path that goes left, turns and goes right, then turns again and goes left be any better than a path that simply goes left, turns, and goes right?",
"The optimal path turns at most once. That is, the optimal path is one of these: to go left only; to go right only; to go left, turn and go right; or to go right, turn and go left.",