coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-09 09:21:40 +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

4
leetcode/originData/maximum-points-you-can-obtain-from-cards.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 5808,
"likes": 5809,
"dislikes": 212,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximum Score from Performing Multiplication Operations\", \"titleSlug\": \"maximum-score-from-performing-multiplication-operations\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Removing Minimum and Maximum From Array\", \"titleSlug\": \"removing-minimum-and-maximum-from-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Recolors to Get K Consecutive Black Blocks\", \"titleSlug\": \"minimum-recolors-to-get-k-consecutive-black-blocks\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Maximum Spending After Buying Items\", \"titleSlug\": \"maximum-spending-after-buying-items\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"242K\", \"totalSubmission\": \"463K\", \"totalAcceptedRaw\": 242017, \"totalSubmissionRaw\": 463048, \"acRate\": \"52.3%\"}",
"stats": "{\"totalAccepted\": \"242K\", \"totalSubmission\": \"463.1K\", \"totalAcceptedRaw\": 242035, \"totalSubmissionRaw\": 463084, \"acRate\": \"52.3%\"}",
"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)"