Add Two Numbers Via Python

题目要求

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.

Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

题目思路

相加大于10进1位

代码

# Definition for singly-linked list.
class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next


class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        add_number = 0
        result = None
        circle_result = None
        while l1 or l2 or add_number:
            cur_node = ListNode()
            sum = (l1.val if l1 else 0) + (l2.val if l2 else 0) + add_number
            add_number = 0
            if sum >= 10:
                sum = sum - 10
                add_number = 1
            cur_node.val = sum
            if not result:
                result = cur_node
                circle_result = result
            else:
                circle_result.next = cur_node
            circle_result = cur_node
            l1 = l1.next if l1 else None
            l2 = l2.next if l2 else None
        return result


if __name__ == '__main__':
    l1_number = [2, 4, 3, 9]
    l2_number = [5, 6, 4, 6]
    l1 = ListNode(l1_number[0])
    cir_node = l1
    for number in l1_number[1:]:
        cur_node = ListNode(number)
        cir_node.next = cur_node
        cir_node = cur_node

    l2 = ListNode(l2_number[0])
    cir_node = l2
    for number in l2_number[1:]:
        cur_node = ListNode(number)
        cir_node.next = cur_node
        cir_node = cur_node

    result = Solution().addTwoNumbers(l1, l2)