update

leetcode-cn/originData/reverse-bits-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个32位整数 <code>num</code>，你可以将一个数位从0变为1。请编写一个程序，找出你能够获得的最长的一串1的长度。</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre><strong>输入:</strong> <code>num</code> = 1775(11011101111<sub>2</sub>)\n<strong>输出:</strong> 8\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre><strong>输入:</strong> <code>num</code> = 7(0111<sub>2</sub>)\n<strong>输出:</strong> 4\n</pre>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 72,
+            "likes": 73,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"37.3K\", \"totalAcceptedRaw\": 14227, \"totalSubmissionRaw\": 37272, \"acRate\": \"38.2%\"}",
+            "stats": "{\"totalAccepted\": \"15K\", \"totalSubmission\": \"39.4K\", \"totalAcceptedRaw\": 15021, \"totalSubmissionRaw\": 39377, \"acRate\": \"38.1%\"}",
             "hints": [
                 "先试试蛮力解法。你能尝试一切可能性吗？",
                 "把0翻转到1可以合并两个1 的序列，但只有在这两个序列仅被一个0分隔时才可以。",