mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-03 06:22:54 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给定三个整数 <code>x</code> 、 <code>y</code> 和<em> </em><code>bound</code><em> </em>,返回 <em>值小于或等于 <code>bound</code> 的所有 <strong>强整数</strong> 组成的列表</em> 。</p>\n\n<p>如果某一整数可以表示为 <code>x<sup>i</sup> + y<sup>j</sup></code> ,其中整数 <code>i >= 0</code> 且 <code>j >= 0</code>,那么我们认为该整数是一个 <strong>强整数</strong> 。</p>\n\n<p>你可以按 <strong>任何顺序</strong> 返回答案。在你的回答中,每个值 <strong>最多</strong> 出现一次。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>x = 2, y = 3, bound = 10\n<strong>输出:</strong>[2,3,4,5,7,9,10]\n<strong>解释: </strong>\n2 = 2<sup>0</sup> + 3<sup>0</sup>\n3 = 2<sup>1</sup> + 3<sup>0</sup>\n4 = 2<sup>0</sup> + 3<sup>1</sup>\n5 = 2<sup>1</sup> + 3<sup>1</sup>\n7 = 2<sup>2</sup> + 3<sup>1</sup>\n9 = 2<sup>3</sup> + 3<sup>0</sup>\n10 = 2<sup>0</sup> + 3<sup>2</sup></pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong>x = 3, y = 5, bound = 15\n<strong>输出:</strong>[2,4,6,8,10,14]\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= x, y <= 100</code></li>\n\t<li><code>0 <= bound <= 10<sup>6</sup></code></li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 55,
|
||||
"likes": 56,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"11.9K\", \"totalSubmission\": \"28.9K\", \"totalAcceptedRaw\": 11894, \"totalSubmissionRaw\": 28919, \"acRate\": \"41.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"12.1K\", \"totalSubmission\": \"29.3K\", \"totalAcceptedRaw\": 12078, \"totalSubmissionRaw\": 29307, \"acRate\": \"41.2%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "111",
|
||||
|
Reference in New Issue
Block a user