Loading...
Loading...
Loading...
Two large counts are stored one digit per node, with the lowest digit first. Add them and print the sum in the same form, one digit per value, lowest digit first.
Example
Input
2 4 3 5 6 4
Output
7 0 8
Try the problem first. Open one hint at a time.
Add the two digits and the carry, then use divmod(total, 10).
Keep looping while either list or the carry has something left.
Write your Python code, run it on the examples and submit it to hidden tests.
Solve in the editor