1
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
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": 706,
"dislikes": 14,
"likes": 762,
"dislikes": 16,
"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}]",
"exampleTestcases": "[10,6,8,5,11,9]\n[5,1,2,3,10]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"16.6K\", \"totalSubmission\": \"23.7K\", \"totalAcceptedRaw\": 16628, \"totalSubmissionRaw\": 23718, \"acRate\": \"70.1%\"}",
"stats": "{\"totalAccepted\": \"18.1K\", \"totalSubmission\": \"25.8K\", \"totalAcceptedRaw\": 18106, \"totalSubmissionRaw\": 25825, \"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.",