coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 17:01:42 +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-cn/originData/maximum-consecutive-floors-without-special-floors.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"10.4K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 10391, \"totalSubmissionRaw\": 19772, \"acRate\": \"52.6%\"}",
"stats": "{\"totalAccepted\": \"10.4K\", \"totalSubmission\": \"19.8K\", \"totalAcceptedRaw\": 10392, \"totalSubmissionRaw\": 19780, \"acRate\": \"52.5%\"}",
"hints": [
"Say we have a pair of special floors (x, y) with no other special floors in between. There are x - y - 1 consecutive floors in between them without a special floor.",
"Say there are n special floors. After sorting special, we have answer = max(answer, special[i] – special[i – 1] – 1) for all 0 < i ≤ n.",