coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 21:16:45 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/reconstruct-a-2-row-binary-matrix.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.8K\", \"totalSubmission\": \"14.6K\", \"totalAcceptedRaw\": 5812, \"totalSubmissionRaw\": 14639, \"acRate\": \"39.7%\"}",
"stats": "{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"14.8K\", \"totalAcceptedRaw\": 5890, \"totalSubmissionRaw\": 14828, \"acRate\": \"39.7%\"}",
"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."