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

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

8
leetcode/originData/[no content]range-addition.json
View File

@@ -11,10 +11,10 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 1225,
"dislikes": 56,
"likes": 1264,
"dislikes": 62,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Range Addition II\", \"titleSlug\": \"range-addition-ii\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"similarQuestions": "[{\"title\": \"Range Addition II\", \"titleSlug\": \"range-addition-ii\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Count Positions on Street With Required Brightness\", \"titleSlug\": \"count-positions-on-street-with-required-brightness\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "5\n[[1,3,2],[2,4,3],[0,2,-2]]\n10\n[[2,4,6],[5,6,8],[1,9,-4]]",
"categoryTitle": "Algorithms",
"contributors": [],
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"65K\", \"totalSubmission\": \"94K\", \"totalAcceptedRaw\": 64995, \"totalSubmissionRaw\": 93980, \"acRate\": \"69.2%\"}",
"stats": "{\"totalAccepted\": \"67.8K\", \"totalSubmission\": \"97.6K\", \"totalAcceptedRaw\": 67773, \"totalSubmissionRaw\": 97572, \"acRate\": \"69.5%\"}",
"hints": [
"Thinking of using advanced data structures? You are thinking it too complicated.",
"For each update operation, do you really need to update all elements between i and j?",