coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/maximum-fruits-harvested-after-at-most-k-steps.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 244,
"likes": 245,
"dislikes": 14,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximum Performance of a Team\", \"titleSlug\": \"maximum-performance-of-a-team\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6K\", \"totalSubmission\": \"17.1K\", \"totalAcceptedRaw\": 5997, \"totalSubmissionRaw\": 17081, \"acRate\": \"35.1%\"}",
"stats": "{\"totalAccepted\": \"6K\", \"totalSubmission\": \"17.1K\", \"totalAcceptedRaw\": 6012, \"totalSubmissionRaw\": 17111, \"acRate\": \"35.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.",