coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/minimum-swaps-to-arrange-a-binary-grid.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 418,
"likes": 419,
"dislikes": 59,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"24.2K\", \"totalAcceptedRaw\": 11065, \"totalSubmissionRaw\": 24212, \"acRate\": \"45.7%\"}",
"stats": "{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"24.3K\", \"totalAcceptedRaw\": 11085, \"totalSubmissionRaw\": 24272, \"acRate\": \"45.7%\"}",
"hints": [
"For each row of the grid calculate the most right 1 in the grid in the array maxRight.",
"To check if there exist answer, sort maxRight and check if maxRight[i] ≤ i for all possible i's.",