(p1, p2)
| 52 | |
| 53 | # Helper function for recursive adding lists |
| 54 | def addListsFwd2Helper(p1, p2): |
| 55 | if (p1 == None) and (p2 == None): |
| 56 | sumandcarry = [None,0] # a python list stores sum node and carry |
| 57 | return sumandcarry |
| 58 | sumandcarry = addListsFwd2Helper(p1.next, p2.next) |
| 59 | val = p1.value + p2.value + sumandcarry[1] |
| 60 | dig_node = insertBefore(sumandcarry[0], val%10) |
| 61 | carry = val/10 |
| 62 | return [dig_node, carry] |
| 63 | |
| 64 | |
| 65 | # Helper function to insert node in the front of a linked list |
no test coverage detected