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

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 101,
"likes": 102,
"dislikes": 9,
"isLiked": null,
"similarQuestions": "[]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"3.5K\", \"totalAcceptedRaw\": 2127, \"totalSubmissionRaw\": 3542, \"acRate\": \"60.1%\"}",
"stats": "{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"3.6K\", \"totalAcceptedRaw\": 2165, \"totalSubmissionRaw\": 3590, \"acRate\": \"60.3%\"}",
"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.",