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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/[no content]number-of-corner-rectangles.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 570,
"likes": 571,
"dislikes": 85,
"isLiked": null,
"similarQuestions": "[]",
@@ -46,7 +46,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"35.4K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 35441, \"totalSubmissionRaw\": 52494, \"acRate\": \"67.5%\"}",
"stats": "{\"totalAccepted\": \"35.4K\", \"totalSubmission\": \"52.5K\", \"totalAcceptedRaw\": 35448, \"totalSubmissionRaw\": 52508, \"acRate\": \"67.5%\"}",
"hints": [
"For each pair of 1s in the new row (say at `new_row[i]` and `new_row[j]`), we could create more rectangles where that pair forms the base. The number of new rectangles is the number of times some previous row had `row[i] = row[j] = 1`."
],