Leetcode:Add Two Number

解释说明

初次开始Leetcode刷题，所以很多方面的知识还不了解
只是当做在线笔记本记下自己对于代码的理解，大家共同进步吧！
这题不会，代码是别人的（向大佬学习），重在理解

题目说明

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.

代码部分

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

class Solution:
    def addTwoNumbers(self, l1, l2 ,c = 0):
####l1,l2为函数输入
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        val = l1.val + l2.val + c
###l1,l2为列表类数值，每次val指向当前值即列表最后一位值，c初始化为0，含义为加法运算时的进位值
        c = val // 10
###末位相加，对10向下取整得到进位数
        ret = ListNode(val % 10 ) 
###末位相加，对10取余得到本位数
        
        if (l1.next != None or l2.next != None or c != 0):
###三种不为零的情况，表示需继续计算下一高位
            if l1.next == None:
                l1.next = ListNode(0)
            if l2.next == None:
                l2.next = ListNode(0)
            ret.next = self.addTwoNumbers(l1.next,l2.next,c)
 ###每一次下一高位相加时需加上之前的进位值c
        return ret