LeetCode 2. Add Two Numbers 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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

  
  

   
   
Subscribe to see which companies asked this question.
  
  

学了几天python简单的运用一下

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

def len(l1):
    l = 0
    while l1 != None:
        l = l + 1
        l1 = l1.next
    return l

class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        s1 = ''
        s2 = ''
        for i in range(0,len(l1)):
            s1 += str(l1.val)
            l1 = l1.next
        for i in range(0,len(l2)):
            s2 += str(l2.val)
            l2 = l2.next
        ss1 = s1[::-1]
        ss2 = s2[::-1]
        temp = str(int(ss1) + int(ss2))
        L = []
        for i in temp:
            L.append(int(i))
        return L[::-1]