coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-09 17:31:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/recursive-mulitply-lcci.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"28.4K\", \"totalSubmission\": \"42.3K\", \"totalAcceptedRaw\": 28399, \"totalSubmissionRaw\": 42333, \"acRate\": \"67.1%\"}",
"stats": "{\"totalAccepted\": \"28.6K\", \"totalSubmission\": \"42.6K\", \"totalAcceptedRaw\": 28605, \"totalSubmissionRaw\": 42619, \"acRate\": \"67.1%\"}",
"hints": [
"考虑将8乘以9看作是计算宽度为8、高度为9的矩阵中的单元数。",
"如果你想计算8×9矩阵中的单元格数，可以先计算4×9矩阵中的单元格数，然后加倍。",