You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Python:
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
carry = 0 #进位
res = n = ListNode(0)
while l1 or l2 or carry:
v1 = 0
v2 = 0
if l1:
v1 = l1.val
l1 = l1.next
if l2:
v2 = l2.val
l2 = l2.next
carry,val = divmod(v1+v2+carry,10)
n.next = ListNode(val)
n = n.next
return res.next
C++:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode res(0),*n = &res; ##!!!!
int carry = 0;
while(l1 || l2 || carry){
int sum = (l1 ? l1 -> val : 0) + (l2 ? l2 -> val : 0) + carry;
carry = sum /10;
n -> next =new ListNode(sum % 10);
n = n -> next;
l1 = l1 ? l1 -> next : l1;
l2 = l2 ? l2 -> next : l2;
}
return res.next;
}
};