mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-08 08:51:42 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p><strong>自除数</strong><em> </em>是指可以被它包含的每一位数整除的数。</p>\n\n<ul>\n\t<li>例如,<code>128</code> 是一个 <strong>自除数</strong> ,因为 <code>128 % 1 == 0</code>,<code>128 % 2 == 0</code>,<code>128 % 8 == 0</code>。</li>\n</ul>\n\n<p><strong>自除数</strong> 不允许包含 0 。</p>\n\n<p>给定两个整数 <code>left</code> 和 <code>right</code> ,返回一个列表,<em>列表的元素是范围 <code>[left, right]</code> 内所有的 <strong>自除数</strong></em> 。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>left = 1, right = 22\n<strong>输出:</strong>[1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<b>输入:</b>left = 47, right = 85\n<b>输出:</b>[48,55,66,77]\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= left <= right <= 10<sup>4</sup></code></li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 151,
|
||||
"likes": 232,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Perfect Number\", \"titleSlug\": \"perfect-number\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u5b8c\\u7f8e\\u6570\"}]",
|
||||
@@ -137,7 +137,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"38K\", \"totalSubmission\": \"50.8K\", \"totalAcceptedRaw\": 38036, \"totalSubmissionRaw\": 50848, \"acRate\": \"74.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"70.4K\", \"totalSubmission\": \"89.2K\", \"totalAcceptedRaw\": 70382, \"totalSubmissionRaw\": 89192, \"acRate\": \"78.9%\"}",
|
||||
"hints": [
|
||||
"For each number in the range, check whether it is self dividing by converting that number to a character array (or string in Python), then checking that each digit is nonzero and divides the original number."
|
||||
],
|
||||
|
Reference in New Issue
Block a user