Tap here to switch tabs
Problem
Submissions

Problem: Add to Array-Form of Integer

Add to Array-Form of Integer gives you an integer as an array of digits and a separate integer k. Return their sum in the same array-form representation.

Statement

The array form of an integer is defined as an array of its digits ordered from left to right. For instance, the array form of 13211321 is [1, 3, 2, 1].

You are given num, which represents an integer in its array form, and an integer k. Compute the sum of the integer represented by num and k, then return the result as an array form representation.

Note: num will not contain leading zeros unless the number itself is zero.

Constraints:

  • 1≤1 \leq num.length ≤104\leq 10^4

  • 0≤0 \leq num[i] ≤9\leq 9

  • num does not contain any leading zeros except for the zero itself

  • 1≤1 \leq k ≤104\leq 10^4

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Add to Array-Form of Integer

Add to Array-Form of Integer gives you an integer as an array of digits and a separate integer k. Return their sum in the same array-form representation.

Statement

The array form of an integer is defined as an array of its digits ordered from left to right. For instance, the array form of 13211321 is [1, 3, 2, 1].

You are given num, which represents an integer in its array form, and an integer k. Compute the sum of the integer represented by num and k, then return the result as an array form representation.

Note: num will not contain leading zeros unless the number itself is zero.

Constraints:

  • 1≤1 \leq num.length ≤104\leq 10^4

  • 0≤0 \leq num[i] ≤9\leq 9

  • num does not contain any leading zeros except for the zero itself

  • 1≤1 \leq k ≤104\leq 10^4