[Python] - Clean & Simple Solution
For Time Complexity we can say O(n),\nand for space O(1). \n\n# Code\n\nclass Solution:\n    def addToArrayForm(self, num: List[int], k: int) -> List[int]:\n   
- For Time Complexity we can say O(n),\nand for space O(1). \n\n# Code\n```\nclass Solution:\n    def addToArrayForm(self, num: List[int], k: int) -> List[int]:\n        n = 0\n        for i in num:\n            n = n * 10 + i\n        \n        n = n + k\n        num = []\n\n        while n != 0:\n            num.append(n % 10)\n            n //= 10\n            \n        return num[::-1]\n```\n\n## One Liner\n```\nclass Solution:\n    def addToArrayForm(self, num: List[int], k: int) -> List[int]:\n        return [int(i) for i in str(int(\'\'.join(map(str,num))) + k)]\n\n```
['Python3']