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

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/number-of-rectangles-that-can-form-the-largest-square.json
View File

@@ -119,7 +119,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"39.9K\", \"totalSubmission\": \"50.7K\", \"totalAcceptedRaw\": 39911, \"totalSubmissionRaw\": 50674, \"acRate\": \"78.8%\"}",
"stats": "{\"totalAccepted\": \"40K\", \"totalSubmission\": \"50.8K\", \"totalAcceptedRaw\": 39982, \"totalSubmissionRaw\": 50759, \"acRate\": \"78.8%\"}",
"hints": [
"What is the length of the largest square the can be cut out of some rectangle? It'll be equal to min(rectangle.length, rectangle.width). Replace each rectangle with this value.",
"Calculate maxSize by iterating over the given rectangles and maximizing the answer with their values denoted in the first hint.",