coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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/max-black-square-lcci.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"14.9K\", \"totalAcceptedRaw\": 5608, \"totalSubmissionRaw\": 14922, \"acRate\": \"37.6%\"}",
"stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"15K\", \"totalAcceptedRaw\": 5617, \"totalSubmissionRaw\": 14959, \"acRate\": \"37.5%\"}",
"hints": [
"从蛮力解法开始。你能先试试最大的正方形吗?",
"最大的正方形是N×N。所以你先试一下该正方形，如果可行，那么你便知道已经找到了最佳正方形。否则，可以尝试下一个最小的正方形。",