1
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
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

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 409,
"likes": 410,
"dislikes": 20,
"isLiked": null,
"similarQuestions": "[{\"title\": \"01 Matrix\", \"titleSlug\": \"01-matrix\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Special Positions in a Binary Matrix\", \"titleSlug\": \"special-positions-in-a-binary-matrix\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Remove All Ones With Row and Column Flips\", \"titleSlug\": \"remove-all-ones-with-row-and-column-flips\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"First Completely Painted Row or Column\", \"titleSlug\": \"first-completely-painted-row-or-column\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"25.6K\", \"totalSubmission\": \"32.1K\", \"totalAcceptedRaw\": 25604, \"totalSubmissionRaw\": 32063, \"acRate\": \"79.9%\"}",
"stats": "{\"totalAccepted\": \"25.6K\", \"totalSubmission\": \"32.1K\", \"totalAcceptedRaw\": 25617, \"totalSubmissionRaw\": 32081, \"acRate\": \"79.9%\"}",
"hints": [
"You need to reuse information about a row or a column many times. Try storing it to avoid computing it multiple times.",
"Use an array to store the number of 1s in each row and another array to store the number of 1s in each column. Once you know the number of 1s in each row or column, you can also easily calculate the number of 0s."