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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 702,
"likes": 706,
"dislikes": 14,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Buildings With an Ocean View\", \"titleSlug\": \"buildings-with-an-ocean-view\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Sum of Subarray Ranges\", \"titleSlug\": \"sum-of-subarray-ranges\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16.5K\", \"totalSubmission\": \"23.6K\", \"totalAcceptedRaw\": 16508, \"totalSubmissionRaw\": 23562, \"acRate\": \"70.1%\"}",
"stats": "{\"totalAccepted\": \"16.6K\", \"totalSubmission\": \"23.7K\", \"totalAcceptedRaw\": 16628, \"totalSubmissionRaw\": 23718, \"acRate\": \"70.1%\"}",
"hints": [
"How to solve this problem in quadratic complexity ?",
"For every subarray start at index i, keep finding new maximum values until a value larger than arr[i] is found.",