mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 234,
|
||||
"likes": 236,
|
||||
"dislikes": 14,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"9.5K\", \"totalAcceptedRaw\": 3538, \"totalSubmissionRaw\": 9539, \"acRate\": \"37.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"9.6K\", \"totalAcceptedRaw\": 3547, \"totalSubmissionRaw\": 9556, \"acRate\": \"37.1%\"}",
|
||||
"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"
|
||||
|
Reference in New Issue
Block a user