mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 12561,
|
||||
"dislikes": 402,
|
||||
"likes": 12578,
|
||||
"dislikes": 403,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Two Sum\", \"titleSlug\": \"two-sum\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Continuous Subarray Sum\", \"titleSlug\": \"continuous-subarray-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Subarray Product Less Than K\", \"titleSlug\": \"subarray-product-less-than-k\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Find Pivot Index\", \"titleSlug\": \"find-pivot-index\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Subarray Sums Divisible by K\", \"titleSlug\": \"subarray-sums-divisible-by-k\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Operations to Reduce X to Zero\", \"titleSlug\": \"minimum-operations-to-reduce-x-to-zero\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"K Radius Subarray Averages\", \"titleSlug\": \"k-radius-subarray-averages\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[1,1,1]\n2\n[1,2,3]\n3",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"743.3K\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 743328, \"totalSubmissionRaw\": 1682947, \"acRate\": \"44.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"744.8K\", \"totalSubmission\": \"1.7M\", \"totalAcceptedRaw\": 744771, \"totalSubmissionRaw\": 1686107, \"acRate\": \"44.2%\"}",
|
||||
"hints": [
|
||||
"Will Brute force work here? Try to optimize it.",
|
||||
"Can we optimize it by using some extra space?",
|
||||
|
Reference in New Issue
Block a user