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:
小墨
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

4
leetcode/originData/delete-greatest-value-in-each-row.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 580,
"likes": 581,
"dislikes": 36,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Equal Row and Column Pairs\", \"titleSlug\": \"equal-row-and-column-pairs\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"47.5K\", \"totalSubmission\": \"60.9K\", \"totalAcceptedRaw\": 47521, \"totalSubmissionRaw\": 60924, \"acRate\": \"78.0%\"}",
"stats": "{\"totalAccepted\": \"47.6K\", \"totalSubmission\": \"61K\", \"totalAcceptedRaw\": 47554, \"totalSubmissionRaw\": 60960, \"acRate\": \"78.0%\"}",
"hints": [
"Iterate from the first to the last row and if there exist some unmarked cells, take a maximum from them and mark that cell as visited.",
"Add a maximum of newly marked cells to answer and repeat that operation until the whole matrix becomes marked."