给定两个非空链表来表示两个非负整数。位数按照逆序方式存储,它们的每个节点只存储单个数字。将两数相加返回一个新的链表。
你可以假设除了数字 0 之外,这两个数字都不会以零开头。
示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出:7 -> 0 -> 8
原因:342 + 465 = 807
/**
* 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* sum = new ListNode(0); //初始化
ListNode* n = sum;
int s=0;
while(l1 || l2)
{
if(l1)
{
s += l1->val;
l1 = l1->next;
}
if(l2)
{
s += l2->val;
l2 = l2->next;
}
n->next = new ListNode(s%10);
s = s/10;
n = n->next;
}
if(s)
n->next = new ListNode(s%10); //最后一位进位
return sum->next;
}
};
用了m作为中间变量,如果直接用s.val会在最后一位没有进位的时候多输出0
Python
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
l = ListNode(0)
s = l
m = 0
while l1 or l2:
if l1:
m += l1.val
l1 = l1.next
if l2:
m += l2.val
l2 =l2.next
s.next = ListNode(m % 10)
m = m // 10
s = s.next
if m:
s.next = ListNode(m % 10)
return l.next