Package g0901_1000.s0989_add_to_array_form_of_integer

Class Solution

java.lang.Object

g0901_1000.s0989_add_to_array_form_of_integer.Solution

public class Solution
extends Object

989 - Add to Array-Form of Integer.<p>Easy</p> <p>The <strong>array-form</strong> of an integer <code>num</code> is an array representing its digits in left to right order.</p> <ul> <li>For example, for <code>num = 1321</code>, the array form is <code>[1,3,2,1]</code>.</li> </ul> <p>Given <code>num</code>, the <strong>array-form</strong> of an integer, and an integer <code>k</code>, return <em>the <strong>array-form</strong> of the integer</em> <code>num + k</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> num = [1,2,0,0], k = 34</p> <p><strong>Output:</strong> [1,2,3,4]</p> <p><strong>Explanation:</strong> 1200 + 34 = 1234</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> num = [2,7,4], k = 181</p> <p><strong>Output:</strong> [4,5,5]</p> <p><strong>Explanation:</strong> 274 + 181 = 455</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> num = [2,1,5], k = 806</p> <p><strong>Output:</strong> [1,0,2,1]</p> <p><strong>Explanation:</strong> 215 + 806 = 1021</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= num.length <= 10⁴</code></li> <li><code>0 <= num[i] <= 9</code></li> <li><code>num</code> does not contain any leading zeros except for the zero itself.</li> <li><code>1 <= k <= 10⁴</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
List<Integer>	addToArrayForm(int[] num, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

addToArrayForm

public List<Integer> addToArrayForm(int[] num,
 int k)