mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-12 08:55:14 +08:00
36 lines
1.2 KiB
HTML
36 lines
1.2 KiB
HTML
<p>Given an integer <code>n</code>, find the digit that occurs <strong>least</strong> frequently in its decimal representation. If multiple digits have the same frequency, choose the <strong>smallest</strong> digit.</p>
|
|
|
|
<p>Return the chosen digit as an integer.</p>
|
|
The <strong>frequency</strong> of a digit <code>x</code> is the number of times it appears in the decimal representation of <code>n</code>.
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">n = 1553322</span></p>
|
|
|
|
<p><strong>Output:</strong> 1</p>
|
|
|
|
<p><strong>Explanation:</strong></p>
|
|
|
|
<p>The least frequent digit in <code>n</code> is 1, which appears only once. All other digits appear twice.</p>
|
|
</div>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">n = 723344511</span></p>
|
|
|
|
<p><strong>Output:</strong> 2</p>
|
|
|
|
<p><strong>Explanation:</strong></p>
|
|
|
|
<p>The least frequent digits in <code>n</code> are 7, 2, and 5; each appears only once.</p>
|
|
</div>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= n <= 2<sup>31</sup> - 1</code></li>
|
|
</ul>
|