mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 23:07:08 +00:00
Deven
41 lines
1.6 KiB
Markdown
41 lines
1.6 KiB
Markdown
<h2><a href="https://leetcode.com/problems/plus-one/">66. Plus One</a></h2><h3>Easy</h3><hr><div><p>You are given a <strong>large integer</strong> represented as an integer array <code>digits</code>, where each <code>digits[i]</code> is the <code>i<sup>th</sup></code> digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading <code>0</code>'s.</p>
|
|
|
|
<p>Increment the large integer by one and return <em>the resulting array of digits</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre><strong>Input:</strong> digits = [1,2,3]
|
|
<strong>Output:</strong> [1,2,4]
|
|
<strong>Explanation:</strong> The array represents the integer 123.
|
|
Incrementing by one gives 123 + 1 = 124.
|
|
Thus, the result should be [1,2,4].
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre><strong>Input:</strong> digits = [4,3,2,1]
|
|
<strong>Output:</strong> [4,3,2,2]
|
|
<strong>Explanation:</strong> The array represents the integer 4321.
|
|
Incrementing by one gives 4321 + 1 = 4322.
|
|
Thus, the result should be [4,3,2,2].
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre><strong>Input:</strong> digits = [9]
|
|
<strong>Output:</strong> [1,0]
|
|
<strong>Explanation:</strong> The array represents the integer 9.
|
|
Incrementing by one gives 9 + 1 = 10.
|
|
Thus, the result should be [1,0].
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= digits.length <= 100</code></li>
|
|
<li><code>0 <= digits[i] <= 9</code></li>
|
|
<li><code>digits</code> does not contain any leading <code>0</code>'s.</li>
|
|
</ul>
|
|
</div> |