coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-09 01:11:42 +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-cn/originData/recursive-mulitply-lcci.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"49.4K\", \"totalSubmission\": \"75.5K\", \"totalAcceptedRaw\": 49444, \"totalSubmissionRaw\": 75478, \"acRate\": \"65.5%\"}",
"stats": "{\"totalAccepted\": \"49.5K\", \"totalSubmission\": \"75.5K\", \"totalAcceptedRaw\": 49453, \"totalSubmissionRaw\": 75487, \"acRate\": \"65.5%\"}",
"hints": [
"考虑将8乘以9看作是计算宽度为8、高度为9的矩阵中的单元数。",
"如果你想计算8×9矩阵中的单元格数，可以先计算4×9矩阵中的单元格数，然后加倍。",