mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"9.4K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 9440, \"totalSubmissionRaw\": 19173, \"acRate\": \"49.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"9.4K\", \"totalSubmission\": \"19.2K\", \"totalAcceptedRaw\": 9441, \"totalSubmissionRaw\": 19174, \"acRate\": \"49.2%\"}",
|
||||
"hints": [
|
||||
"Note down the different actions that can be done on a piece of wood with dimensions m x n. What do you notice?",
|
||||
"If possible, we could sell the m x n piece. We could also cut the piece vertically creating two pieces of size m x n1 and m x n2 where n1 + n2 = n, or horizontally creating two pieces of size m1 x n and m2 x n where m1 + m2 = m.",
|
||||
|
||||
Reference in New Issue
Block a user