【2.5链表】 链式A+B

题目描述

有两个用链表表示的整数，每个结点包含一个数位。这些数位是反向存放的，也就是个位排在链表的首部。编写函数对这两个整数求和，并用链表形式返回结果。
给定两个链表ListNode* A，ListNode* B，请返回A+B的结果(ListNode*)。
测试样例：
{1,2,3},{3,2,1}
返回：{4,4,4}

思路

# -*- coding:utf-8 -*-
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Plus:
    def plusAB(self, a, b):
        # 从链首开始相加，保存进位
        remainder = 0
        _sum = 0
        sum_node = ListNode(0)
        p = sum_node 
        while a != None and b != None:
            p.next = ListNode((a.val + b.val + remainder)%10)
            remainder = (a.val + b.val + remainder)/10
            p = p.next
            a = a.next
            b = b.next
        while a:
            p.next = ListNode((a.val + remainder)%10)
            remainder = (a.val + remainder)/10
            p = p.next
            a = a.next
        while b:
            p.next = ListNode((b.val + remainder)%10)
            remainder = (b.val + remainder)/10
            p = p.next
            b = b.next
        if remainder != 0:
            p.next = ListNode(remainder)
        return sum_node.next