[Python3] Improving the Leetcode Solution and Avoiding the Use of 'str', 'int' and 'map'
Notes:\n- Leetcode provided a simple solution, but it is not efficient. K has 5 digits at most, but A can have 10000 elements. This means that the summation mig
# Notes:\n- Leetcode provided a simple [solution](https://leetcode.com/problems/add-to-array-form-of-integer/solution/), but it is not efficient. K has 5 digits at most, but A can have 10000 elements. This means that the summation might finish after 5 iterations, but the loop will continue for 10000 times! I added a condition to avoid this.\n- I think the purpose of this question is to provide a summation based on elementary school math, and avoid other functions such as \'str\', \'int\' and \'map\'. \n- The Leetcode solution does not work for Python3, but slight changes would make it compatible for both Python/ Python3.\n\n\n# Python/ Python3 code:\n```\n        for i in range(len(A) - 1, -1, -1):\n            if not K: break\n            K, A[i] = divmod(A[i] + K, 10)\n        while K:\n            K, a = divmod(K, 10)\n            A = [a] + A\n        return A\n```
['Python', 'Python3']