coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 11:21:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2024-10-10 00:43:17 +08:00
parent 76e35939b6
commit 921e076c8e
66 changed files with 23144 additions and 15758 deletions
Download Patch File Download Diff File Expand all files Collapse all files

52
leetcode-cn/problem (Chinese)/替换为数位和以后的最小元素 [minimum-element-after-replacement-with-digit-sum].html Normal file
View File

@@ -0,0 +1,52 @@
<p>给你一个整数数组&nbsp;<code>nums</code>&nbsp;。</p>
<p>请你将 <code>nums</code>&nbsp;中每一个元素都替换为它的各个数位之 <strong>和</strong>&nbsp;。</p>
<p>请你返回替换所有元素以后 <code>nums</code>&nbsp;中的 <strong>最小</strong>&nbsp;元素。</p>
<p>&nbsp;</p>
<p><strong class="example">示例 1：</strong></p>
<div class="example-block">
<p><span class="example-io"><b>输入：</b>nums = [10,12,13,14]</span></p>
<p><span class="example-io"><b>输出：</b>1</span></p>
<p><strong>解释：</strong></p>
<p><code>nums</code>&nbsp;替换后变为&nbsp;<code>[1, 3, 4, 5]</code>&nbsp;，最小元素为 1 。</p>
</div>
<p><strong class="example">示例 2：</strong></p>
<div class="example-block">
<p><span class="example-io"><b>输入：</b>nums = [1,2,3,4]</span></p>
<p><span class="example-io"><b>输出：</b>1</span></p>
<p><b>解释：</b></p>
<p><code>nums</code>&nbsp;替换后变为&nbsp;<code>[1, 2, 3, 4]</code>&nbsp;，最小元素为 1 。</p>
</div>
<p><strong class="example">示例 3：</strong></p>
<div class="example-block">
<p><span class="example-io"><b>输入：</b>nums = [999,19,199]</span></p>
<p><span class="example-io"><b>输出：</b>10</span></p>
<p><strong>解释：</strong></p>
<p><code>nums</code>&nbsp;替换后变为&nbsp;<code>[27, 10, 19]</code>&nbsp;，最小元素为 10 。</p>
</div>
<p>&nbsp;</p>
<p><strong>提示：</strong></p>
<ul>
<li><code>1 &lt;= nums.length &lt;= 100</code></li>
<li><code>1 &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
</ul>