mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-25 14:58:56 +08:00
update
This commit is contained in:
@@ -46,7 +46,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"2.4K\", \"totalSubmission\": \"3.3K\", \"totalAcceptedRaw\": 2369, \"totalSubmissionRaw\": 3277, \"acRate\": \"72.3%\"}",
|
||||
"stats": "{\"totalAccepted\": \"2.4K\", \"totalSubmission\": \"3.3K\", \"totalAcceptedRaw\": 2377, \"totalSubmissionRaw\": 3291, \"acRate\": \"72.2%\"}",
|
||||
"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`."
|
||||
],
|
||||
|
||||
Reference in New Issue
Block a user