coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +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

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

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"12K\", \"totalAcceptedRaw\": 5628, \"totalSubmissionRaw\": 11983, \"acRate\": \"47.0%\"}",
"stats": "{\"totalAccepted\": \"5.6K\", \"totalSubmission\": \"12K\", \"totalAcceptedRaw\": 5630, \"totalSubmissionRaw\": 11987, \"acRate\": \"47.0%\"}",
"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.",