1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 462,
"dislikes": 19,
"likes": 476,
"dislikes": 20,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Continuous Subarray Sum\", \"titleSlug\": \"continuous-subarray-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[2,1,3,1,2,3,3]\n[10,5,10,10]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"10.6K\", \"totalSubmission\": \"25.3K\", \"totalAcceptedRaw\": 10629, \"totalSubmissionRaw\": 25293, \"acRate\": \"42.0%\"}",
"stats": "{\"totalAccepted\": \"11K\", \"totalSubmission\": \"26.1K\", \"totalAcceptedRaw\": 10982, \"totalSubmissionRaw\": 26070, \"acRate\": \"42.1%\"}",
"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.",