[ Leetcode ] #2. Add Two Numbers（C++ & 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.

题目 https://leetcode.com/problems/add-two-numbers/

题意

• 给两个非空链表，每个链表各反向存储一个非负数值串（例如：342）
• 求解两个链表对应数值的和，并反向存储在输出链表中
• 除数值串为0以外，链表所存储的数值不以0开头

分析

Leetcode第二题，Difficulty：Medium。 看到题目直观思路如下：

1. 两个非空链表，相应位置元素相加，进位情况要考虑进来
2. 链表长度有可能不一致，求和
3. 最后一位相加有可能产生进位，最后需要单独做一个判断
4. 结果：Runtime: 24 ms, faster than 91.59% of C++ online submissions for Add Two Numbers.

Code

/**
 * 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) {
        int count=0;
        ListNode head(0);
        ListNode *p;
        p=&head;
        while(l1 || l2){
            if(l1 && l2){
                count += l1->val + l2->val;
                l1 = l1->next;
                l2 = l2->next;
            }else if(l1 && !l2){
                count += l1->val;
                l1 = l1->next;
            }else if(!l1 && l2){
                count += l2->val;
                l2 = l2->next;
            }
            ListNode *tmp = new ListNode(count%10);
            p->next = tmp;
            p = tmp;
            count/=10;
        }
        // 如果最后还有进位 单独处理
        if(count){
            ListNode *tmp = new ListNode(count);
            p->next = tmp;
            p = tmp;
        }
        // 因为是从head.next开始处理的，所以返回的是head.next
        return head.next;
    }
};

Python3版

完全按照上面C++的思路，使用python3实现，结果如下：

Runtime: 144 ms, faster than 19.82% of Python3 online submissions for Add Two Numbers.

分析使用python性能差距原因，完全套用了C++的思维方式，几乎没有使用到python的特性，导致Runtime奇慢。

下面分别给出C++ for python 和 python for python代码比对。

 

C++ for 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
        """
        p = ListNode(0)
        head = p
        s=0
        while l1 != None or l2 != None:
            if l1 != None and l2 != None:
                s += l1.val + l2.val
                l1 = l1.next
                l2 = l2.next
            elif l1 != None:
                s += l1.val
                l1 = l1.next
            elif l2 != None:
                s += l2.val
                l2 = l2.next
            tmp = ListNode(s%10)
            p.next = tmp
            p = tmp
            s = s//10
        if s:
            tmp = ListNode(s % 10)
            p.next = tmp
            p = tmp
        return head.next
        

python for python

结果：Runtime: 104 ms, faster than 58.48% of Python3 online submissions for Add Two Numbers.

# 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
        """
        s1 = ''
        s2 = ''
        while l1 != None:
            s1 += str(l1.val)
            l1 = l1.next
        while l2 != None:
            s2 += str(l2.val)
            l2 = l2.next
        # 反转s1，s2 并分别转换为整数，两个整数相加得到结果后转回字符串 然后翻转得到答案
        s = str(int(s1[::-1]) + int(s2[::-1]))[::-1]
        ans = head = ListNode(int(s[0]))
        for i in s[1:]:
            tmp = ListNode(int(i))
            head.next = tmp
            head = tmp
        return ans
        

通过以上对比发现，巧妙的使用python的一些特性，能够使程序的执行效率得到一定的提升。

Status:  Accepted