1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-03 14:32:54 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 425,
"dislikes": 16,
"likes": 432,
"dislikes": 17,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[\"A..\",\"AAA\",\"...\"]\n3\n[\"A..\",\"AA.\",\"...\"]\n3\n[\"A..\",\"A..\",\"...\"]\n1",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"20.6K\", \"totalAcceptedRaw\": 11369, \"totalSubmissionRaw\": 20570, \"acRate\": \"55.3%\"}",
"stats": "{\"totalAccepted\": \"11.5K\", \"totalSubmission\": \"20.8K\", \"totalAcceptedRaw\": 11497, \"totalSubmissionRaw\": 20770, \"acRate\": \"55.4%\"}",
"hints": [
"Note that after each cut the remaining piece of pizza always has the lower right coordinate at (rows-1,cols-1).",
"Use dynamic programming approach with states (row1, col1, c) which computes the number of ways of cutting the pizza using \"c\" cuts where the current piece of pizza has upper left coordinate at (row1,col1) and lower right coordinate at (rows-1,cols-1).",