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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/count-the-number-of-infection-sequences.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"2.8K\", \"totalAcceptedRaw\": 1102, \"totalSubmissionRaw\": 2768, \"acRate\": \"39.8%\"}",
"stats": "{\"totalAccepted\": \"1.1K\", \"totalSubmission\": \"2.8K\", \"totalAcceptedRaw\": 1106, \"totalSubmissionRaw\": 2776, \"acRate\": \"39.8%\"}",
"hints": [
"Consider infected children as <code>0</code> and non-infected as <code>1</code>, then divide the array into segments with the same value.",
"For each segment of non-infected children whose indices are <code>[i, j]</code> and indices <code>(i - 1)</code> and <code>(j + 1)</code>, if they exist, are already infected. Then if <code>i == 0</code> or <code>j == n - 1</code>, each second there is only one kid that can be infected (which is at the other endpoint).",