coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 21:46:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
leetcode/originData/maximum-spending-after-buying-items.json
View File

@@ -11,14 +11,39 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 42,
"dislikes": 17,
"likes": 67,
"dislikes": 20,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximum Points You Can Obtain from Cards\", \"titleSlug\": \"maximum-points-you-can-obtain-from-cards\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Score from Performing Multiplication Operations\", \"titleSlug\": \"maximum-score-from-performing-multiplication-operations\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[[8,5,2],[6,4,1],[9,7,3]]\n[[10,8,6,4,2],[9,7,5,3,2]]",
"categoryTitle": "Algorithms",
"contributors": [],
"topicTags": [],
"topicTags": [
{
"name": "Array",
"slug": "array",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "Greedy",
"slug": "greedy",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "Sorting",
"slug": "sorting",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "Heap (Priority Queue)",
"slug": "heap-priority-queue",
"translatedName": null,
"__typename": "TopicTagNode"
}
],
"companyTagStats": null,
"codeSnippets": [
{
@@ -136,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"8.6K\", \"totalAcceptedRaw\": 5448, \"totalSubmissionRaw\": 8639, \"acRate\": \"63.1%\"}",
"stats": "{\"totalAccepted\": \"7.6K\", \"totalSubmission\": \"11.8K\", \"totalAcceptedRaw\": 7631, \"totalSubmissionRaw\": 11811, \"acRate\": \"64.6%\"}",
"hints": [
"Iterate on days <code>1</code> to <code>m * n</code>.",
"On each day, buy the product that minimizes <code>values[i][values[i].length - 1]</code>, and pop it from <code>values[i]</code>."