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

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/[no content]maximum-number-of-ones.json
View File

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"724\", \"totalSubmission\": \"1.2K\", \"totalAcceptedRaw\": 724, \"totalSubmissionRaw\": 1215, \"acRate\": \"59.6%\"}",
"stats": "{\"totalAccepted\": \"740\", \"totalSubmission\": \"1.2K\", \"totalAcceptedRaw\": 740, \"totalSubmissionRaw\": 1240, \"acRate\": \"59.7%\"}",
"hints": [
"Think of a greedy mathematical solution.",
"Say you choose to set some cell (i, j) to 1, all cells (x, y) such that i % sideLength == x % sideLength and j % sideLength == y % sideLength can also be set to 1 without increasing the max number of ones in a sub-matrix.",