coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/minimum-operations-to-reduce-x-to-zero.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1518,
"dislikes": 28,
"likes": 1561,
"dislikes": 30,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Size Subarray Sum\", \"titleSlug\": \"minimum-size-subarray-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Subarray Sum Equals K\", \"titleSlug\": \"subarray-sum-equals-k\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Operations to Convert Number\", \"titleSlug\": \"minimum-operations-to-convert-number\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Removing Minimum Number of Magic Beans\", \"titleSlug\": \"removing-minimum-number-of-magic-beans\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,1,4,2,3]\n5\n[5,6,7,8,9]\n4\n[3,2,20,1,1,3]\n10",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"45.1K\", \"totalSubmission\": \"134.6K\", \"totalAcceptedRaw\": 45116, \"totalSubmissionRaw\": 134632, \"acRate\": \"33.5%\"}",
"stats": "{\"totalAccepted\": \"45.9K\", \"totalSubmission\": \"136.9K\", \"totalAcceptedRaw\": 45917, \"totalSubmissionRaw\": 136879, \"acRate\": \"33.5%\"}",
"hints": [
"Think in reverse; instead of finding the minimum prefix + suffix, find the maximum subarray.",
"Finding the maximum subarray is standard and can be done greedily."