coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/beautiful-towers-i.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"46.7K\", \"totalAcceptedRaw\": 19912, \"totalSubmissionRaw\": 46697, \"acRate\": \"42.6%\"}",
"stats": "{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"46.7K\", \"totalAcceptedRaw\": 19918, \"totalSubmissionRaw\": 46706, \"acRate\": \"42.6%\"}",
"hints": [
"Try all the possible indices <code>i</code> as the peak.",
"If <code>i</code> is the peak, start from <code>heights[i] = maxHeights[i]</code>, and <code>heights[j] = max(maxHeights[j], heights[j + 1])</code> for <code>0 <= j < i </code>",