update

leetcode/originData/count-the-number-of-infection-sequences.json

@@ -11,7 +11,7 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 40,
+            "likes": 41,
             "dislikes": 10,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Contain Virus\", \"titleSlug\": \"contain-virus\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Amount of Time for Binary Tree to Be Infected\", \"titleSlug\": \"amount-of-time-for-binary-tree-to-be-infected\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"4.7K\", \"totalAcceptedRaw\": 1627, \"totalSubmissionRaw\": 4726, \"acRate\": \"34.4%\"}",
+            "stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"4.9K\", \"totalAcceptedRaw\": 1685, \"totalSubmissionRaw\": 4887, \"acRate\": \"34.5%\"}",
             "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).",