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-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

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 245,
"dislikes": 14,
"likes": 253,
"dislikes": 15,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximum Performance of a Team\", \"titleSlug\": \"maximum-performance-of-a-team\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[[2,8],[6,3],[8,6]]\n5\n4\n[[0,9],[4,1],[5,7],[6,2],[7,4],[10,9]]\n5\n4\n[[0,3],[6,4],[8,5]]\n3\n2",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6K\", \"totalSubmission\": \"17.1K\", \"totalAcceptedRaw\": 6012, \"totalSubmissionRaw\": 17111, \"acRate\": \"35.1%\"}",
"stats": "{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"17.6K\", \"totalAcceptedRaw\": 6173, \"totalSubmissionRaw\": 17550, \"acRate\": \"35.2%\"}",
"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.",