coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/maximum-erasure-value.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 800,
"dislikes": 13,
"likes": 803,
"dislikes": 14,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Longest Substring Without Repeating Characters\", \"titleSlug\": \"longest-substring-without-repeating-characters\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[4,2,4,5,6]\n[5,2,1,2,5,2,1,2,5]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"40.4K\", \"totalSubmission\": \"77.2K\", \"totalAcceptedRaw\": 40417, \"totalSubmissionRaw\": 77199, \"acRate\": \"52.4%\"}",
"stats": "{\"totalAccepted\": \"40.5K\", \"totalSubmission\": \"77.3K\", \"totalAcceptedRaw\": 40491, \"totalSubmissionRaw\": 77341, \"acRate\": \"52.4%\"}",
"hints": [
"The main point here is for the subarray to contain unique elements for each index. Only the first subarrays starting from that index have unique elements.",
"This can be solved using the two pointers technique"