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

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