Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 989 with 12 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 989 # by problem number
lcpy gen -s add_to_array_form_of_integer # by problem name
num is an array representing its digits in left to right order.
num = 1321, the array form is [1,3,2,1].num, the array-form of an integer, and an integer k, return the array-form of the integer num + k.
Input: num = [1,2,0,0], k = 34
Output: [1,2,3,4]
Explanation: 1200 + 34 = 1234
Input: num = [2,7,4], k = 181
Output: [4,5,5]
Explanation: 274 + 181 = 455
Input: num = [2,1,5], k = 806
Output: [1,0,2,1]
Explanation: 215 + 806 = 1021
1 <= num.length <= 10^40 <= num[i] <= 9num does not contain any leading zeros except for the zero itself.1 <= k <= 10^4class Solution:
# Time: O(max(n, log k))
# Space: O(max(n, log k)) for the output
def add_to_array_form(self, num: list[int], k: int) -> list[int]:
result: list[int] = []
i = len(num) - 1
carry = k
while i >= 0 or carry > 0:
if i >= 0:
carry += num[i]
i -= 1
result.append(carry % 10)
carry //= 10
return result[::-1]
| Time | Space |
|---|---|
| O(max(n, log k)) | O(max(n, log k)) for the output |