1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51: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": false,
"difficulty": "Hard",
"likes": 236,
"dislikes": 14,
"likes": 246,
"dislikes": 16,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[1,1],[2,1],[1,1]]\n2\n3\n3\n[[1,2],[3,3],[3,1],[3,1],[2,4]]\n3\n3\n6\n[[1,4],[1,2],[2,1],[2,1],[3,2],[3,4]]\n3\n6\n7",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"9.6K\", \"totalAcceptedRaw\": 3547, \"totalSubmissionRaw\": 9556, \"acRate\": \"37.1%\"}",
"stats": "{\"totalAccepted\": \"3.7K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 3690, \"totalSubmissionRaw\": 9859, \"acRate\": \"37.4%\"}",
"hints": [
"Try to think of the most basic dp which is n^2 now optimize it",
"Think of any range query data structure to optimize"