leetcode-445_AddTwoNumbersII

leetcode-445_AddTwoNumbersII

标签（空格分隔）： 数据结构, leetcode

---

上代码

#!/usr/bin/env python 
# encoding: utf-8 

"""
链表加法
需要用栈记录下两个链表，然后把结果放进list，最后再生成链表
@author: zkjiang
@time: 2019/5/16 14:38

You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first 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.

Follow up:
What if you cannot modify the input lists? In other words, reversing the lists is not allowed.

Example:

Input: (7 -> 2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 8 -> 0 -> 7

"""


# 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
        """
        stack1 = []
        stack2 = []
        while l1:
            stack1.append(l1.val)
            l1 = l1.next
        while l2:
            stack2.append(l2.val)
            l2 = l2.next
        dummy = ListNode(0)
        result = dummy
        tag = 0
        res = []
        while stack1 or stack2:
            if stack1:
                val1 = stack1.pop()
            else:
                val1 = 0
            if stack2:
                val2 = stack2.pop()

            else:
                val2 = 0
            tmp_result = val1 + val2 + tag
            if tmp_result > 9:
                tmp_result = tmp_result - 10
                tag = 1
            else:
                tag = 0
            res.append(tmp_result)
        if tag == 1:
            res.append(1)
        while res:
            val = res.pop()
            dummy.next = ListNode(val)
            dummy = dummy.next
        return result.next