1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 14:12:17 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给定一个按&nbsp;<strong>非递减顺序</strong>&nbsp;排列的数字数组<meta charset=\"UTF-8\" />&nbsp;<code>digits</code>&nbsp;。你可以用任意次数&nbsp;<code>digits[i]</code>&nbsp;来写的数字。例如,如果<meta charset=\"UTF-8\" />&nbsp;<code>digits = ['1','3','5']</code>,我们可以写数字,如<meta charset=\"UTF-8\" />&nbsp;<code>'13'</code>,&nbsp;<code>'551'</code>, 和&nbsp;<code>'1351315'</code>。</p>\n\n<p>返回 <em>可以生成的小于或等于给定整数 <code>n</code> 的正整数的个数</em>&nbsp;。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<pre>\n<strong>输入:</strong>digits = [\"1\",\"3\",\"5\",\"7\"], n = 100\n<strong>输出:</strong>20\n<strong>解释:</strong>\n可写出的 20 个数字是:\n1, 3, 5, 7, 11, 13, 15, 17, 31, 33, 35, 37, 51, 53, 55, 57, 71, 73, 75, 77.\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre>\n<strong>输入:</strong>digits = [\"1\",\"4\",\"9\"], n = 1000000000\n<strong>输出:</strong>29523\n<strong>解释:</strong>\n我们可以写 3 个一位数字9 个两位数字27 个三位数字,\n81 个四位数字243 个五位数字729 个六位数字,\n2187 个七位数字6561 个八位数字和 19683 个九位数字。\n总共可以使用D中的数字写出 29523 个整数。</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre>\n<strong>输入:</strong>digits = [\"7\"], n = 8\n<strong>输出:</strong>1\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n<meta charset=\"UTF-8\" />\n\n<ul>\n\t<li><code>1 &lt;= digits.length &lt;= 9</code></li>\n\t<li><code>digits[i].length == 1</code></li>\n\t<li><code>digits[i]</code>&nbsp;是从&nbsp;<code>'1'</code>&nbsp;到&nbsp;<code>'9'</code> 的数</li>\n\t<li><code>digits</code>&nbsp;中的所有值都 <strong>不同</strong>&nbsp;</li>\n\t<li><code>digits</code>&nbsp;按&nbsp;<strong>非递减顺序</strong>&nbsp;排列</li>\n\t<li><code>1 &lt;= n &lt;= 10<sup>9</sup></code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 87,
"likes": 92,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"11.6K\", \"totalAcceptedRaw\": 4059, \"totalSubmissionRaw\": 11636, \"acRate\": \"34.9%\"}",
"stats": "{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"12.3K\", \"totalAcceptedRaw\": 4407, \"totalSubmissionRaw\": 12332, \"acRate\": \"35.7%\"}",
"hints": [],
"solution": null,
"status": null,