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/number-of-rectangles-that-can-form-the-largest-square.json
View File

@@ -119,7 +119,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"64.3K\", \"totalSubmission\": \"81.8K\", \"totalAcceptedRaw\": 64332, \"totalSubmissionRaw\": 81835, \"acRate\": \"78.6%\"}",
"stats": "{\"totalAccepted\": \"64.3K\", \"totalSubmission\": \"81.8K\", \"totalAcceptedRaw\": 64339, \"totalSubmissionRaw\": 81843, \"acRate\": \"78.6%\"}",
"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.",