coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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/originData/reconstruct-a-2-row-binary-matrix.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"54.5K\", \"totalAcceptedRaw\": 24689, \"totalSubmissionRaw\": 54512, \"acRate\": \"45.3%\"}",
"stats": "{\"totalAccepted\": \"24.7K\", \"totalSubmission\": \"54.5K\", \"totalAcceptedRaw\": 24693, \"totalSubmissionRaw\": 54518, \"acRate\": \"45.3%\"}",
"hints": [
"You cannot do anything about colsum[i] = 2 case or colsum[i] = 0 case. Then you put colsum[i] = 1 case to the upper row until upper has reached. Then put the rest into lower row.",
"Fill 0 and 2 first, then fill 1 in the upper row or lower row in turn but be careful about exhausting permitted 1s in each row."