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

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 2690,
"dislikes": 106,
"likes": 2695,
"dislikes": 108,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximum Score from Performing Multiplication Operations\", \"titleSlug\": \"maximum-score-from-performing-multiplication-operations\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Removing Minimum and Maximum From Array\", \"titleSlug\": \"removing-minimum-and-maximum-from-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,3,4,5,6,1]\n3\n[2,2,2]\n2\n[9,7,7,9,7,7,9]\n7",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"124.4K\", \"totalSubmission\": \"248.8K\", \"totalAcceptedRaw\": 124389, \"totalSubmissionRaw\": 248844, \"acRate\": \"50.0%\"}",
"stats": "{\"totalAccepted\": \"124.6K\", \"totalSubmission\": \"249.4K\", \"totalAcceptedRaw\": 124649, \"totalSubmissionRaw\": 249353, \"acRate\": \"50.0%\"}",
"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)"