1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11:41 +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": true,
"difficulty": "Medium",
"likes": 263,
"dislikes": 20,
"likes": 269,
"dislikes": 21,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[0,2],[3,4],[5,7]]\n[1,6]\n[[0,5]]\n[2,3]\n[[-5,-4],[-3,-2],[1,2],[3,5],[8,9]]\n[-1,4]",
@@ -28,7 +28,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"18.7K\", \"totalSubmission\": \"30.6K\", \"totalAcceptedRaw\": 18653, \"totalSubmissionRaw\": 30613, \"acRate\": \"60.9%\"}",
"stats": "{\"totalAccepted\": \"19.3K\", \"totalSubmission\": \"31.6K\", \"totalAcceptedRaw\": 19300, \"totalSubmissionRaw\": 31555, \"acRate\": \"61.2%\"}",
"hints": [
"Solve the problem for every interval alone.",
"Divide the problem into cases according to the position of the two intervals."