mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"14.1K\", \"totalSubmission\": \"41.1K\", \"totalAcceptedRaw\": 14091, \"totalSubmissionRaw\": 41075, \"acRate\": \"34.3%\"}",
|
||||
"stats": "{\"totalAccepted\": \"14.1K\", \"totalSubmission\": \"41.1K\", \"totalAcceptedRaw\": 14093, \"totalSubmissionRaw\": 41080, \"acRate\": \"34.3%\"}",
|
||||
"hints": [
|
||||
"The heights of the rectangles and the y-coordinates of the points are only at most 100, so for each point, we can iterate over the possible heights of the rectangles that contain a given point.",
|
||||
"For a given point and height, can we efficiently count how many rectangles with that height contain our point?",
|
||||
|
Reference in New Issue
Block a user