coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-10 01:41: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-points-you-can-obtain-from-cards.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"67.3K\", \"totalSubmission\": \"117.7K\", \"totalAcceptedRaw\": 67257, \"totalSubmissionRaw\": 117684, \"acRate\": \"57.2%\"}",
"stats": "{\"totalAccepted\": \"67.3K\", \"totalSubmission\": \"117.7K\", \"totalAcceptedRaw\": 67273, \"totalSubmissionRaw\": 117719, \"acRate\": \"57.1%\"}",
"hints": [
"Let the sum of all points be total_pts. You need to remove a sub-array from cardPoints with length n - k.",
"Keep a window of size n - k over the array. The answer is max(answer, total_pts - sumOfCurrentWindow)"