mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 1516,
|
||||
"likes": 1518,
|
||||
"dislikes": 28,
|
||||
"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}]",
|
||||
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"45.1K\", \"totalSubmission\": \"134.5K\", \"totalAcceptedRaw\": 45070, \"totalSubmissionRaw\": 134479, \"acRate\": \"33.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"45.1K\", \"totalSubmission\": \"134.6K\", \"totalAcceptedRaw\": 45116, \"totalSubmissionRaw\": 134632, \"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."
|
||||
|
Reference in New Issue
Block a user