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-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

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 316,
"dislikes": 24,
"likes": 321,
"dislikes": 25,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Find Valid Matrix Given Row and Column Sums\", \"titleSlug\": \"find-valid-matrix-given-row-and-column-sums\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "2\n1\n[1,1,1]\n2\n3\n[2,2,1,1]\n5\n5\n[2,1,2,0,1,0,1,2,0,1]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"18.8K\", \"totalSubmission\": \"43.7K\", \"totalAcceptedRaw\": 18842, \"totalSubmissionRaw\": 43658, \"acRate\": \"43.2%\"}",
"stats": "{\"totalAccepted\": \"19.2K\", \"totalSubmission\": \"44.3K\", \"totalAcceptedRaw\": 19190, \"totalSubmissionRaw\": 44343, \"acRate\": \"43.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."