mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 458,
|
||||
"likes": 462,
|
||||
"dislikes": 19,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Continuous Subarray Sum\", \"titleSlug\": \"continuous-subarray-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"25.2K\", \"totalAcceptedRaw\": 10594, \"totalSubmissionRaw\": 25233, \"acRate\": \"42.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"25.3K\", \"totalAcceptedRaw\": 10629, \"totalSubmissionRaw\": 25293, \"acRate\": \"42.0%\"}",
|
||||
"hints": [
|
||||
"For each unique value found in the array, store a sorted list of indices of elements that have this value in the array.",
|
||||
"One way of doing this is to use a HashMap that maps the values to their list of indices. Update this mapping as you iterate through the array.",
|
||||
|
Reference in New Issue
Block a user