coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 08:51:42 +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/originData/[no content]maximum-number-of-books-you-can-take.json
View File

@@ -46,7 +46,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"8.2K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 8242, \"totalSubmissionRaw\": 19154, \"acRate\": \"43.0%\"}",
"stats": "{\"totalAccepted\": \"8.2K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 8244, \"totalSubmissionRaw\": 19180, \"acRate\": \"43.0%\"}",
"hints": [
"Create a dp array where dp[i] is the maximum number of books you can take if you can only take books from bookshelves 0 to i and you must take books from bookshelf i.",
"Keep taking as many books as you can (i.e. starting from bookshelf i and going backwards, you take arr[i], arr[i] - 1, arr[i] - 2, … books).",