mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 324,
|
||||
"dislikes": 40,
|
||||
"likes": 338,
|
||||
"dislikes": 41,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[[5,8],[3,9],[5,12],[16,5]]\n[[2,3],[3,7],[4,3],[3,7]]",
|
||||
@@ -119,7 +119,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"40K\", \"totalSubmission\": \"50.8K\", \"totalAcceptedRaw\": 39982, \"totalSubmissionRaw\": 50759, \"acRate\": \"78.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"41K\", \"totalSubmission\": \"52K\", \"totalAcceptedRaw\": 40958, \"totalSubmissionRaw\": 51998, \"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.",
|
||||
|
Reference in New Issue
Block a user