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": 685,
|
||||
"likes": 686,
|
||||
"dislikes": 10,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Maximum Subarray\", \"titleSlug\": \"maximum-subarray\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"20.5K\", \"totalSubmission\": \"36.1K\", \"totalAcceptedRaw\": 20481, \"totalSubmissionRaw\": 36109, \"acRate\": \"56.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"20.5K\", \"totalSubmission\": \"36.2K\", \"totalAcceptedRaw\": 20530, \"totalSubmissionRaw\": 36181, \"acRate\": \"56.7%\"}",
|
||||
"hints": [
|
||||
"What if we asked for maximum sum, not absolute sum?",
|
||||
"It's a standard problem that can be solved by Kadane's algorithm.",
|
||||
|
Reference in New Issue
Block a user