coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 14:12:17 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 4436, \"totalSubmissionRaw\": 9909, \"acRate\": \"44.8%\"}",
"stats": "{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 4440, \"totalSubmissionRaw\": 9916, \"acRate\": \"44.8%\"}",
"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.",