9.15 练手 腾讯50题 2两数相加

Leetcode 2. Add Two Numbers

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.

 

思路是直接一个一个加，然后用一个key值记录进位，比较麻烦的地方是在链表末尾可能还有剩余可能要一直进位的情况，如 99 + 1 = 100，写的不是很elegant，代码如下：

class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        head = ListNode(0)
        key = 0
        addVal = l1.val + l2.val + key
        if (addVal >= 10):
            addVal -= 10
            key = 1
        else:
            key = 0
        parent = ListNode(addVal)
        head.next = parent
        l1 = l1.next
        l2 = l2.next
        while (l1 and l2):
            addVal = l1.val + l2.val + key
            if (addVal >= 10):
                addVal -= 10
                key = 1
            else:
                key = 0
            parent.next = ListNode(addVal)
            parent = parent.next
            l1 = l1.next
            l2 = l2.next
        if (l1):
            parent.next = l1
            if(key):
                l1.val += key
                while(l1.val >= 10 ):
                    l1.val -= 10
                    if(l1.next):
                        l1 = l1.next
                        l1.val += 1
                    else:
                        l1.next = ListNode(1)
                key = 0

        if (l2):
            parent.next = l2
            if(key):
                l2.val += key
                while(l2.val >= 10):
                    l2.val -= 10
                    if(l2.next):
                        l2 = l2.next
                        l2.val += 1
                    else:
                        l2.next = ListNode(1)
                key = 0

        if(key):
            parent.next = ListNode(key)
        return head.next

beat 90+% 这个速度很玄学。