update

leetcode-cn/originData/nth-digit.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个整数 <code>n</code> ，请你在无限的整数序列&nbsp;<code>[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...]</code> 中找出并返回第&nbsp;<code>n</code><em> </em>位上的数字。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>n = 3\n<strong>输出：</strong>3\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>n = 11\n<strong>输出：</strong>0\n<strong>解释：</strong>第 11 位数字在序列 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ... 里是 <strong>0 </strong>，它是 10 的一部分。\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= n &lt;= 2<sup>31</sup> - 1</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 308,
+            "likes": 309,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"45.8K\", \"totalSubmission\": \"100.6K\", \"totalAcceptedRaw\": 45837, \"totalSubmissionRaw\": 100602, \"acRate\": \"45.6%\"}",
+            "stats": "{\"totalAccepted\": \"47K\", \"totalSubmission\": \"103.1K\", \"totalAcceptedRaw\": 46971, \"totalSubmissionRaw\": 103139, \"acRate\": \"45.5%\"}",
             "hints": [],
             "solution": null,
             "status": null,